./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/mem_slave_tlm.1_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/mem_slave_tlm.1_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fbecaa911234564619645b897eed5716f7c8acd9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:24:21,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:24:21,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:24:21,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:24:21,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:24:21,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:24:21,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:24:21,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:24:21,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:24:21,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:24:21,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:24:21,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:24:21,813 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:24:21,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:24:21,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:24:21,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:24:21,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:24:21,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:24:21,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:24:21,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:24:21,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:24:21,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:24:21,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:24:21,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:24:21,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:24:21,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:24:21,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:24:21,829 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:24:21,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:24:21,830 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:24:21,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:24:21,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:24:21,831 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:24:21,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:24:21,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:24:21,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:24:21,833 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:24:21,860 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:24:21,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:24:21,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:24:21,863 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:24:21,863 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:24:21,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:24:21,863 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:24:21,863 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:24:21,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:24:21,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:24:21,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:24:21,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:24:21,864 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:24:21,866 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:24:21,866 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:24:21,866 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:24:21,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:24:21,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:24:21,867 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:24:21,867 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:24:21,867 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:24:21,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:24:21,867 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:24:21,869 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:24:21,869 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:24:21,869 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:24:21,869 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:24:21,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:24:21,870 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fbecaa911234564619645b897eed5716f7c8acd9 [2018-12-31 10:24:21,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:24:21,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:24:21,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:24:21,940 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:24:21,940 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:24:21,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/mem_slave_tlm.1_true-unreach-call_false-termination.cil.c [2018-12-31 10:24:22,017 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7637e38/89b6ffdd01c64559be078dddbfe6e549/FLAGd042bc54a [2018-12-31 10:24:22,533 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:24:22,534 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/mem_slave_tlm.1_true-unreach-call_false-termination.cil.c [2018-12-31 10:24:22,558 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7637e38/89b6ffdd01c64559be078dddbfe6e549/FLAGd042bc54a [2018-12-31 10:24:22,824 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7637e38/89b6ffdd01c64559be078dddbfe6e549 [2018-12-31 10:24:22,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:24:22,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:24:22,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:24:22,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:24:22,834 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:24:22,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:24:22" (1/1) ... [2018-12-31 10:24:22,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ac873a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:22, skipping insertion in model container [2018-12-31 10:24:22,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:24:22" (1/1) ... [2018-12-31 10:24:22,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:24:22,906 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:24:23,300 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:24:23,311 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:24:23,439 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:24:23,460 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:24:23,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23 WrapperNode [2018-12-31 10:24:23,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:24:23,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:24:23,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:24:23,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:24:23,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... [2018-12-31 10:24:23,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... [2018-12-31 10:24:23,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:24:23,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:24:23,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:24:23,644 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:24:23,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... [2018-12-31 10:24:23,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... [2018-12-31 10:24:23,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... [2018-12-31 10:24:23,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... [2018-12-31 10:24:23,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... [2018-12-31 10:24:23,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... [2018-12-31 10:24:23,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... [2018-12-31 10:24:23,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:24:23,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:24:23,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:24:23,718 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:24:23,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:24:23,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:24:23,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:24:25,966 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:24:25,967 INFO L280 CfgBuilder]: Removed 39 assue(true) statements. [2018-12-31 10:24:25,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:24:25 BoogieIcfgContainer [2018-12-31 10:24:25,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:24:25,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:24:25,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:24:25,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:24:25,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:24:22" (1/3) ... [2018-12-31 10:24:25,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db1ed82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:24:25, skipping insertion in model container [2018-12-31 10:24:25,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:24:23" (2/3) ... [2018-12-31 10:24:25,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db1ed82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:24:25, skipping insertion in model container [2018-12-31 10:24:25,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:24:25" (3/3) ... [2018-12-31 10:24:25,977 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1_true-unreach-call_false-termination.cil.c [2018-12-31 10:24:25,986 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:24:25,994 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-31 10:24:26,012 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-31 10:24:26,050 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:24:26,051 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:24:26,051 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:24:26,051 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:24:26,052 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:24:26,052 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:24:26,053 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:24:26,053 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:24:26,053 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:24:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2018-12-31 10:24:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 10:24:26,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:26,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:26,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:26,109 INFO L82 PathProgramCache]: Analyzing trace with hash 991682984, now seen corresponding path program 1 times [2018-12-31 10:24:26,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:26,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:26,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:26,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:26,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:26,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:26,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:26,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:26,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:26,343 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 3 states. [2018-12-31 10:24:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:27,186 INFO L93 Difference]: Finished difference Result 719 states and 1304 transitions. [2018-12-31 10:24:27,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:27,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-31 10:24:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:27,207 INFO L225 Difference]: With dead ends: 719 [2018-12-31 10:24:27,207 INFO L226 Difference]: Without dead ends: 446 [2018-12-31 10:24:27,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-31 10:24:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 430. [2018-12-31 10:24:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-12-31 10:24:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 673 transitions. [2018-12-31 10:24:27,313 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 673 transitions. Word has length 27 [2018-12-31 10:24:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:27,313 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 673 transitions. [2018-12-31 10:24:27,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 673 transitions. [2018-12-31 10:24:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 10:24:27,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:27,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:27,317 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:27,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2034129844, now seen corresponding path program 1 times [2018-12-31 10:24:27,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:27,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:27,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:27,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:27,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:27,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:27,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:27,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:27,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:27,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:27,418 INFO L87 Difference]: Start difference. First operand 430 states and 673 transitions. Second operand 3 states. [2018-12-31 10:24:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:28,248 INFO L93 Difference]: Finished difference Result 1123 states and 1781 transitions. [2018-12-31 10:24:28,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:28,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-31 10:24:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:28,259 INFO L225 Difference]: With dead ends: 1123 [2018-12-31 10:24:28,260 INFO L226 Difference]: Without dead ends: 707 [2018-12-31 10:24:28,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-12-31 10:24:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 691. [2018-12-31 10:24:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-12-31 10:24:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1112 transitions. [2018-12-31 10:24:28,327 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1112 transitions. Word has length 36 [2018-12-31 10:24:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:28,327 INFO L480 AbstractCegarLoop]: Abstraction has 691 states and 1112 transitions. [2018-12-31 10:24:28,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1112 transitions. [2018-12-31 10:24:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 10:24:28,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:28,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:28,330 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash -838577631, now seen corresponding path program 1 times [2018-12-31 10:24:28,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:28,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:28,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:28,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:28,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:28,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:28,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:28,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:28,417 INFO L87 Difference]: Start difference. First operand 691 states and 1112 transitions. Second operand 3 states. [2018-12-31 10:24:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:28,620 INFO L93 Difference]: Finished difference Result 1749 states and 2817 transitions. [2018-12-31 10:24:28,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:28,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-31 10:24:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:28,628 INFO L225 Difference]: With dead ends: 1749 [2018-12-31 10:24:28,628 INFO L226 Difference]: Without dead ends: 1083 [2018-12-31 10:24:28,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-12-31 10:24:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1071. [2018-12-31 10:24:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2018-12-31 10:24:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1722 transitions. [2018-12-31 10:24:28,682 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1722 transitions. Word has length 37 [2018-12-31 10:24:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:28,683 INFO L480 AbstractCegarLoop]: Abstraction has 1071 states and 1722 transitions. [2018-12-31 10:24:28,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1722 transitions. [2018-12-31 10:24:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 10:24:28,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:28,686 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-31 10:24:28,686 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:28,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash -981805896, now seen corresponding path program 1 times [2018-12-31 10:24:28,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:28,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:28,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:28,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:28,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:28,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:28,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:28,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:28,823 INFO L87 Difference]: Start difference. First operand 1071 states and 1722 transitions. Second operand 3 states. [2018-12-31 10:24:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:29,172 INFO L93 Difference]: Finished difference Result 2861 states and 4598 transitions. [2018-12-31 10:24:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:29,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-31 10:24:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:29,185 INFO L225 Difference]: With dead ends: 2861 [2018-12-31 10:24:29,185 INFO L226 Difference]: Without dead ends: 1815 [2018-12-31 10:24:29,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2018-12-31 10:24:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1669. [2018-12-31 10:24:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-12-31 10:24:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2644 transitions. [2018-12-31 10:24:29,275 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2644 transitions. Word has length 46 [2018-12-31 10:24:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:29,275 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2644 transitions. [2018-12-31 10:24:29,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2644 transitions. [2018-12-31 10:24:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 10:24:29,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:29,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:29,279 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2018-12-31 10:24:29,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:29,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:29,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:29,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:29,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:29,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:29,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:29,381 INFO L87 Difference]: Start difference. First operand 1669 states and 2644 transitions. Second operand 3 states. [2018-12-31 10:24:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:30,741 INFO L93 Difference]: Finished difference Result 4653 states and 7348 transitions. [2018-12-31 10:24:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:30,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-31 10:24:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:30,760 INFO L225 Difference]: With dead ends: 4653 [2018-12-31 10:24:30,760 INFO L226 Difference]: Without dead ends: 3003 [2018-12-31 10:24:30,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2018-12-31 10:24:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2937. [2018-12-31 10:24:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2018-12-31 10:24:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 4575 transitions. [2018-12-31 10:24:30,906 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 4575 transitions. Word has length 52 [2018-12-31 10:24:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:30,906 INFO L480 AbstractCegarLoop]: Abstraction has 2937 states and 4575 transitions. [2018-12-31 10:24:30,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 4575 transitions. [2018-12-31 10:24:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 10:24:30,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:30,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:30,910 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2018-12-31 10:24:30,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:30,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:30,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:30,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:30,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:30,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:31,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:31,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:31,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:31,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:31,002 INFO L87 Difference]: Start difference. First operand 2937 states and 4575 transitions. Second operand 3 states. [2018-12-31 10:24:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:31,398 INFO L93 Difference]: Finished difference Result 6903 states and 10702 transitions. [2018-12-31 10:24:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:31,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-31 10:24:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:31,422 INFO L225 Difference]: With dead ends: 6903 [2018-12-31 10:24:31,423 INFO L226 Difference]: Without dead ends: 3989 [2018-12-31 10:24:31,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2018-12-31 10:24:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3805. [2018-12-31 10:24:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3805 states. [2018-12-31 10:24:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 5841 transitions. [2018-12-31 10:24:31,632 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 5841 transitions. Word has length 52 [2018-12-31 10:24:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:31,632 INFO L480 AbstractCegarLoop]: Abstraction has 3805 states and 5841 transitions. [2018-12-31 10:24:31,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 5841 transitions. [2018-12-31 10:24:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 10:24:31,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:31,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:31,637 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:31,637 INFO L82 PathProgramCache]: Analyzing trace with hash -471765361, now seen corresponding path program 1 times [2018-12-31 10:24:31,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:31,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:31,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:31,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:31,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:31,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:31,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:31,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:31,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:31,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:31,723 INFO L87 Difference]: Start difference. First operand 3805 states and 5841 transitions. Second operand 3 states. [2018-12-31 10:24:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:34,940 INFO L93 Difference]: Finished difference Result 9149 states and 14130 transitions. [2018-12-31 10:24:34,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:34,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-31 10:24:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:34,969 INFO L225 Difference]: With dead ends: 9149 [2018-12-31 10:24:34,969 INFO L226 Difference]: Without dead ends: 5367 [2018-12-31 10:24:34,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2018-12-31 10:24:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 5277. [2018-12-31 10:24:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5277 states. [2018-12-31 10:24:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 8009 transitions. [2018-12-31 10:24:35,232 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 8009 transitions. Word has length 56 [2018-12-31 10:24:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:35,232 INFO L480 AbstractCegarLoop]: Abstraction has 5277 states and 8009 transitions. [2018-12-31 10:24:35,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 8009 transitions. [2018-12-31 10:24:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 10:24:35,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:35,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:35,235 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1405970949, now seen corresponding path program 1 times [2018-12-31 10:24:35,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:35,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:35,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:35,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:35,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:35,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:35,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:35,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:35,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:35,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:35,408 INFO L87 Difference]: Start difference. First operand 5277 states and 8009 transitions. Second operand 3 states. [2018-12-31 10:24:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:35,962 INFO L93 Difference]: Finished difference Result 10531 states and 15988 transitions. [2018-12-31 10:24:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:35,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-31 10:24:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:35,992 INFO L225 Difference]: With dead ends: 10531 [2018-12-31 10:24:35,993 INFO L226 Difference]: Without dead ends: 5277 [2018-12-31 10:24:36,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2018-12-31 10:24:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 5277. [2018-12-31 10:24:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5277 states. [2018-12-31 10:24:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 7873 transitions. [2018-12-31 10:24:36,199 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 7873 transitions. Word has length 58 [2018-12-31 10:24:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:36,200 INFO L480 AbstractCegarLoop]: Abstraction has 5277 states and 7873 transitions. [2018-12-31 10:24:36,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 7873 transitions. [2018-12-31 10:24:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 10:24:36,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:36,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:36,205 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1783171650, now seen corresponding path program 1 times [2018-12-31 10:24:36,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:36,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:36,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:36,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:36,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:36,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:36,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:36,288 INFO L87 Difference]: Start difference. First operand 5277 states and 7873 transitions. Second operand 3 states. [2018-12-31 10:24:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:37,031 INFO L93 Difference]: Finished difference Result 11891 states and 17776 transitions. [2018-12-31 10:24:37,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:37,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-31 10:24:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:37,060 INFO L225 Difference]: With dead ends: 11891 [2018-12-31 10:24:37,061 INFO L226 Difference]: Without dead ends: 6637 [2018-12-31 10:24:37,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2018-12-31 10:24:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 5907. [2018-12-31 10:24:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5907 states. [2018-12-31 10:24:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5907 states to 5907 states and 8635 transitions. [2018-12-31 10:24:37,325 INFO L78 Accepts]: Start accepts. Automaton has 5907 states and 8635 transitions. Word has length 59 [2018-12-31 10:24:37,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:37,325 INFO L480 AbstractCegarLoop]: Abstraction has 5907 states and 8635 transitions. [2018-12-31 10:24:37,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 5907 states and 8635 transitions. [2018-12-31 10:24:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 10:24:37,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:37,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:37,331 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash -920667186, now seen corresponding path program 1 times [2018-12-31 10:24:37,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:37,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:37,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:37,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:37,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:37,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:37,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:24:37,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:24:37,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:24:37,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:24:37,455 INFO L87 Difference]: Start difference. First operand 5907 states and 8635 transitions. Second operand 5 states. [2018-12-31 10:24:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:39,801 INFO L93 Difference]: Finished difference Result 30963 states and 45372 transitions. [2018-12-31 10:24:39,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 10:24:39,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-31 10:24:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:39,864 INFO L225 Difference]: With dead ends: 30963 [2018-12-31 10:24:39,864 INFO L226 Difference]: Without dead ends: 25079 [2018-12-31 10:24:39,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:24:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25079 states. [2018-12-31 10:24:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25079 to 8255. [2018-12-31 10:24:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8255 states. [2018-12-31 10:24:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8255 states to 8255 states and 12088 transitions. [2018-12-31 10:24:40,517 INFO L78 Accepts]: Start accepts. Automaton has 8255 states and 12088 transitions. Word has length 61 [2018-12-31 10:24:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:40,518 INFO L480 AbstractCegarLoop]: Abstraction has 8255 states and 12088 transitions. [2018-12-31 10:24:40,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:24:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8255 states and 12088 transitions. [2018-12-31 10:24:40,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 10:24:40,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:40,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:40,522 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:40,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:40,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1524549323, now seen corresponding path program 1 times [2018-12-31 10:24:40,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:40,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:40,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:40,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:40,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 10:24:40,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:24:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:24:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:24:40,717 INFO L87 Difference]: Start difference. First operand 8255 states and 12088 transitions. Second operand 7 states. [2018-12-31 10:24:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:44,239 INFO L93 Difference]: Finished difference Result 41073 states and 60227 transitions. [2018-12-31 10:24:44,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-31 10:24:44,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-12-31 10:24:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:44,316 INFO L225 Difference]: With dead ends: 41073 [2018-12-31 10:24:44,316 INFO L226 Difference]: Without dead ends: 32841 [2018-12-31 10:24:44,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2018-12-31 10:24:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32841 states. [2018-12-31 10:24:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32841 to 5497. [2018-12-31 10:24:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2018-12-31 10:24:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 7945 transitions. [2018-12-31 10:24:45,034 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 7945 transitions. Word has length 62 [2018-12-31 10:24:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:45,034 INFO L480 AbstractCegarLoop]: Abstraction has 5497 states and 7945 transitions. [2018-12-31 10:24:45,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:24:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 7945 transitions. [2018-12-31 10:24:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-31 10:24:45,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:45,037 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-31 10:24:45,037 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1908319894, now seen corresponding path program 1 times [2018-12-31 10:24:45,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:45,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:45,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:45,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:45,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:45,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:45,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:45,115 INFO L87 Difference]: Start difference. First operand 5497 states and 7945 transitions. Second operand 3 states. [2018-12-31 10:24:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:45,820 INFO L93 Difference]: Finished difference Result 11578 states and 16683 transitions. [2018-12-31 10:24:45,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:45,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-31 10:24:45,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:45,834 INFO L225 Difference]: With dead ends: 11578 [2018-12-31 10:24:45,834 INFO L226 Difference]: Without dead ends: 6102 [2018-12-31 10:24:45,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2018-12-31 10:24:46,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 6010. [2018-12-31 10:24:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6010 states. [2018-12-31 10:24:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 8641 transitions. [2018-12-31 10:24:46,902 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 8641 transitions. Word has length 77 [2018-12-31 10:24:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:46,902 INFO L480 AbstractCegarLoop]: Abstraction has 6010 states and 8641 transitions. [2018-12-31 10:24:46,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 8641 transitions. [2018-12-31 10:24:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-31 10:24:46,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:46,905 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-12-31 10:24:46,906 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:46,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1154888105, now seen corresponding path program 1 times [2018-12-31 10:24:46,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:46,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:46,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:46,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:46,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:46,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:46,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:46,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:46,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:46,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:46,983 INFO L87 Difference]: Start difference. First operand 6010 states and 8641 transitions. Second operand 3 states. [2018-12-31 10:24:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:47,957 INFO L93 Difference]: Finished difference Result 15494 states and 22182 transitions. [2018-12-31 10:24:47,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:47,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-12-31 10:24:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:47,971 INFO L225 Difference]: With dead ends: 15494 [2018-12-31 10:24:47,972 INFO L226 Difference]: Without dead ends: 9373 [2018-12-31 10:24:47,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9373 states. [2018-12-31 10:24:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9373 to 9345. [2018-12-31 10:24:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9345 states. [2018-12-31 10:24:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9345 states to 9345 states and 13259 transitions. [2018-12-31 10:24:49,368 INFO L78 Accepts]: Start accepts. Automaton has 9345 states and 13259 transitions. Word has length 88 [2018-12-31 10:24:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:49,368 INFO L480 AbstractCegarLoop]: Abstraction has 9345 states and 13259 transitions. [2018-12-31 10:24:49,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 9345 states and 13259 transitions. [2018-12-31 10:24:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 10:24:49,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:49,371 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:49,372 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:49,372 INFO L82 PathProgramCache]: Analyzing trace with hash -258076045, now seen corresponding path program 1 times [2018-12-31 10:24:49,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:49,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:49,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:49,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:49,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:49,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:49,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:49,488 INFO L87 Difference]: Start difference. First operand 9345 states and 13259 transitions. Second operand 3 states. [2018-12-31 10:24:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:50,892 INFO L93 Difference]: Finished difference Result 17198 states and 24332 transitions. [2018-12-31 10:24:50,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:50,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-31 10:24:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:50,903 INFO L225 Difference]: With dead ends: 17198 [2018-12-31 10:24:50,903 INFO L226 Difference]: Without dead ends: 6890 [2018-12-31 10:24:50,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2018-12-31 10:24:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6477. [2018-12-31 10:24:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6477 states. [2018-12-31 10:24:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6477 states to 6477 states and 8769 transitions. [2018-12-31 10:24:51,686 INFO L78 Accepts]: Start accepts. Automaton has 6477 states and 8769 transitions. Word has length 95 [2018-12-31 10:24:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:51,686 INFO L480 AbstractCegarLoop]: Abstraction has 6477 states and 8769 transitions. [2018-12-31 10:24:51,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 6477 states and 8769 transitions. [2018-12-31 10:24:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 10:24:51,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:51,689 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-31 10:24:51,689 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash 642962762, now seen corresponding path program 1 times [2018-12-31 10:24:51,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:51,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:51,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 10:24:51,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:51,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:51,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:51,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:51,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:51,783 INFO L87 Difference]: Start difference. First operand 6477 states and 8769 transitions. Second operand 3 states. [2018-12-31 10:24:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:52,323 INFO L93 Difference]: Finished difference Result 10474 states and 14252 transitions. [2018-12-31 10:24:52,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:52,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-31 10:24:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:52,329 INFO L225 Difference]: With dead ends: 10474 [2018-12-31 10:24:52,329 INFO L226 Difference]: Without dead ends: 4111 [2018-12-31 10:24:52,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2018-12-31 10:24:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 4093. [2018-12-31 10:24:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4093 states. [2018-12-31 10:24:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 5426 transitions. [2018-12-31 10:24:52,806 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 5426 transitions. Word has length 98 [2018-12-31 10:24:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:52,806 INFO L480 AbstractCegarLoop]: Abstraction has 4093 states and 5426 transitions. [2018-12-31 10:24:52,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 5426 transitions. [2018-12-31 10:24:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 10:24:52,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:52,808 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-31 10:24:52,809 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 635068147, now seen corresponding path program 1 times [2018-12-31 10:24:52,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:52,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:52,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:52,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:52,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:24:53,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:53,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:53,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:53,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:53,071 INFO L87 Difference]: Start difference. First operand 4093 states and 5426 transitions. Second operand 3 states. [2018-12-31 10:24:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:53,714 INFO L93 Difference]: Finished difference Result 7248 states and 9640 transitions. [2018-12-31 10:24:53,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:53,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-31 10:24:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:53,718 INFO L225 Difference]: With dead ends: 7248 [2018-12-31 10:24:53,719 INFO L226 Difference]: Without dead ends: 3230 [2018-12-31 10:24:53,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2018-12-31 10:24:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 2928. [2018-12-31 10:24:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2018-12-31 10:24:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3791 transitions. [2018-12-31 10:24:54,041 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3791 transitions. Word has length 98 [2018-12-31 10:24:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:54,041 INFO L480 AbstractCegarLoop]: Abstraction has 2928 states and 3791 transitions. [2018-12-31 10:24:54,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3791 transitions. [2018-12-31 10:24:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 10:24:54,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:54,043 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-31 10:24:54,043 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:54,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1785938939, now seen corresponding path program 1 times [2018-12-31 10:24:54,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:54,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:54,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:54,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:54,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:24:54,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:54,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:54,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:54,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:54,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:54,135 INFO L87 Difference]: Start difference. First operand 2928 states and 3791 transitions. Second operand 3 states. [2018-12-31 10:24:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:54,522 INFO L93 Difference]: Finished difference Result 3246 states and 4167 transitions. [2018-12-31 10:24:54,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:54,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-31 10:24:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:54,525 INFO L225 Difference]: With dead ends: 3246 [2018-12-31 10:24:54,525 INFO L226 Difference]: Without dead ends: 3242 [2018-12-31 10:24:54,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:54,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2018-12-31 10:24:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3217. [2018-12-31 10:24:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2018-12-31 10:24:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4120 transitions. [2018-12-31 10:24:54,867 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4120 transitions. Word has length 99 [2018-12-31 10:24:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:54,867 INFO L480 AbstractCegarLoop]: Abstraction has 3217 states and 4120 transitions. [2018-12-31 10:24:54,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4120 transitions. [2018-12-31 10:24:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-31 10:24:54,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:54,869 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-31 10:24:54,870 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:54,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1770134526, now seen corresponding path program 1 times [2018-12-31 10:24:54,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:54,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:54,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 10:24:55,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:55,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:24:55,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:24:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:24:55,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:24:55,013 INFO L87 Difference]: Start difference. First operand 3217 states and 4120 transitions. Second operand 5 states. [2018-12-31 10:24:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:56,408 INFO L93 Difference]: Finished difference Result 11996 states and 15456 transitions. [2018-12-31 10:24:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 10:24:56,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-12-31 10:24:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:56,417 INFO L225 Difference]: With dead ends: 11996 [2018-12-31 10:24:56,418 INFO L226 Difference]: Without dead ends: 8971 [2018-12-31 10:24:56,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:24:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-12-31 10:24:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 3219. [2018-12-31 10:24:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3219 states. [2018-12-31 10:24:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4114 transitions. [2018-12-31 10:24:56,852 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4114 transitions. Word has length 156 [2018-12-31 10:24:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:56,852 INFO L480 AbstractCegarLoop]: Abstraction has 3219 states and 4114 transitions. [2018-12-31 10:24:56,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:24:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4114 transitions. [2018-12-31 10:24:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-31 10:24:56,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:56,855 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-31 10:24:56,855 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:56,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:56,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1963184793, now seen corresponding path program 1 times [2018-12-31 10:24:56,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:56,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:56,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:56,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:24:56,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:56,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:24:56,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:24:56,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:24:56,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:24:56,997 INFO L87 Difference]: Start difference. First operand 3219 states and 4114 transitions. Second operand 5 states. [2018-12-31 10:24:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:57,618 INFO L93 Difference]: Finished difference Result 6364 states and 8180 transitions. [2018-12-31 10:24:57,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:24:57,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2018-12-31 10:24:57,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:57,623 INFO L225 Difference]: With dead ends: 6364 [2018-12-31 10:24:57,623 INFO L226 Difference]: Without dead ends: 3353 [2018-12-31 10:24:57,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:24:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2018-12-31 10:24:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2976. [2018-12-31 10:24:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2018-12-31 10:24:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3807 transitions. [2018-12-31 10:24:57,983 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3807 transitions. Word has length 158 [2018-12-31 10:24:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:57,983 INFO L480 AbstractCegarLoop]: Abstraction has 2976 states and 3807 transitions. [2018-12-31 10:24:57,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:24:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3807 transitions. [2018-12-31 10:24:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-31 10:24:57,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:57,986 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:57,987 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:57,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:57,987 INFO L82 PathProgramCache]: Analyzing trace with hash -107962694, now seen corresponding path program 1 times [2018-12-31 10:24:57,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:57,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:57,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:57,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:57,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-31 10:24:58,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:58,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:58,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:58,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:58,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:58,052 INFO L87 Difference]: Start difference. First operand 2976 states and 3807 transitions. Second operand 3 states. [2018-12-31 10:24:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:59,006 INFO L93 Difference]: Finished difference Result 6619 states and 8514 transitions. [2018-12-31 10:24:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:59,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2018-12-31 10:24:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:59,013 INFO L225 Difference]: With dead ends: 6619 [2018-12-31 10:24:59,013 INFO L226 Difference]: Without dead ends: 3857 [2018-12-31 10:24:59,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2018-12-31 10:24:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 3788. [2018-12-31 10:24:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3788 states. [2018-12-31 10:24:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 4729 transitions. [2018-12-31 10:24:59,873 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 4729 transitions. Word has length 158 [2018-12-31 10:24:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:59,874 INFO L480 AbstractCegarLoop]: Abstraction has 3788 states and 4729 transitions. [2018-12-31 10:24:59,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 4729 transitions. [2018-12-31 10:24:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-31 10:24:59,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:59,879 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:59,879 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:59,880 INFO L82 PathProgramCache]: Analyzing trace with hash -241174316, now seen corresponding path program 1 times [2018-12-31 10:24:59,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:59,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:59,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:59,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:25:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-31 10:25:00,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:25:00,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:25:00,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:25:00,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:25:00,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:25:00,012 INFO L87 Difference]: Start difference. First operand 3788 states and 4729 transitions. Second operand 3 states. [2018-12-31 10:25:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:25:01,610 INFO L93 Difference]: Finished difference Result 4299 states and 5298 transitions. [2018-12-31 10:25:01,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:25:01,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-12-31 10:25:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:25:01,612 INFO L225 Difference]: With dead ends: 4299 [2018-12-31 10:25:01,612 INFO L226 Difference]: Without dead ends: 613 [2018-12-31 10:25:01,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:25:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-12-31 10:25:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2018-12-31 10:25:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-12-31 10:25:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 666 transitions. [2018-12-31 10:25:01,716 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 666 transitions. Word has length 159 [2018-12-31 10:25:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:25:01,716 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 666 transitions. [2018-12-31 10:25:01,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:25:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 666 transitions. [2018-12-31 10:25:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-31 10:25:01,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:25:01,719 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:25:01,719 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:25:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:25:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1495401652, now seen corresponding path program 1 times [2018-12-31 10:25:01,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:25:01,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:25:01,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:25:01,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:25:01,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:25:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:25:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-31 10:25:01,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:25:01,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 10:25:01,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:25:01,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:25:01,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:25:01,899 INFO L87 Difference]: Start difference. First operand 610 states and 666 transitions. Second operand 7 states. [2018-12-31 10:25:02,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:25:02,326 INFO L93 Difference]: Finished difference Result 1131 states and 1238 transitions. [2018-12-31 10:25:02,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:25:02,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2018-12-31 10:25:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:25:02,335 INFO L225 Difference]: With dead ends: 1131 [2018-12-31 10:25:02,335 INFO L226 Difference]: Without dead ends: 1129 [2018-12-31 10:25:02,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:25:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-12-31 10:25:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 608. [2018-12-31 10:25:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-12-31 10:25:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 663 transitions. [2018-12-31 10:25:02,420 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 663 transitions. Word has length 160 [2018-12-31 10:25:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:25:02,420 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 663 transitions. [2018-12-31 10:25:02,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:25:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 663 transitions. [2018-12-31 10:25:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-31 10:25:02,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:25:02,422 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:25:02,423 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:25:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:25:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 887650061, now seen corresponding path program 1 times [2018-12-31 10:25:02,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:25:02,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:25:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:25:02,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:25:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:25:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:25:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-31 10:25:02,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:25:02,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:25:02,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:25:02,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:25:02,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:25:02,725 INFO L87 Difference]: Start difference. First operand 608 states and 663 transitions. Second operand 5 states. [2018-12-31 10:25:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:25:03,622 INFO L93 Difference]: Finished difference Result 838 states and 911 transitions. [2018-12-31 10:25:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 10:25:03,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2018-12-31 10:25:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:25:03,625 INFO L225 Difference]: With dead ends: 838 [2018-12-31 10:25:03,625 INFO L226 Difference]: Without dead ends: 734 [2018-12-31 10:25:03,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 10:25:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-31 10:25:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 600. [2018-12-31 10:25:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-31 10:25:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 650 transitions. [2018-12-31 10:25:03,774 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 650 transitions. Word has length 161 [2018-12-31 10:25:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:25:03,775 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 650 transitions. [2018-12-31 10:25:03,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:25:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 650 transitions. [2018-12-31 10:25:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-31 10:25:03,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:25:03,779 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:25:03,779 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:25:03,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:25:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1388250693, now seen corresponding path program 1 times [2018-12-31 10:25:03,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:25:03,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:25:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:25:03,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:25:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:25:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:25:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:25:04,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:25:04,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:25:04,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:25:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:25:04,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:25:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:25:05,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:25:05,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2018-12-31 10:25:05,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-31 10:25:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-31 10:25:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2018-12-31 10:25:05,961 INFO L87 Difference]: Start difference. First operand 600 states and 650 transitions. Second operand 29 states. [2018-12-31 10:25:06,950 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 10:25:07,474 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 10:25:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:25:09,685 INFO L93 Difference]: Finished difference Result 959 states and 1046 transitions. [2018-12-31 10:25:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-31 10:25:09,686 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 220 [2018-12-31 10:25:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:25:09,687 INFO L225 Difference]: With dead ends: 959 [2018-12-31 10:25:09,687 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 10:25:09,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=459, Invalid=2511, Unknown=0, NotChecked=0, Total=2970 [2018-12-31 10:25:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 10:25:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 10:25:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 10:25:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 10:25:09,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2018-12-31 10:25:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:25:09,690 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 10:25:09,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-31 10:25:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 10:25:09,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 10:25:09,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 10:25:09,980 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 183 [2018-12-31 10:25:10,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,487 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 186 [2018-12-31 10:25:10,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,691 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 82 [2018-12-31 10:25:10,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,927 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 118 [2018-12-31 10:25:10,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:10,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:11,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,110 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 385 DAG size of output: 317 [2018-12-31 10:25:12,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,471 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 96 [2018-12-31 10:25:12,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:12,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,557 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 573 DAG size of output: 323 [2018-12-31 10:25:13,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,775 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 173 [2018-12-31 10:25:13,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:13,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,942 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 575 DAG size of output: 309 [2018-12-31 10:25:14,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:14,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,110 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 183 [2018-12-31 10:25:15,285 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 183 [2018-12-31 10:25:15,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,400 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 102 [2018-12-31 10:25:15,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:15,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:16,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,217 WARN L181 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 811 DAG size of output: 410 [2018-12-31 10:25:17,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:17,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,151 WARN L181 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 575 DAG size of output: 309 [2018-12-31 10:25:18,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:18,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:19,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,397 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 1056 DAG size of output: 570 [2018-12-31 10:25:20,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,593 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 138 [2018-12-31 10:25:20,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,861 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 201 [2018-12-31 10:25:20,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:20,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,303 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 222 [2018-12-31 10:25:21,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,460 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 113 [2018-12-31 10:25:21,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,593 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 173 [2018-12-31 10:25:21,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,868 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 222 [2018-12-31 10:25:21,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:21,993 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 140 [2018-12-31 10:25:22,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,330 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 305 DAG size of output: 235 [2018-12-31 10:25:22,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:22,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,217 WARN L181 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 573 DAG size of output: 309 [2018-12-31 10:25:23,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,360 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 161 [2018-12-31 10:25:23,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,715 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 222 [2018-12-31 10:25:23,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,944 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 222 [2018-12-31 10:25:23,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:23,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:24,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:25,911 WARN L181 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 971 DAG size of output: 544 [2018-12-31 10:25:26,029 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 183 [2018-12-31 10:25:26,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,337 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 210 [2018-12-31 10:25:26,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,620 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 222 [2018-12-31 10:25:26,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:26,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,511 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 573 DAG size of output: 309 [2018-12-31 10:25:27,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:27,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,174 WARN L181 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 573 DAG size of output: 309 [2018-12-31 10:25:28,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:28,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:25:29,315 WARN L181 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 77 [2018-12-31 10:25:29,791 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 60 [2018-12-31 10:25:30,133 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2018-12-31 10:25:30,528 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2018-12-31 10:25:30,719 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 46 [2018-12-31 10:25:33,583 WARN L181 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 306 DAG size of output: 90 [2018-12-31 10:25:33,687 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-31 10:25:34,041 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2018-12-31 10:25:34,144 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-31 10:25:34,469 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2018-12-31 10:25:34,578 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2018-12-31 10:25:34,761 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-12-31 10:25:36,622 WARN L181 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 310 DAG size of output: 108 [2018-12-31 10:25:36,743 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-12-31 10:25:37,326 WARN L181 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 48 [2018-12-31 10:25:37,481 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-12-31 10:25:39,278 WARN L181 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 297 DAG size of output: 108 [2018-12-31 10:25:39,397 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-12-31 10:25:40,260 WARN L181 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 77 [2018-12-31 10:25:40,412 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-12-31 10:25:41,373 WARN L181 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 77 [2018-12-31 10:25:41,541 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2018-12-31 10:25:41,786 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 25 [2018-12-31 10:25:41,890 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-31 10:25:42,213 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2018-12-31 10:25:42,699 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 61 [2018-12-31 10:25:43,101 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 68 [2018-12-31 10:25:43,206 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-31 10:25:45,613 WARN L181 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 393 DAG size of output: 111 [2018-12-31 10:25:47,490 WARN L181 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 297 DAG size of output: 108 [2018-12-31 10:25:47,610 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-12-31 10:25:48,095 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 61 [2018-12-31 10:25:48,253 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-12-31 10:25:48,505 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2018-12-31 10:25:48,683 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-12-31 10:25:48,806 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-12-31 10:25:49,306 WARN L181 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 61 [2018-12-31 10:25:49,567 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2018-12-31 10:25:53,603 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 550 DAG size of output: 108 [2018-12-31 10:25:53,911 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 55 [2018-12-31 10:25:54,032 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-31 10:25:54,367 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 57 [2018-12-31 10:25:54,534 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2018-12-31 10:25:54,638 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-31 10:25:54,742 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-31 10:25:55,003 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2018-12-31 10:25:55,887 WARN L181 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 76 [2018-12-31 10:25:56,057 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-12-31 10:25:56,178 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-12-31 10:25:57,412 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 222 DAG size of output: 79 [2018-12-31 10:25:57,786 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2018-12-31 10:25:58,253 WARN L181 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 49 [2018-12-31 10:25:59,377 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 222 DAG size of output: 79 [2018-12-31 10:25:59,769 WARN L181 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2018-12-31 10:26:00,263 WARN L181 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62 [2018-12-31 10:26:01,571 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 228 DAG size of output: 81 [2018-12-31 10:26:01,823 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 46 [2018-12-31 10:26:02,474 WARN L181 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 61 [2018-12-31 10:26:02,818 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2018-12-31 10:26:02,987 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2018-12-31 10:26:04,709 WARN L181 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 297 DAG size of output: 108 [2018-12-31 10:26:05,375 WARN L181 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 68 [2018-12-31 10:26:05,549 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2018-12-31 10:26:05,814 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2018-12-31 10:26:07,037 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 222 DAG size of output: 79 [2018-12-31 10:26:08,173 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 222 DAG size of output: 79 [2018-12-31 10:26:08,636 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2018-12-31 10:26:09,488 WARN L181 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 77 [2018-12-31 10:26:13,216 WARN L181 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 526 DAG size of output: 113 [2018-12-31 10:26:14,081 WARN L181 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 77 [2018-12-31 10:26:14,743 WARN L181 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 62 [2018-12-31 10:26:15,660 WARN L181 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 70 [2018-12-31 10:26:15,952 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 53 [2018-12-31 10:26:17,199 WARN L181 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 222 DAG size of output: 79 [2018-12-31 10:26:17,463 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 49 [2018-12-31 10:26:17,774 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 53 [2018-12-31 10:26:18,108 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 53 [2018-12-31 10:26:19,849 WARN L181 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 297 DAG size of output: 108 [2018-12-31 10:26:20,242 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 48 [2018-12-31 10:26:20,412 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2018-12-31 10:26:20,566 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-12-31 10:26:22,425 WARN L181 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 297 DAG size of output: 108 [2018-12-31 10:26:22,580 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-12-31 10:26:23,440 WARN L181 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 77 [2018-12-31 10:26:23,553 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-12-31 10:26:24,140 WARN L181 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 57 [2018-12-31 10:26:24,147 INFO L444 ceAbstractionStarter]: At program point L894(lines 868 895) the Hoare annotation is: (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse6 (<= ~c_req_a~0 0)) (.cse7 (<= 0 ~c_req_a~0)) (.cse8 (<= 1 ~c_req_type~0)) (.cse9 (= ~m_run_pc~0 3)) (.cse3 (<= ~c_req_type~0 1)) (.cse13 (<= 0 ~a_t~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse11 (= ~s_run_pc~0 2)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 (let ((.cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 (not .cse11) .cse12))) (or (and .cse5 (<= 2 ~s_run_pc~0)) (and (= ~s_run_pc~0 0) .cse5)))) .cse13 .cse14)) (and .cse0 .cse1 (and .cse13 (and .cse2 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) .cse3 .cse4 .cse11) .cse14)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (and (and (= 0 ~c_req_a~0) .cse13 .cse2 .cse4 .cse11 (and .cse10 .cse12) .cse14 (= ~m_run_pc~0 6)) (= 0 ~c_req_type~0)) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2018-12-31 10:26:24,147 INFO L448 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2018-12-31 10:26:24,147 INFO L444 ceAbstractionStarter]: At program point L102(lines 91 833) the Hoare annotation is: (let ((.cse12 (= ~s_run_pc~0 2))) (let ((.cse3 (<= ~c_req_a~0 0)) (.cse4 (<= 0 ~c_req_a~0)) (.cse5 (<= 1 ~c_req_type~0)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse16 (not .cse12)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse13 (= ~c_empty_req~0 1)) (.cse15 (<= 2 ~s_run_pc~0)) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~a_t~0)) (.cse10 (<= ~c_req_type~0 1)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~s_run_pc~0 0)) (.cse14 (<= 2 ~s_run_st~0)) (.cse18 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8))) (or (and .cse0 .cse1 .cse2 (and (and .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10 .cse11 .cse12)) (and .cse0 .cse1 (and .cse13 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse2 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse13 .cse15 .cse6 .cse7 .cse8) (and (and .cse6 .cse7 .cse16 .cse8) .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse18) (and .cse9 .cse14 (and .cse6 .cse7 .cse8) .cse12) (and .cse17 .cse14 .cse18))))) [2018-12-31 10:26:24,148 INFO L444 ceAbstractionStarter]: At program point L168-2(lines 168 196) the Hoare annotation is: (let ((.cse9 (<= 2 ~s_run_pc~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse0 (= ~s_run_pc~0 0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse3 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (<= 0 ~a_t~0)) (.cse12 (= 0 ~c_req_type~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse13 (= 0 ~c_req_a~0)) (.cse1 (= ~c_empty_req~0 1)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse17 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 (<= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ULTIMATE.start_m_run_~a~0) .cse8) (and (and (not (= ~s_run_pc~0 2)) .cse7 .cse6) .cse4 .cse9) (and .cse10 .cse11 .cse2 .cse3 .cse12 .cse9 .cse7 .cse13 .cse1 .cse14 .cse4 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse8) (and .cse10 .cse0 .cse2 .cse3 .cse11 .cse12 .cse7 .cse13 .cse1 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse8))) [2018-12-31 10:26:24,148 INFO L448 ceAbstractionStarter]: For program point L763(lines 763 767) no Hoare annotation was computed. [2018-12-31 10:26:24,148 INFO L448 ceAbstractionStarter]: For program point L697(lines 697 701) no Hoare annotation was computed. [2018-12-31 10:26:24,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,149 INFO L444 ceAbstractionStarter]: At program point L1292(lines 1285 1302) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 2))) (let ((.cse9 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse16 (= ~m_run_pc~0 3)) (.cse34 (not .cse4)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse12 (<= ~m_run_pc~0 0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= ~c_m_lock~0 0)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse22 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse30 (= ~req_tt_a~0 0)) (.cse24 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (= 0 ~c_req_a~0)) (.cse3 (and .cse14 .cse15)) (.cse7 (= ~m_run_pc~0 6)) (.cse18 (= 0 ~c_req_type~0)) (.cse25 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 2 ~s_run_st~0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse26 (<= ~c_req_d~0 50)) (.cse0 (<= 0 ~a_t~0)) (.cse8 (= ~s_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= ~c_req_type~0 1)) (.cse20 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse34 .cse15))) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse27 (<= 50 ~c_req_d~0))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and (and .cse11 .cse16 .cse14 .cse15) .cse17) (and (and .cse11 .cse0 .cse1 .cse2 .cse17 .cse14 .cse15 .cse6) .cse7) (and .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse2 .cse4 .cse13 .cse14) (and .cse8 .cse2 .cse20) (and .cse21 .cse22 .cse0 .cse23 .cse24 .cse16 .cse25 .cse26 .cse27 .cse11 .cse1 .cse28 .cse2 .cse5 .cse4 .cse14 .cse6 .cse29) (and .cse21 .cse22 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (and (= ULTIMATE.start_s_run_~req_type~1 0) (and .cse19 (and .cse1 .cse2 (and .cse11 .cse14) .cse5 .cse4) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6 .cse7) .cse18) .cse30 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse31 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse13 .cse14) (and .cse1 .cse2 (and .cse16 .cse14 .cse15) .cse4) (and .cse26 .cse27 (and (and .cse1 .cse32 .cse5 .cse4 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse15))) .cse0 .cse6)) (and .cse21 .cse22 .cse23 .cse28 .cse30 .cse24 (and (and .cse19 (and .cse1 .cse3 .cse5 .cse4) .cse0 .cse6 .cse7) .cse18) .cse25 .cse31 .cse29) (and .cse2 .cse17 (and .cse14 .cse34 .cse15)) (and .cse26 (and .cse0 (and .cse8 .cse1 .cse32 .cse20 .cse5) .cse6) .cse27))))) [2018-12-31 10:26:24,149 INFO L444 ceAbstractionStarter]: At program point L235(lines 228 254) the Hoare annotation is: (let ((.cse23 (= ~s_run_pc~0 2))) (let ((.cse17 (<= 1 ~c_req_type~0)) (.cse18 (<= ~m_run_pc~0 0)) (.cse19 (= ~m_run_pc~0 3)) (.cse0 (not .cse23)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse24 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (<= 0 ~c_req_a~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse21 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (let ((.cse4 (= ~s_run_pc~0 0)) (.cse5 (and (and .cse17 (or (and .cse18 .cse2 .cse0 .cse1) (and .cse19 .cse0 .cse1 .cse2)) .cse24) .cse14 .cse15 .cse16 .cse20 .cse21 .cse22)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (<= 0 ~a_t~0)) (.cse13 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse10 (<= ~c_req_type~0 1)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse3 .cse5) (and .cse6 .cse4 .cse7 .cse8 .cse9 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse8 .cse9 .cse13 (and (and .cse14 .cse15 .cse16 (and .cse17 (or (and .cse18 .cse2 .cse1) (and .cse19 .cse1 .cse2))) .cse20 .cse21 .cse22) .cse3 .cse10 .cse11 .cse12 .cse23 .cse24)))))) [2018-12-31 10:26:24,149 INFO L448 ceAbstractionStarter]: For program point L169(lines 168 196) no Hoare annotation was computed. [2018-12-31 10:26:24,150 INFO L444 ceAbstractionStarter]: At program point L962(lines 955 972) the Hoare annotation is: (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3)) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse5 (<= ~c_req_type~0 1)) (.cse17 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse19 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 0 ~a_t~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse14 (= ~s_run_pc~0 2)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 (let ((.cse6 (and .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15)))) (or (and (= ~s_run_pc~0 0) .cse6) (and (<= 2 ~s_run_pc~0) .cse6))) .cse16 .cse17) .cse18) .cse19 .cse20) (and .cse0 .cse1 (and .cse2 (and (and .cse7 .cse8 (and .cse10 .cse11 .cse4 .cse12 .cse13 .cse15) .cse9) .cse3 .cse5 .cse16 .cse14 .cse17) .cse18) .cse19 .cse20) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) .cse2 (and (and .cse11 .cse13 .cse15) .cse3 .cse16 .cse14) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse18 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2018-12-31 10:26:24,150 INFO L448 ceAbstractionStarter]: For program point L1293(lines 1245 1334) no Hoare annotation was computed. [2018-12-31 10:26:24,150 INFO L448 ceAbstractionStarter]: For program point L1227(lines 1227 1231) no Hoare annotation was computed. [2018-12-31 10:26:24,150 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 174) no Hoare annotation was computed. [2018-12-31 10:26:24,150 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 116) no Hoare annotation was computed. [2018-12-31 10:26:24,150 INFO L448 ceAbstractionStarter]: For program point L963(lines 955 972) no Hoare annotation was computed. [2018-12-31 10:26:24,150 INFO L444 ceAbstractionStarter]: At program point L435(lines 428 445) the Hoare annotation is: (let ((.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~s_run_st~0)) (.cse0 (<= 2 ~s_run_pc~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~m_run_pc~0 3) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse3 .cse4 (not (= ~s_run_pc~0 2)) .cse1) .cse2 .cse0))) [2018-12-31 10:26:24,150 INFO L448 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2018-12-31 10:26:24,151 INFO L448 ceAbstractionStarter]: For program point L1294(lines 1294 1298) no Hoare annotation was computed. [2018-12-31 10:26:24,151 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 241) no Hoare annotation was computed. [2018-12-31 10:26:24,151 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1166) no Hoare annotation was computed. [2018-12-31 10:26:24,151 INFO L444 ceAbstractionStarter]: At program point L105(lines 91 833) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) [2018-12-31 10:26:24,151 INFO L448 ceAbstractionStarter]: For program point L1162-2(lines 1160 1339) no Hoare annotation was computed. [2018-12-31 10:26:24,151 INFO L444 ceAbstractionStarter]: At program point L1030(lines 1023 1076) the Hoare annotation is: (let ((.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse0 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse10 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse11 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) (and .cse2 .cse3 .cse4 .cse5) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and (and (<= 1 ~c_req_type~0) (let ((.cse13 (and .cse3 .cse14 (not .cse5)))) (or (and (= ~s_run_pc~0 0) .cse13) (and .cse13 (<= 2 ~s_run_pc~0)))) .cse2 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse4 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse6 .cse7) .cse15 .cse16) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and .cse6 (and .cse2 (and .cse3 .cse14) .cse4 .cse5) .cse7) .cse15 .cse16))) [2018-12-31 10:26:24,151 INFO L448 ceAbstractionStarter]: For program point L964(lines 964 968) no Hoare annotation was computed. [2018-12-31 10:26:24,151 INFO L448 ceAbstractionStarter]: For program point L436(lines 124 470) no Hoare annotation was computed. [2018-12-31 10:26:24,152 INFO L444 ceAbstractionStarter]: At program point L569(lines 562 606) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= ~s_run_pc~0 2)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= 0 ~c_req_type~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ULTIMATE.start_m_run_~req_type___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 0) (and .cse0 (<= 1 ~c_m_lock~0) .cse1 (and (= ~m_run_pc~0 3) .cse2 .cse3)) (= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2018-12-31 10:26:24,152 INFO L448 ceAbstractionStarter]: For program point L437(lines 437 441) no Hoare annotation was computed. [2018-12-31 10:26:24,152 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 115) no Hoare annotation was computed. [2018-12-31 10:26:24,152 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 1036) no Hoare annotation was computed. [2018-12-31 10:26:24,152 INFO L444 ceAbstractionStarter]: At program point L108(lines 91 833) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) [2018-12-31 10:26:24,152 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 954) no Hoare annotation was computed. [2018-12-31 10:26:24,152 INFO L444 ceAbstractionStarter]: At program point L769(lines 762 797) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,152 INFO L444 ceAbstractionStarter]: At program point L703(lines 696 713) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,153 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 575) no Hoare annotation was computed. [2018-12-31 10:26:24,153 INFO L451 ceAbstractionStarter]: At program point L1364(lines 1341 1366) the Hoare annotation is: true [2018-12-31 10:26:24,153 INFO L444 ceAbstractionStarter]: At program point L307(lines 277 308) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2018-12-31 10:26:24,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,153 INFO L448 ceAbstractionStarter]: For program point L902(lines 902 906) no Hoare annotation was computed. [2018-12-31 10:26:24,153 INFO L448 ceAbstractionStarter]: For program point L704(lines 475 827) no Hoare annotation was computed. [2018-12-31 10:26:24,153 INFO L444 ceAbstractionStarter]: At program point L1233(lines 1226 1243) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and .cse0 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse1 (<= 2 ~s_run_st~0) .cse4 .cse5 .cse2))) [2018-12-31 10:26:24,153 INFO L448 ceAbstractionStarter]: For program point L1167-1(lines 1160 1339) no Hoare annotation was computed. [2018-12-31 10:26:24,153 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 114) no Hoare annotation was computed. [2018-12-31 10:26:24,154 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 775) no Hoare annotation was computed. [2018-12-31 10:26:24,154 INFO L448 ceAbstractionStarter]: For program point L705(lines 705 709) no Hoare annotation was computed. [2018-12-31 10:26:24,154 INFO L444 ceAbstractionStarter]: At program point L375(lines 368 385) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2018-12-31 10:26:24,154 INFO L444 ceAbstractionStarter]: At program point L243(lines 236 253) the Hoare annotation is: (let ((.cse23 (= ~s_run_pc~0 2))) (let ((.cse17 (<= 1 ~c_req_type~0)) (.cse18 (<= ~m_run_pc~0 0)) (.cse19 (= ~m_run_pc~0 3)) (.cse0 (not .cse23)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse24 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (<= 0 ~c_req_a~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse21 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (let ((.cse4 (= ~s_run_pc~0 0)) (.cse5 (and (and .cse17 (or (and .cse18 .cse2 .cse0 .cse1) (and .cse19 .cse0 .cse1 .cse2)) .cse24) .cse14 .cse15 .cse16 .cse20 .cse21 .cse22)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (<= 0 ~a_t~0)) (.cse13 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse10 (<= ~c_req_type~0 1)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse3 .cse5) (and .cse6 .cse4 .cse7 .cse8 .cse9 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse8 .cse9 .cse13 (and (and .cse14 .cse15 .cse16 (and .cse17 (or (and .cse18 .cse2 .cse1) (and .cse19 .cse1 .cse2))) .cse20 .cse21 .cse22) .cse3 .cse10 .cse11 .cse12 .cse23 .cse24)))))) [2018-12-31 10:26:24,154 INFO L444 ceAbstractionStarter]: At program point L111(lines 91 833) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (let ((.cse2 (= ~c_empty_req~0 1)) (.cse5 (<= 2 ~s_run_st~0)) (.cse10 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse0 (<= 0 ~a_t~0)) (.cse9 (and .cse3 .cse4)) (.cse12 (= 0 ~c_req_type~0)) (.cse7 (= ~m_run_pc~0 6)) (.cse13 (= 0 ~c_req_a~0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse14 (= ~req_tt_a~0 0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5 .cse6 .cse7) (and .cse0 (and .cse8 (and .cse1 .cse9 .cse5 .cse6)) .cse7) (and .cse10 .cse11 .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse2 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse14 (= 50 ~c_rsp_d~0) .cse8 .cse6 .cse3) (and .cse5 (<= 2 ~s_run_pc~0) (and .cse3 (not .cse6) (<= 3 ~m_run_pc~0) .cse4)) (and .cse10 .cse11 .cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse9 .cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse13 .cse1 (= ULTIMATE.start_s_run_~req_a~1 0) .cse14 .cse8 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2018-12-31 10:26:24,154 INFO L448 ceAbstractionStarter]: For program point L376(lines 368 385) no Hoare annotation was computed. [2018-12-31 10:26:24,154 INFO L448 ceAbstractionStarter]: For program point L244(lines 124 470) no Hoare annotation was computed. [2018-12-31 10:26:24,155 INFO L448 ceAbstractionStarter]: For program point L1235(lines 1235 1239) no Hoare annotation was computed. [2018-12-31 10:26:24,155 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2018-12-31 10:26:24,155 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 249) no Hoare annotation was computed. [2018-12-31 10:26:24,156 INFO L444 ceAbstractionStarter]: At program point L1038(lines 1031 1075) the Hoare annotation is: (let ((.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse0 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse10 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse11 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) (and .cse2 .cse3 .cse4 .cse5) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and (and (<= 1 ~c_req_type~0) (let ((.cse13 (and .cse3 .cse14 (not .cse5)))) (or (and (= ~s_run_pc~0 0) .cse13) (and .cse13 (<= 2 ~s_run_pc~0)))) .cse2 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse4 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse6 .cse7) .cse15 .cse16) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and .cse6 (and .cse2 (and .cse3 .cse14) .cse4 .cse5) .cse7) .cse15 .cse16))) [2018-12-31 10:26:24,156 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,156 INFO L444 ceAbstractionStarter]: At program point L577(lines 570 605) the Hoare annotation is: (let ((.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= 0 ~c_req_type~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ULTIMATE.start_m_run_~req_type___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 0) (and (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) .cse0 (<= 1 ~c_m_lock~0) .cse1) (= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2018-12-31 10:26:24,156 INFO L448 ceAbstractionStarter]: For program point L1040(lines 1040 1044) no Hoare annotation was computed. [2018-12-31 10:26:24,156 INFO L444 ceAbstractionStarter]: At program point L908(lines 901 954) the Hoare annotation is: (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3)) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse5 (<= ~c_req_type~0 1)) (.cse17 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse19 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 0 ~a_t~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse14 (= ~s_run_pc~0 2)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 (let ((.cse6 (and .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15)))) (or (and (= ~s_run_pc~0 0) .cse6) (and (<= 2 ~s_run_pc~0) .cse6))) .cse16 .cse17) .cse18) .cse19 .cse20) (and .cse0 .cse1 (and .cse2 (and (and .cse7 .cse8 (and .cse10 .cse11 .cse4 .cse12 .cse13 .cse15) .cse9) .cse3 .cse5 .cse16 .cse14 .cse17) .cse18) .cse19 .cse20) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) .cse2 (and (and .cse11 .cse13 .cse15) .cse3 .cse16 .cse14) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse18 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2018-12-31 10:26:24,157 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 367) no Hoare annotation was computed. [2018-12-31 10:26:24,157 INFO L448 ceAbstractionStarter]: For program point L1173(lines 1173 1177) no Hoare annotation was computed. [2018-12-31 10:26:24,157 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 989) no Hoare annotation was computed. [2018-12-31 10:26:24,157 INFO L444 ceAbstractionStarter]: At program point L777(lines 770 796) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,157 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 583) no Hoare annotation was computed. [2018-12-31 10:26:24,157 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. [2018-12-31 10:26:24,157 INFO L448 ceAbstractionStarter]: For program point L910(lines 910 914) no Hoare annotation was computed. [2018-12-31 10:26:24,157 INFO L444 ceAbstractionStarter]: At program point L514(lines 484 515) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 2))) (let ((.cse4 (<= 2 ~s_run_pc~0)) (.cse0 (not .cse5)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (<= 2 ~s_run_st~0))) (or (and (and .cse0 .cse1 .cse2 (<= 3 ~m_run_pc~0)) .cse3 .cse4) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse0 .cse1 .cse2 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ULTIMATE.start_m_run_~req_type___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0) (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) .cse1 .cse2) (<= 2 ~c_write_req_ev~0) .cse3 .cse5) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2018-12-31 10:26:24,158 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 783) no Hoare annotation was computed. [2018-12-31 10:26:24,158 INFO L448 ceAbstractionStarter]: For program point L1308(lines 1308 1312) no Hoare annotation was computed. [2018-12-31 10:26:24,158 INFO L448 ceAbstractionStarter]: For program point L1110(lines 1109 1150) no Hoare annotation was computed. [2018-12-31 10:26:24,158 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 455) no Hoare annotation was computed. [2018-12-31 10:26:24,158 INFO L444 ceAbstractionStarter]: At program point L121(lines 91 833) the Hoare annotation is: (let ((.cse5 (<= 0 ~a_t~0)) (.cse7 (= 0 ~c_req_type~0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse8 (= 0 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse4 (= ~s_run_pc~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse6 (<= ~m_run_pc~0 0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ~s_run_pc~0 2)) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse2) (and .cse6 .cse5 .cse7 .cse1 .cse3 .cse8 .cse9 .cse10 .cse0 .cse11 .cse2) (and .cse4 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse9 .cse6 .cse0 .cse11 .cse2 .cse3))) [2018-12-31 10:26:24,158 INFO L444 ceAbstractionStarter]: At program point L1046(lines 1039 1074) the Hoare annotation is: (let ((.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse0 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse10 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse11 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) (and .cse2 .cse3 .cse4 .cse5) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and (and (<= 1 ~c_req_type~0) (let ((.cse13 (and .cse3 .cse14 (not .cse5)))) (or (and (= ~s_run_pc~0 0) .cse13) (and .cse13 (<= 2 ~s_run_pc~0)))) .cse2 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse4 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse6 .cse7) .cse15 .cse16) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and .cse6 (and .cse2 (and .cse3 .cse14) .cse4 .cse5) .cse7) .cse15 .cse16))) [2018-12-31 10:26:24,158 INFO L444 ceAbstractionStarter]: At program point L518-2(lines 518 546) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 2))) (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse2 (not .cse5)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (<= 2 ~s_run_pc~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= 2 ~c_write_req_ev~0) .cse0 (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) .cse3 .cse4) (<= 1 ~c_m_lock~0) .cse5) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ULTIMATE.start_m_run_~req_type___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse0 (and .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) .cse1)))) [2018-12-31 10:26:24,159 INFO L444 ceAbstractionStarter]: At program point L1179(lines 1172 1225) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and .cse0 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse1 (<= 2 ~s_run_st~0) .cse4 .cse5 .cse2))) [2018-12-31 10:26:24,159 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 59) no Hoare annotation was computed. [2018-12-31 10:26:24,159 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 988) no Hoare annotation was computed. [2018-12-31 10:26:24,159 INFO L444 ceAbstractionStarter]: At program point L585(lines 578 604) the Hoare annotation is: (let ((.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= 0 ~c_req_type~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ULTIMATE.start_m_run_~req_type___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 0) (and (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) .cse0 (<= 1 ~c_m_lock~0) .cse1) (= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2018-12-31 10:26:24,159 INFO L448 ceAbstractionStarter]: For program point L519(lines 518 546) no Hoare annotation was computed. [2018-12-31 10:26:24,159 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2018-12-31 10:26:24,159 INFO L444 ceAbstractionStarter]: At program point L387-1(lines 387 393) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and (and .cse0 (not .cse1) .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) .cse0 .cse2) (<= 2 ~c_write_req_ev~0) .cse3 .cse1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2018-12-31 10:26:24,160 INFO L444 ceAbstractionStarter]: At program point L321(lines 314 367) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2018-12-31 10:26:24,160 INFO L448 ceAbstractionStarter]: For program point L1246(line 1246) no Hoare annotation was computed. [2018-12-31 10:26:24,160 INFO L448 ceAbstractionStarter]: For program point L1114(lines 1114 1118) no Hoare annotation was computed. [2018-12-31 10:26:24,160 INFO L448 ceAbstractionStarter]: For program point L1114-1(lines 1109 1150) no Hoare annotation was computed. [2018-12-31 10:26:24,160 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2018-12-31 10:26:24,160 INFO L444 ceAbstractionStarter]: At program point L916(lines 909 953) the Hoare annotation is: (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3)) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse5 (<= ~c_req_type~0 1)) (.cse17 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse19 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 0 ~a_t~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse14 (= ~s_run_pc~0 2)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 (let ((.cse6 (and .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15)))) (or (and (= ~s_run_pc~0 0) .cse6) (and (<= 2 ~s_run_pc~0) .cse6))) .cse16 .cse17) .cse18) .cse19 .cse20) (and .cse0 .cse1 (and .cse2 (and (and .cse7 .cse8 (and .cse10 .cse11 .cse4 .cse12 .cse13 .cse15) .cse9) .cse3 .cse5 .cse16 .cse14 .cse17) .cse18) .cse19 .cse20) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) .cse2 (and (and .cse11 .cse13 .cse15) .cse3 .cse16 .cse14) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse18 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2018-12-31 10:26:24,160 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2018-12-31 10:26:24,160 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 10:26:24,160 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1185) no Hoare annotation was computed. [2018-12-31 10:26:24,169 INFO L444 ceAbstractionStarter]: At program point L124-2(lines 124 470) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (not (= ~s_run_pc~0 2))) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse5 (= 0 ~c_req_a~0)) (.cse10 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse15 (<= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 2 ~s_run_st~0)) (.cse8 (<= ~c_m_lock~0 0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ~c_req_a~0 0) .cse11 (<= 0 ~c_req_a~0) .cse6 .cse2 .cse12 .cse8 .cse9 .cse4 .cse13) (and (and .cse8 .cse9 .cse14 .cse4) .cse12 .cse15) (and .cse11 .cse12 .cse15 .cse9 .cse14 .cse4 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9 .cse10) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse1 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse15 (= ~m_run_pc~0 3) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse6 .cse7 (= ULTIMATE.start_s_run_~req_a~1 0) .cse12 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2018-12-31 10:26:24,169 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 863) no Hoare annotation was computed. [2018-12-31 10:26:24,169 INFO L444 ceAbstractionStarter]: At program point L785(lines 778 795) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,169 INFO L448 ceAbstractionStarter]: For program point L719(lines 719 723) no Hoare annotation was computed. [2018-12-31 10:26:24,170 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 591) no Hoare annotation was computed. [2018-12-31 10:26:24,170 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2018-12-31 10:26:24,170 INFO L444 ceAbstractionStarter]: At program point L1314(lines 1307 1324) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 2))) (let ((.cse16 (<= ~c_req_a~0 0)) (.cse17 (<= 0 ~c_req_a~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse21 (= ~m_run_pc~0 3)) (.cse34 (not .cse7)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1))) (let ((.cse18 (<= ~m_run_pc~0 0)) (.cse3 (= ~c_empty_req~0 1)) (.cse19 (<= ~c_m_lock~0 0)) (.cse11 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse12 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse30 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse13 (= ~req_tt_a~0 0)) (.cse26 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= 0 ~c_req_a~0)) (.cse23 (and .cse4 .cse20)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= 0 ~c_req_type~0)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 2 ~s_run_st~0)) (.cse22 (<= 2 ~s_run_pc~0)) (.cse28 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ~a_t~0)) (.cse15 (= ~s_run_pc~0 0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= ~c_req_type~0 1)) (.cse24 (and .cse16 .cse17 (and .cse33 .cse21 .cse4 .cse34 .cse20))) (.cse6 (<= 1 ~c_m_lock~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= 50 ~c_req_d~0))) (or (and (and (= ULTIMATE.start_s_run_~req_type~1 0) (and .cse0 .cse1 (and (and .cse2 (and .cse3 .cse4)) .cse5 .cse6 .cse7) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse8 .cse9) .cse10) .cse11 .cse12 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse13 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse14 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse15 .cse16 .cse17 .cse3 .cse18 .cse2 .cse19 .cse4 .cse20) (and (and .cse3 .cse21 .cse4 .cse20) .cse22) (and .cse1 (and (and .cse5 .cse2 .cse23 .cse7) .cse6) .cse8 .cse9) (and .cse1 .cse18 .cse10 .cse20 .cse0 .cse3 .cse5 .cse2 .cse7 .cse19 .cse4) (and .cse15 .cse2 .cse24) (and (and .cse1 (and .cse5 (and .cse3 .cse2 .cse4 .cse20) .cse7) .cse8) .cse9) (and .cse11 .cse12 .cse1 .cse25 .cse26 .cse21 .cse27 .cse28 .cse29 .cse3 .cse5 .cse30 .cse2 .cse6 .cse7 .cse4 .cse8 .cse31) (and .cse15 .cse1 .cse18 .cse10 .cse20 .cse0 .cse3 .cse5 .cse19 .cse4) (and .cse5 .cse2 (and .cse21 .cse4 .cse20) .cse7) (and .cse28 .cse29 (and (and .cse5 .cse32 .cse6 .cse7 (and .cse16 .cse17 (and .cse33 .cse21 .cse4 .cse20))) .cse1 .cse8)) (and .cse11 .cse12 .cse25 .cse30 .cse13 .cse26 (and (and .cse0 (and .cse5 .cse23 .cse6 .cse7) .cse1 .cse8 .cse9) .cse10) .cse27 .cse14 .cse31) (and .cse2 .cse22 (and .cse4 .cse34 .cse20)) (and .cse28 (and .cse1 (and .cse15 .cse5 .cse32 .cse24 .cse6) .cse8) .cse29))))) [2018-12-31 10:26:24,170 INFO L448 ceAbstractionStarter]: For program point L125(lines 124 470) no Hoare annotation was computed. [2018-12-31 10:26:24,170 INFO L448 ceAbstractionStarter]: For program point L918(lines 918 922) no Hoare annotation was computed. [2018-12-31 10:26:24,170 INFO L448 ceAbstractionStarter]: For program point L786(lines 475 827) no Hoare annotation was computed. [2018-12-31 10:26:24,171 INFO L448 ceAbstractionStarter]: For program point L1315(lines 1245 1334) no Hoare annotation was computed. [2018-12-31 10:26:24,174 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 130) no Hoare annotation was computed. [2018-12-31 10:26:24,174 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2018-12-31 10:26:24,174 INFO L444 ceAbstractionStarter]: At program point L457(lines 450 467) the Hoare annotation is: (let ((.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~s_run_st~0)) (.cse0 (<= 2 ~s_run_pc~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~m_run_pc~0 3) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse3 .cse4 (not (= ~s_run_pc~0 2)) .cse1) .cse2 .cse0))) [2018-12-31 10:26:24,174 INFO L448 ceAbstractionStarter]: For program point L1316(lines 1316 1320) no Hoare annotation was computed. [2018-12-31 10:26:24,174 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 263) no Hoare annotation was computed. [2018-12-31 10:26:24,174 INFO L444 ceAbstractionStarter]: At program point L61(lines 52 62) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_memory_read_~i) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,174 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 862) no Hoare annotation was computed. [2018-12-31 10:26:24,175 INFO L448 ceAbstractionStarter]: For program point L458(lines 450 467) no Hoare annotation was computed. [2018-12-31 10:26:24,175 INFO L444 ceAbstractionStarter]: At program point L855(lines 850 1101) the Hoare annotation is: false [2018-12-31 10:26:24,175 INFO L444 ceAbstractionStarter]: At program point L657(lines 627 658) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,175 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 463) no Hoare annotation was computed. [2018-12-31 10:26:24,175 INFO L444 ceAbstractionStarter]: At program point L1120(lines 1109 1150) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 2))) (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0)) (.cse34 (<= 1 ~c_req_type~0)) (.cse9 (= ~m_run_pc~0 3)) (.cse35 (not .cse4)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (let ((.cse16 (<= ~m_run_pc~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse17 (<= ~c_m_lock~0 0)) (.cse18 (= ~m_run_st~0 0)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse22 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse24 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse28 (= ~req_tt_a~0 0)) (.cse25 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse29 (= 0 ~c_req_a~0)) (.cse3 (and .cse10 .cse11)) (.cse7 (= ~m_run_pc~0 6)) (.cse30 (= 0 ~c_req_type~0)) (.cse26 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 2 ~s_run_st~0)) (.cse12 (<= 2 ~s_run_pc~0)) (.cse19 (<= ~c_req_d~0 50)) (.cse0 (<= 0 ~a_t~0)) (.cse13 (= ~s_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse33 (<= ~c_req_type~0 1)) (.cse32 (and .cse14 .cse15 (and .cse34 .cse9 .cse10 .cse35 .cse11))) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= 50 ~c_req_d~0))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4) .cse5) .cse6 .cse7) (and (and .cse8 .cse9 .cse10 .cse11) .cse12) (and (and .cse8 .cse0 .cse1 .cse2 .cse12 .cse10 .cse11 .cse6) .cse7) (and .cse13 .cse14 .cse15 .cse8 .cse16 .cse2 .cse17 .cse18 .cse10 .cse11) (and .cse1 .cse2 (and .cse9 .cse10 .cse11) .cse4) (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and (and .cse1 .cse2 (and .cse8 .cse9 .cse18 .cse10) .cse5 .cse4) .cse0 .cse6) .cse25 .cse26 .cse27) (and .cse21 .cse22 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse28 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (and .cse29 .cse0 (and .cse1 .cse2 .cse5 .cse4 (and .cse8 .cse18 .cse10)) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6 .cse7) (= ULTIMATE.start_s_run_~req_type~1 0) .cse30) .cse31 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse13 .cse2 .cse32) (and .cse13 .cse0 .cse16 .cse30 .cse11 .cse29 .cse8 .cse1 .cse17 .cse10) (and .cse19 .cse20 (and (and .cse1 .cse33 .cse5 .cse4 (and .cse14 .cse15 (and .cse34 .cse9 .cse10 .cse11))) .cse0 .cse6)) (and .cse16 .cse0 .cse30 .cse12 .cse11 .cse29 .cse8 .cse1 .cse2 .cse17 .cse18 .cse10) (and .cse21 .cse22 .cse23 .cse24 .cse28 .cse25 (and (and .cse29 (and .cse1 .cse3 .cse5 .cse4) .cse0 .cse6 .cse7) .cse30) .cse26 .cse31 .cse27) (and .cse2 .cse12 (and .cse10 .cse35 .cse11)) (and .cse19 (and .cse0 (and .cse13 .cse1 .cse33 .cse32 .cse5) .cse6) .cse20))))) [2018-12-31 10:26:24,176 INFO L444 ceAbstractionStarter]: At program point L1054(lines 1047 1073) the Hoare annotation is: (let ((.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse0 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse10 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse11 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) (and .cse2 .cse3 .cse4 .cse5) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and (and (<= 1 ~c_req_type~0) (let ((.cse13 (and .cse3 .cse14 (not .cse5)))) (or (and (= ~s_run_pc~0 0) .cse13) (and .cse13 (<= 2 ~s_run_pc~0)))) .cse2 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse4 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse6 .cse7) .cse15 .cse16) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and .cse6 (and .cse2 (and .cse3 .cse14) .cse4 .cse5) .cse7) .cse15 .cse16))) [2018-12-31 10:26:24,176 INFO L448 ceAbstractionStarter]: For program point L1253(lines 1253 1306) no Hoare annotation was computed. [2018-12-31 10:26:24,176 INFO L444 ceAbstractionStarter]: At program point L1187(lines 1180 1224) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and .cse0 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse1 (<= 2 ~s_run_st~0) .cse4 .cse5 .cse2))) [2018-12-31 10:26:24,176 INFO L448 ceAbstractionStarter]: For program point L857(lines 857 861) no Hoare annotation was computed. [2018-12-31 10:26:24,176 INFO L444 ceAbstractionStarter]: At program point L725(lines 718 735) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,177 INFO L444 ceAbstractionStarter]: At program point L593(lines 586 603) the Hoare annotation is: (let ((.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= 0 ~c_req_type~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ULTIMATE.start_m_run_~req_type___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 0) (and (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) .cse0 (<= 1 ~c_m_lock~0) .cse1) (= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2018-12-31 10:26:24,177 INFO L444 ceAbstractionStarter]: At program point L329(lines 322 366) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2018-12-31 10:26:24,177 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1258) no Hoare annotation was computed. [2018-12-31 10:26:24,177 INFO L444 ceAbstractionStarter]: At program point L197(lines 167 198) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse2 (<= 0 ~a_t~0)) (.cse5 (= 0 ~c_req_type~0)) (.cse7 (= 0 ~c_req_a~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse11 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (= ~s_run_pc~0 0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse12 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse17 (= ~s_run_pc~0 2)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse16 (<= 2 ~s_run_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse11 .cse12 .cse14 .cse13 .cse15) (and .cse1 (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse16 .cse12 .cse13 .cse6 (<= 0 ULTIMATE.start_m_run_~a~0) .cse15) (and (and (not .cse17) .cse6 .cse13) .cse16 (<= 2 ~s_run_pc~0)))) [2018-12-31 10:26:24,177 INFO L448 ceAbstractionStarter]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2018-12-31 10:26:24,177 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 10:26:24,180 INFO L444 ceAbstractionStarter]: At program point L924(lines 917 952) the Hoare annotation is: (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3)) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse5 (<= ~c_req_type~0 1)) (.cse17 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse19 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 0 ~a_t~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse14 (= ~s_run_pc~0 2)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 (let ((.cse6 (and .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15)))) (or (and (= ~s_run_pc~0 0) .cse6) (and (<= 2 ~s_run_pc~0) .cse6))) .cse16 .cse17) .cse18) .cse19 .cse20) (and .cse0 .cse1 (and .cse2 (and (and .cse7 .cse8 (and .cse10 .cse11 .cse4 .cse12 .cse13 .cse15) .cse9) .cse3 .cse5 .cse16 .cse14 .cse17) .cse18) .cse19 .cse20) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) .cse2 (and (and .cse11 .cse13 .cse15) .cse3 .cse16 .cse14) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse18 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2018-12-31 10:26:24,180 INFO L444 ceAbstractionStarter]: At program point L858(lines 850 1101) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse3 (<= 0 ~a_t~0)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 2 ~s_run_pc~0) (and (= ~c_empty_req~0 1) .cse0 .cse1 .cse2)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse3 (and .cse4 (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) (<= 1 ~c_req_type~0) .cse0 .cse1 .cse2) (<= ~c_req_type~0 1) .cse5 .cse6) .cse7)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (and (and (= 0 ~c_req_a~0) .cse3 .cse4 .cse5 .cse6 (and .cse1 .cse2) .cse7 (= ~m_run_pc~0 6)) (= 0 ~c_req_type~0)) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2018-12-31 10:26:24,180 INFO L448 ceAbstractionStarter]: For program point L726(lines 718 735) no Hoare annotation was computed. [2018-12-31 10:26:24,180 INFO L448 ceAbstractionStarter]: For program point L594(lines 475 827) no Hoare annotation was computed. [2018-12-31 10:26:24,180 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 449) no Hoare annotation was computed. [2018-12-31 10:26:24,180 INFO L448 ceAbstractionStarter]: For program point L1189(lines 1189 1193) no Hoare annotation was computed. [2018-12-31 10:26:24,180 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 69) no Hoare annotation was computed. [2018-12-31 10:26:24,180 INFO L448 ceAbstractionStarter]: For program point L991-1(lines 866 1096) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L727(lines 727 731) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 599) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 335) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L444 ceAbstractionStarter]: At program point L265(lines 258 275) the Hoare annotation is: (let ((.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse4 (= ~c_empty_rsp~0 1))) (let ((.cse3 (and .cse5 (not .cse6) .cse4))) (let ((.cse0 (= ~s_run_pc~0 0)) (.cse1 (and (<= ~c_req_a~0 0) (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 0) (and (<= 1 ~c_req_type~0) (<= 1 ULTIMATE.start_m_run_~req_type~0) .cse3) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ULTIMATE.start_m_run_~req_a~0))) (.cse2 (<= 2 ~s_run_st~0))) (or (and .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_m_run_~req_d~0 50) .cse0 (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse1 (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (<= ULTIMATE.start_m_run_~req_type~0 1) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_m_run_~req_d~0)) (and .cse2 .cse3 (<= 2 ~s_run_pc~0)) (and (and .cse4 .cse5) .cse2 .cse6))))) [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L1124(lines 1124 1131) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L992(lines 991 1015) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L926(lines 926 930) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L266(lines 258 275) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 997) no Hoare annotation was computed. [2018-12-31 10:26:24,181 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 271) no Hoare annotation was computed. [2018-12-31 10:26:24,182 INFO L444 ceAbstractionStarter]: At program point L135-2(lines 135 163) the Hoare annotation is: (let ((.cse5 (<= 2 ~s_run_st~0)) (.cse13 (<= 2 ~s_run_pc~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse0 (= ~s_run_pc~0 0)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (<= 0 ~a_t~0)) (.cse1 (<= ~m_run_pc~0 0)) (.cse12 (= 0 ~c_req_type~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse14 (= 0 ~c_req_a~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse6 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse17 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 (<= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= 0 ULTIMATE.start_m_run_~a~0) .cse9) (and .cse10 .cse2 .cse11 .cse1 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse5 .cse16 .cse6 .cse17 .cse7 .cse8 .cse18 .cse9) (and .cse5 .cse13 .cse8 (not (= ~s_run_pc~0 2)) .cse3) (and .cse10 .cse0 .cse2 .cse11 .cse1 .cse12 .cse3 .cse14 .cse4 .cse15 .cse16 .cse6 .cse17 .cse7 .cse8 .cse18 .cse9))) [2018-12-31 10:26:24,182 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 717) no Hoare annotation was computed. [2018-12-31 10:26:24,182 INFO L448 ceAbstractionStarter]: For program point L136(lines 135 163) no Hoare annotation was computed. [2018-12-31 10:26:24,182 INFO L448 ceAbstractionStarter]: For program point L665(lines 665 669) no Hoare annotation was computed. [2018-12-31 10:26:24,182 INFO L444 ceAbstractionStarter]: At program point L1260(lines 1253 1306) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 2))) (let ((.cse9 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse16 (= ~m_run_pc~0 3)) (.cse34 (not .cse4)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse12 (<= ~m_run_pc~0 0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= ~c_m_lock~0 0)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse22 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse30 (= ~req_tt_a~0 0)) (.cse24 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (= 0 ~c_req_a~0)) (.cse3 (and .cse14 .cse15)) (.cse7 (= ~m_run_pc~0 6)) (.cse18 (= 0 ~c_req_type~0)) (.cse25 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 2 ~s_run_st~0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse26 (<= ~c_req_d~0 50)) (.cse0 (<= 0 ~a_t~0)) (.cse8 (= ~s_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= ~c_req_type~0 1)) (.cse20 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse34 .cse15))) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse27 (<= 50 ~c_req_d~0))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and (and .cse11 .cse16 .cse14 .cse15) .cse17) (and (and .cse11 .cse0 .cse1 .cse2 .cse17 .cse14 .cse15 .cse6) .cse7) (and .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse2 .cse4 .cse13 .cse14) (and .cse8 .cse2 .cse20) (and .cse21 .cse22 .cse0 .cse23 .cse24 .cse16 .cse25 .cse26 .cse27 .cse11 .cse1 .cse28 .cse2 .cse5 .cse4 .cse14 .cse6 .cse29) (and .cse21 .cse22 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (and (= ULTIMATE.start_s_run_~req_type~1 0) (and .cse19 (and .cse1 .cse2 (and .cse11 .cse14) .cse5 .cse4) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6 .cse7) .cse18) .cse30 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse31 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse13 .cse14) (and .cse1 .cse2 (and .cse16 .cse14 .cse15) .cse4) (and .cse26 .cse27 (and (and .cse1 .cse32 .cse5 .cse4 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse15))) .cse0 .cse6)) (and .cse21 .cse22 .cse23 .cse28 .cse30 .cse24 (and (and .cse19 (and .cse1 .cse3 .cse5 .cse4) .cse0 .cse6 .cse7) .cse18) .cse25 .cse31 .cse29) (and .cse2 .cse17 (and .cse14 .cse34 .cse15)) (and .cse26 (and .cse0 (and .cse8 .cse1 .cse32 .cse20 .cse5) .cse6) .cse27))))) [2018-12-31 10:26:24,182 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 141) no Hoare annotation was computed. [2018-12-31 10:26:24,186 INFO L444 ceAbstractionStarter]: At program point L1062(lines 1055 1072) the Hoare annotation is: (let ((.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse0 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse10 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse11 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= 0 ~a_t~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) (and .cse2 .cse3 .cse4 .cse5) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and (and (<= 1 ~c_req_type~0) (let ((.cse13 (and .cse3 .cse14 (not .cse5)))) (or (and (= ~s_run_pc~0 0) .cse13) (and .cse13 (<= 2 ~s_run_pc~0)))) .cse2 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse4 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse6 .cse7) .cse15 .cse16) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 (and .cse6 (and .cse2 (and .cse3 .cse14) .cse4 .cse5) .cse7) .cse15 .cse16))) [2018-12-31 10:26:24,186 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 257) no Hoare annotation was computed. [2018-12-31 10:26:24,186 INFO L444 ceAbstractionStarter]: At program point L1195(lines 1188 1223) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and .cse0 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse1 (<= 2 ~s_run_st~0) .cse4 .cse5 .cse2))) [2018-12-31 10:26:24,186 INFO L448 ceAbstractionStarter]: For program point L1063(lines 866 1096) no Hoare annotation was computed. [2018-12-31 10:26:24,186 INFO L444 ceAbstractionStarter]: At program point L403(lines 396 449) the Hoare annotation is: (let ((.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~s_run_st~0)) (.cse0 (<= 2 ~s_run_pc~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~m_run_pc~0 3) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse3 .cse4 (not (= ~s_run_pc~0 2)) .cse1) .cse2 .cse0))) [2018-12-31 10:26:24,187 INFO L444 ceAbstractionStarter]: At program point L337(lines 330 365) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2018-12-31 10:26:24,187 INFO L448 ceAbstractionStarter]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. [2018-12-31 10:26:24,189 INFO L448 ceAbstractionStarter]: For program point L1328-1(lines 1160 1339) no Hoare annotation was computed. [2018-12-31 10:26:24,189 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1266) no Hoare annotation was computed. [2018-12-31 10:26:24,189 INFO L448 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2018-12-31 10:26:24,189 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,189 INFO L448 ceAbstractionStarter]: For program point L1064(lines 1064 1068) no Hoare annotation was computed. [2018-12-31 10:26:24,189 INFO L444 ceAbstractionStarter]: At program point L932(lines 925 951) the Hoare annotation is: (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3)) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse5 (<= ~c_req_type~0 1)) (.cse17 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse19 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 0 ~a_t~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse14 (= ~s_run_pc~0 2)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 (let ((.cse6 (and .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15)))) (or (and (= ~s_run_pc~0 0) .cse6) (and (<= 2 ~s_run_pc~0) .cse6))) .cse16 .cse17) .cse18) .cse19 .cse20) (and .cse0 .cse1 (and .cse2 (and (and .cse7 .cse8 (and .cse10 .cse11 .cse4 .cse12 .cse13 .cse15) .cse9) .cse3 .cse5 .cse16 .cse14 .cse17) .cse18) .cse19 .cse20) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) .cse2 (and (and .cse11 .cse13 .cse15) .cse3 .cse16 .cse14) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse18 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2018-12-31 10:26:24,190 INFO L444 ceAbstractionStarter]: At program point L866-1(lines 850 1101) the Hoare annotation is: (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse2 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse15 (= ~s_run_pc~0 2)) (.cse10 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse6 (= ~m_run_pc~0 3)) (.cse12 (<= 2 ~s_run_pc~0)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 0 ~a_t~0)) (.cse17 (= 0 ~c_req_type~0)) (.cse13 (<= ~c_req_a~0 0)) (.cse14 (<= 0 ~c_req_a~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (and .cse4 (and .cse5 .cse6 .cse7) .cse8) .cse9 .cse10) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse0 .cse1 (and (and .cse4 (<= ~c_req_type~0 1) .cse8 (let ((.cse11 (and .cse13 .cse14 (<= 1 ~c_req_type~0) .cse6 .cse7 (not .cse15) .cse16))) (or (and .cse11 .cse12) (and (= ~s_run_pc~0 0) .cse11)))) .cse9 .cse10)) (and .cse2 .cse3 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) .cse17 (and (= 0 ~c_req_a~0) .cse9 (= 0 ULTIMATE.start_s_run_~req_a~1) (and .cse4 .cse8 .cse15 (and .cse5 .cse7)) .cse10 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and (and .cse5 .cse6 .cse7 .cse16) .cse12) (and .cse4 .cse9 .cse17 (and .cse13 .cse14 .cse5 (<= ~m_run_pc~0 0) (<= ~c_m_lock~0 0) .cse7 .cse16)))) [2018-12-31 10:26:24,191 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1201) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 805) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L444 ceAbstractionStarter]: At program point L471(lines 123 472) the Hoare annotation is: (let ((.cse4 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse0 (<= ~c_m_lock~0 0)) (.cse1 (<= 2 ~c_write_rsp_ev~0))) (or (and (and .cse0 .cse1 (not (= ~s_run_pc~0 2)) .cse2) .cse3 .cse4) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (= ~m_run_pc~0 3) .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse3 .cse0 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 343) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L934(lines 934 938) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,192 INFO L448 ceAbstractionStarter]: For program point L869-1(lines 866 1096) no Hoare annotation was computed. [2018-12-31 10:26:24,193 INFO L448 ceAbstractionStarter]: For program point L737(lines 737 743) no Hoare annotation was computed. [2018-12-31 10:26:24,200 INFO L444 ceAbstractionStarter]: At program point L737-1(lines 737 743) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,200 INFO L444 ceAbstractionStarter]: At program point L671(lines 664 717) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,200 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 1 1366) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_memory_read_~i) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,201 INFO L444 ceAbstractionStarter]: At program point L11-4(lines 64 72) the Hoare annotation is: (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse2 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse15 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse3 (<= 0 ~a_t~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2)) (.cse13 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 (and .cse3 (and (let ((.cse4 (and .cse5 .cse6 .cse7 .cse8 (not .cse9) .cse10))) (or (and (= ~s_run_pc~0 0) .cse4) (and .cse4 (<= 2 ~s_run_pc~0)))) (<= 1 ~c_req_type~0) .cse11 (<= ~c_req_type~0 1) .cse12 .cse13) .cse14) .cse15 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse15 .cse16 (and .cse3 (and (and (and .cse5 .cse6 .cse7 .cse8 .cse10) (= ULTIMATE.start_s_memory_write_~i 0)) .cse11 .cse12 .cse9 .cse13) .cse14) .cse17 .cse18 .cse19))) [2018-12-31 10:26:24,201 INFO L448 ceAbstractionStarter]: For program point L870(lines 869 893) no Hoare annotation was computed. [2018-12-31 10:26:24,201 INFO L444 ceAbstractionStarter]: At program point L1135(lines 1109 1150) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 2))) (let ((.cse9 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse16 (= ~m_run_pc~0 3)) (.cse34 (not .cse4)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse12 (<= ~m_run_pc~0 0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= ~c_m_lock~0 0)) (.cse20 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse27 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse30 (= ~req_tt_a~0 0)) (.cse23 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (= 0 ~c_req_a~0)) (.cse3 (and .cse14 .cse15)) (.cse7 (= ~m_run_pc~0 6)) (.cse18 (= 0 ~c_req_type~0)) (.cse24 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse28 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 2 ~s_run_st~0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse25 (<= ~c_req_d~0 50)) (.cse0 (<= 0 ~a_t~0)) (.cse8 (= ~s_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= ~c_req_type~0 1)) (.cse29 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse34 .cse15))) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse26 (<= 50 ~c_req_d~0))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and (and .cse11 .cse16 .cse14 .cse15) .cse17) (and (and .cse11 .cse0 .cse1 .cse2 .cse17 .cse14 .cse15 .cse6) .cse7) (and .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse2 .cse4 .cse13 .cse14) (and .cse20 .cse21 .cse0 .cse22 .cse23 .cse16 .cse24 .cse25 .cse26 .cse11 .cse1 .cse27 .cse2 .cse5 .cse4 .cse14 .cse6 .cse28) (and .cse1 .cse2 (and .cse16 .cse14 .cse15) .cse4) (and .cse8 .cse2 .cse29) (and .cse20 .cse21 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (and (= ULTIMATE.start_s_run_~req_type~1 0) (and .cse19 (and .cse1 .cse2 (and .cse11 .cse14) .cse5 .cse4) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6 .cse7) .cse18) .cse30 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse31 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse13 .cse14) (and .cse25 .cse26 (and (and .cse1 .cse32 .cse5 .cse4 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse15))) .cse0 .cse6)) (and .cse20 .cse21 .cse22 .cse27 .cse30 .cse23 (and (and .cse19 (and .cse1 .cse3 .cse5 .cse4) .cse0 .cse6 .cse7) .cse18) .cse24 .cse31 .cse28) (and .cse2 .cse17 (and .cse14 .cse34 .cse15)) (and .cse25 (and .cse0 (and .cse8 .cse1 .cse32 .cse29 .cse5) .cse6) .cse26))))) [2018-12-31 10:26:24,204 INFO L448 ceAbstractionStarter]: For program point L871(lines 871 875) no Hoare annotation was computed. [2018-12-31 10:26:24,205 INFO L448 ceAbstractionStarter]: For program point L673(lines 673 677) no Hoare annotation was computed. [2018-12-31 10:26:24,205 INFO L444 ceAbstractionStarter]: At program point L475-2(lines 475 827) the Hoare annotation is: (let ((.cse9 (= ~s_run_pc~0 2))) (let ((.cse5 (<= 2 ~s_run_pc~0)) (.cse3 (not .cse9)) (.cse7 (= ~m_run_pc~0 3)) (.cse11 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse6 (<= 0 ~a_t~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse10 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 (<= 3 ~m_run_pc~0) .cse4) .cse5) (and .cse6 (and (and .cse7 .cse1 .cse2 .cse4) .cse8 .cse0 .cse9) .cse10) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse5 .cse1 .cse2 .cse3 .cse4 .cse11) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse6 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (and (and .cse0 (and .cse12 .cse7 .cse1 .cse2 .cse4)) .cse8 .cse9) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse11 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse6 .cse8 (and .cse12 .cse1 .cse2 .cse4) .cse0 .cse9 .cse10 (= ~m_run_pc~0 6))))) [2018-12-31 10:26:24,209 INFO L444 ceAbstractionStarter]: At program point L1268(lines 1261 1305) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 2))) (let ((.cse9 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse16 (= ~m_run_pc~0 3)) (.cse34 (not .cse4)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse12 (<= ~m_run_pc~0 0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= ~c_m_lock~0 0)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse22 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse30 (= ~req_tt_a~0 0)) (.cse24 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (= 0 ~c_req_a~0)) (.cse3 (and .cse14 .cse15)) (.cse7 (= ~m_run_pc~0 6)) (.cse18 (= 0 ~c_req_type~0)) (.cse25 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 2 ~s_run_st~0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse26 (<= ~c_req_d~0 50)) (.cse0 (<= 0 ~a_t~0)) (.cse8 (= ~s_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= ~c_req_type~0 1)) (.cse20 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse34 .cse15))) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse27 (<= 50 ~c_req_d~0))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and (and .cse11 .cse16 .cse14 .cse15) .cse17) (and (and .cse11 .cse0 .cse1 .cse2 .cse17 .cse14 .cse15 .cse6) .cse7) (and .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse2 .cse4 .cse13 .cse14) (and .cse8 .cse2 .cse20) (and .cse21 .cse22 .cse0 .cse23 .cse24 .cse16 .cse25 .cse26 .cse27 .cse11 .cse1 .cse28 .cse2 .cse5 .cse4 .cse14 .cse6 .cse29) (and .cse21 .cse22 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (and (= ULTIMATE.start_s_run_~req_type~1 0) (and .cse19 (and .cse1 .cse2 (and .cse11 .cse14) .cse5 .cse4) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6 .cse7) .cse18) .cse30 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse31 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse13 .cse14) (and .cse1 .cse2 (and .cse16 .cse14 .cse15) .cse4) (and .cse26 .cse27 (and (and .cse1 .cse32 .cse5 .cse4 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse15))) .cse0 .cse6)) (and .cse21 .cse22 .cse23 .cse28 .cse30 .cse24 (and (and .cse19 (and .cse1 .cse3 .cse5 .cse4) .cse0 .cse6 .cse7) .cse18) .cse25 .cse31 .cse29) (and .cse2 .cse17 (and .cse14 .cse34 .cse15)) (and .cse26 (and .cse0 (and .cse8 .cse1 .cse32 .cse20 .cse5) .cse6) .cse27))))) [2018-12-31 10:26:24,209 INFO L444 ceAbstractionStarter]: At program point L211(lines 204 257) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ~s_run_pc~0 0)) (.cse5 (<= 1 ~c_req_type~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (<= ~m_run_pc~0 0)) (.cse13 (<= 0 ~a_t~0)) (.cse14 (<= ~c_req_type~0 1)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse15 (<= ~c_req_d~0 50)) (.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse10 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse19 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 (not (= ~s_run_pc~0 2)) .cse2 .cse3) (and .cse4 (<= ULTIMATE.start_m_run_~a~0 0) .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 .cse0 .cse10 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) .cse11) (and .cse12 .cse5 .cse13 .cse6 .cse7 .cse14 .cse1 .cse2 .cse15 .cse8 .cse16 .cse9 .cse0 .cse17 .cse18 .cse19 .cse10 .cse3 .cse20 .cse11) (and .cse12 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14 .cse2 .cse15 .cse8 .cse9 .cse16 .cse17 .cse18 .cse10 .cse19 .cse3 .cse20 .cse11))) [2018-12-31 10:26:24,213 INFO L448 ceAbstractionStarter]: For program point L476(lines 475 827) no Hoare annotation was computed. [2018-12-31 10:26:24,213 INFO L451 ceAbstractionStarter]: At program point L1335(lines 1157 1340) the Hoare annotation is: true [2018-12-31 10:26:24,213 INFO L444 ceAbstractionStarter]: At program point L278-2(lines 278 306) the Hoare annotation is: (let ((.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~s_run_pc~0 2)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse5 (<= ~c_req_a~0 0)) (.cse6 (<= 0 ~c_req_a~0)) (.cse7 (<= 1 ~c_req_type~0)) (.cse19 (and .cse9 (not .cse11) .cse8))) (let ((.cse4 (<= ~c_req_type~0 1)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse13 (= ~s_run_pc~0 0)) (.cse14 (and .cse5 .cse6 (and .cse7 .cse19))) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 2 ~s_run_st~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse18 (= ~m_run_pc~0 3)) (.cse2 (<= 0 ~a_t~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 (and .cse5 .cse6 (and .cse7 .cse8 .cse9)) .cse10 .cse11) .cse12)) (and .cse0 (and .cse2 (and .cse13 .cse3 .cse4 .cse10 .cse14) .cse12) .cse1) (and (and .cse8 .cse9) .cse3 .cse15 .cse11) (and .cse16 .cse17 .cse18 .cse9 .cse8) (and .cse15 .cse19 .cse17) (and .cse13 .cse15 .cse14) (and .cse0 .cse1 (and .cse16 .cse3 .cse15 .cse10 .cse11 .cse18 .cse9) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse2 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse12 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))))) [2018-12-31 10:26:24,213 INFO L444 ceAbstractionStarter]: At program point L1203(lines 1196 1222) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and .cse0 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse1 (<= 2 ~s_run_st~0) .cse4 .cse5 .cse2))) [2018-12-31 10:26:24,213 INFO L444 ceAbstractionStarter]: At program point L807(lines 800 817) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,216 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 613) no Hoare annotation was computed. [2018-12-31 10:26:24,217 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2018-12-31 10:26:24,217 INFO L444 ceAbstractionStarter]: At program point L411(lines 404 448) the Hoare annotation is: (let ((.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~s_run_st~0)) (.cse0 (<= 2 ~s_run_pc~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~m_run_pc~0 3) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse3 .cse4 (not (= ~s_run_pc~0 2)) .cse1) .cse2 .cse0))) [2018-12-31 10:26:24,217 INFO L444 ceAbstractionStarter]: At program point L345(lines 338 364) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2018-12-31 10:26:24,217 INFO L448 ceAbstractionStarter]: For program point L279(lines 278 306) no Hoare annotation was computed. [2018-12-31 10:26:24,217 INFO L448 ceAbstractionStarter]: For program point L1270(lines 1270 1274) no Hoare annotation was computed. [2018-12-31 10:26:24,217 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 217) no Hoare annotation was computed. [2018-12-31 10:26:24,217 INFO L444 ceAbstractionStarter]: At program point L940(lines 933 950) the Hoare annotation is: (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3)) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse5 (<= ~c_req_type~0 1)) (.cse17 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse19 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 0 ~a_t~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse14 (= ~s_run_pc~0 2)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 (let ((.cse6 (and .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15)))) (or (and (= ~s_run_pc~0 0) .cse6) (and (<= 2 ~s_run_pc~0) .cse6))) .cse16 .cse17) .cse18) .cse19 .cse20) (and .cse0 .cse1 (and .cse2 (and (and .cse7 .cse8 (and .cse10 .cse11 .cse4 .cse12 .cse13 .cse15) .cse9) .cse3 .cse5 .cse16 .cse14 .cse17) .cse18) .cse19 .cse20) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (= 0 ~c_req_a~0) .cse2 (and (and .cse11 .cse13 .cse15) .cse3 .cse16 .cse14) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse18 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2018-12-31 10:26:24,221 INFO L448 ceAbstractionStarter]: For program point L808(lines 800 817) no Hoare annotation was computed. [2018-12-31 10:26:24,221 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2018-12-31 10:26:24,222 INFO L448 ceAbstractionStarter]: For program point L1205(lines 1205 1209) no Hoare annotation was computed. [2018-12-31 10:26:24,222 INFO L448 ceAbstractionStarter]: For program point L1139(lines 1139 1146) no Hoare annotation was computed. [2018-12-31 10:26:24,222 INFO L448 ceAbstractionStarter]: For program point L941(lines 866 1096) no Hoare annotation was computed. [2018-12-31 10:26:24,222 INFO L448 ceAbstractionStarter]: For program point L809(lines 809 813) no Hoare annotation was computed. [2018-12-31 10:26:24,222 INFO L448 ceAbstractionStarter]: For program point L413(lines 413 417) no Hoare annotation was computed. [2018-12-31 10:26:24,222 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. [2018-12-31 10:26:24,222 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-31 10:26:24,222 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 946) no Hoare annotation was computed. [2018-12-31 10:26:24,222 INFO L444 ceAbstractionStarter]: At program point L679(lines 672 716) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,223 INFO L444 ceAbstractionStarter]: At program point L547(lines 517 548) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 2))) (let ((.cse2 (not .cse5)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (and .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) .cse0 .cse1) (and (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (and (= ~m_run_pc~0 3) .cse3 .cse4) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ~c_m_lock~0) .cse5) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ULTIMATE.start_m_run_~req_type___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2018-12-31 10:26:24,227 INFO L448 ceAbstractionStarter]: For program point L746(lines 746 799) no Hoare annotation was computed. [2018-12-31 10:26:24,227 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 10:26:24,227 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2018-12-31 10:26:24,227 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 685) no Hoare annotation was computed. [2018-12-31 10:26:24,227 INFO L444 ceAbstractionStarter]: At program point L615(lines 608 625) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~s_run_pc~0 2)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and (<= 0 ~a_t~0) (and .cse0 (<= 1 ~c_m_lock~0) .cse1 (and .cse2 .cse3)) (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse0 (<= 2 ~s_run_pc~0) (and .cse3 (not .cse1) .cse2)))) [2018-12-31 10:26:24,228 INFO L444 ceAbstractionStarter]: At program point L1276(lines 1269 1304) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 2))) (let ((.cse9 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse16 (= ~m_run_pc~0 3)) (.cse34 (not .cse4)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse12 (<= ~m_run_pc~0 0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= ~c_m_lock~0 0)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse22 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse30 (= ~req_tt_a~0 0)) (.cse24 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (= 0 ~c_req_a~0)) (.cse3 (and .cse14 .cse15)) (.cse7 (= ~m_run_pc~0 6)) (.cse18 (= 0 ~c_req_type~0)) (.cse25 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 2 ~s_run_st~0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse26 (<= ~c_req_d~0 50)) (.cse0 (<= 0 ~a_t~0)) (.cse8 (= ~s_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= ~c_req_type~0 1)) (.cse20 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse34 .cse15))) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse27 (<= 50 ~c_req_d~0))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and (and .cse11 .cse16 .cse14 .cse15) .cse17) (and (and .cse11 .cse0 .cse1 .cse2 .cse17 .cse14 .cse15 .cse6) .cse7) (and .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse2 .cse4 .cse13 .cse14) (and .cse8 .cse2 .cse20) (and .cse21 .cse22 .cse0 .cse23 .cse24 .cse16 .cse25 .cse26 .cse27 .cse11 .cse1 .cse28 .cse2 .cse5 .cse4 .cse14 .cse6 .cse29) (and .cse21 .cse22 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (and (= ULTIMATE.start_s_run_~req_type~1 0) (and .cse19 (and .cse1 .cse2 (and .cse11 .cse14) .cse5 .cse4) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6 .cse7) .cse18) .cse30 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse31 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse13 .cse14) (and .cse1 .cse2 (and .cse16 .cse14 .cse15) .cse4) (and .cse26 .cse27 (and (and .cse1 .cse32 .cse5 .cse4 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse15))) .cse0 .cse6)) (and .cse21 .cse22 .cse23 .cse28 .cse30 .cse24 (and (and .cse19 (and .cse1 .cse3 .cse5 .cse4) .cse0 .cse6 .cse7) .cse18) .cse25 .cse31 .cse29) (and .cse2 .cse17 (and .cse14 .cse34 .cse15)) (and .cse26 (and .cse0 (and .cse8 .cse1 .cse32 .cse20 .cse5) .cse6) .cse27))))) [2018-12-31 10:26:24,229 INFO L444 ceAbstractionStarter]: At program point L219(lines 212 256) the Hoare annotation is: (let ((.cse11 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (<= 1 ~c_req_type~0)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse12 (<= 0 ~a_t~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse15 (<= ~c_req_d~0 50)) (.cse5 (<= ~c_req_a~0 0)) (.cse6 (<= 0 ~c_req_a~0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse19 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse20 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse14 (<= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (<= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0) .cse10) (and .cse11 .cse1 .cse12 .cse2 .cse3 .cse13 .cse14 .cse4 .cse15 .cse5 .cse16 .cse6 .cse7 .cse17 .cse18 .cse19 .cse8 .cse9 .cse20 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse4 .cse15 .cse5 .cse6 .cse16 .cse17 .cse18 .cse8 .cse19 .cse9 .cse20 .cse10) (and .cse7 .cse14 (and (not (= ~s_run_pc~0 2)) .cse4 .cse9)))) [2018-12-31 10:26:24,229 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2018-12-31 10:26:24,232 INFO L448 ceAbstractionStarter]: For program point L616(lines 608 625) no Hoare annotation was computed. [2018-12-31 10:26:24,233 INFO L444 ceAbstractionStarter]: At program point L1211(lines 1204 1221) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5) (and .cse0 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse1 (<= 2 ~s_run_st~0) .cse4 .cse5 .cse2))) [2018-12-31 10:26:24,233 INFO L448 ceAbstractionStarter]: For program point L617(lines 617 621) no Hoare annotation was computed. [2018-12-31 10:26:24,233 INFO L444 ceAbstractionStarter]: At program point L419(lines 412 447) the Hoare annotation is: (let ((.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~s_run_st~0)) (.cse0 (<= 2 ~s_run_pc~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~m_run_pc~0 3) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse3 .cse4 (not (= ~s_run_pc~0 2)) .cse1) .cse2 .cse0))) [2018-12-31 10:26:24,233 INFO L444 ceAbstractionStarter]: At program point L485-2(lines 485 513) the Hoare annotation is: (let ((.cse6 (= ~s_run_pc~0 2))) (let ((.cse5 (<= 2 ~s_run_pc~0)) (.cse2 (not .cse6)) (.cse4 (<= 2 ~s_run_st~0)) (.cse0 (<= ~c_m_lock~0 0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse1 (<= 2 ~c_write_rsp_ev~0))) (or (and (and (<= ULTIMATE.start_m_run_~a~0 0) (and .cse0 .cse1 .cse2 .cse3) (<= 0 ULTIMATE.start_m_run_~a~0)) .cse4 .cse5) (and .cse4 .cse5 (and .cse1 .cse2 (<= 3 ~m_run_pc~0) .cse3)) (and (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ULTIMATE.start_m_run_~req_type___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 0) (and (<= 2 ~c_write_req_ev~0) .cse4 .cse6 (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) .cse0 .cse3 .cse1)) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2018-12-31 10:26:24,233 INFO L444 ceAbstractionStarter]: At program point L353(lines 346 363) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2018-12-31 10:26:24,233 INFO L448 ceAbstractionStarter]: For program point L1278(lines 1278 1282) no Hoare annotation was computed. [2018-12-31 10:26:24,233 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 225) no Hoare annotation was computed. [2018-12-31 10:26:24,234 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1160 1339) no Hoare annotation was computed. [2018-12-31 10:26:24,234 INFO L448 ceAbstractionStarter]: For program point L486(lines 485 513) no Hoare annotation was computed. [2018-12-31 10:26:24,237 INFO L448 ceAbstractionStarter]: For program point L354(lines 124 470) no Hoare annotation was computed. [2018-12-31 10:26:24,237 INFO L448 ceAbstractionStarter]: For program point L1213(lines 1213 1217) no Hoare annotation was computed. [2018-12-31 10:26:24,237 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2018-12-31 10:26:24,237 INFO L448 ceAbstractionStarter]: For program point L421(lines 421 425) no Hoare annotation was computed. [2018-12-31 10:26:24,237 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 359) no Hoare annotation was computed. [2018-12-31 10:26:24,238 INFO L444 ceAbstractionStarter]: At program point L1016(lines 990 1017) the Hoare annotation is: (let ((.cse7 (= ~c_empty_rsp~0 1)) (.cse10 (<= ~c_req_d~0 50)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse5 (= ~s_run_pc~0 2)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 50 ~c_req_d~0)) (.cse0 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= 0 ~c_req_a~0) .cse8 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse9 (= ~m_run_pc~0 6))) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse10 .cse11 .cse0 .cse1 .cse12 .cse13 (and .cse8 (and .cse3 (and .cse2 .cse14 .cse6 .cse7) .cse4 .cse5) .cse9) .cse15 .cse16 .cse17) (and .cse10 (and (and (<= 1 ~c_req_type~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse4 (let ((.cse18 (and .cse2 .cse14 (not .cse5) .cse6))) (or (and (= ~s_run_pc~0 0) .cse18) (and .cse18 (<= 2 ~s_run_pc~0)))) (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse8 .cse9) .cse11 .cse0 .cse1 .cse12 .cse13 .cse15 .cse16 .cse17))) [2018-12-31 10:26:24,238 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 607) no Hoare annotation was computed. [2018-12-31 10:26:24,238 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 120) no Hoare annotation was computed. [2018-12-31 10:26:24,238 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 825) no Hoare annotation was computed. [2018-12-31 10:26:24,238 INFO L444 ceAbstractionStarter]: At program point L819-1(lines 819 825) the Hoare annotation is: (let ((.cse5 (<= 0 ~a_t~0)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) (<= 3 ~m_run_pc~0) .cse4) (<= 2 ~s_run_pc~0)) (and .cse5 .cse6 (and (= ~c_empty_req~0 1) .cse1 .cse2 .cse4) .cse0 .cse3 .cse7 (= ~m_run_pc~0 6)) (and .cse5 (and (and (= ~m_run_pc~0 3) .cse1 .cse2 .cse4) .cse6 .cse0 .cse3) .cse7))) [2018-12-31 10:26:24,238 INFO L444 ceAbstractionStarter]: At program point L753(lines 746 799) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,245 INFO L444 ceAbstractionStarter]: At program point L687(lines 680 715) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,245 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2018-12-31 10:26:24,245 INFO L444 ceAbstractionStarter]: At program point L1084(lines 1077 1094) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (and (= 0 ~c_req_a~0) .cse2 (= 0 ULTIMATE.start_s_run_~req_a~1) (and .cse3 .cse4 .cse5 (= ~s_run_pc~0 2)) .cse6 (= ~m_run_pc~0 6)) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0)) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 .cse1 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and .cse2 (and .cse4 .cse5 (let ((.cse7 (and .cse3 (= ~m_run_pc~0 3)))) (or (and .cse7 (<= 2 ~s_run_pc~0)) (and (= ~s_run_pc~0 0) .cse7)))) .cse6) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2018-12-31 10:26:24,246 INFO L444 ceAbstractionStarter]: At program point L1151(lines 1103 1156) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 2))) (let ((.cse9 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse16 (= ~m_run_pc~0 3)) (.cse34 (not .cse4)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse12 (<= ~m_run_pc~0 0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= ~c_m_lock~0 0)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse22 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse30 (= ~req_tt_a~0 0)) (.cse24 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (= 0 ~c_req_a~0)) (.cse3 (and .cse14 .cse15)) (.cse7 (= ~m_run_pc~0 6)) (.cse18 (= 0 ~c_req_type~0)) (.cse25 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 2 ~s_run_st~0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse26 (<= ~c_req_d~0 50)) (.cse0 (<= 0 ~a_t~0)) (.cse8 (= ~s_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= ~c_req_type~0 1)) (.cse20 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse34 .cse15))) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse27 (<= 50 ~c_req_d~0))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and (and .cse11 .cse16 .cse14 .cse15) .cse17) (and (and .cse11 .cse0 .cse1 .cse2 .cse17 .cse14 .cse15 .cse6) .cse7) (and .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse2 .cse4 .cse13 .cse14) (and .cse8 .cse2 .cse20) (and .cse21 .cse22 .cse0 .cse23 .cse24 .cse16 .cse25 .cse26 .cse27 .cse11 .cse1 .cse28 .cse2 .cse5 .cse4 .cse14 .cse6 .cse29) (and .cse21 .cse22 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (and (= ULTIMATE.start_s_run_~req_type~1 0) (and .cse19 (and .cse1 .cse2 (and .cse11 .cse14) .cse5 .cse4) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6 .cse7) .cse18) .cse30 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse31 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse13 .cse14) (and .cse1 .cse2 (and .cse16 .cse14 .cse15) .cse4) (and .cse26 .cse27 (and (and .cse1 .cse32 .cse5 .cse4 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse15))) .cse0 .cse6)) (and .cse21 .cse22 .cse23 .cse28 .cse30 .cse24 (and (and .cse19 (and .cse1 .cse3 .cse5 .cse4) .cse0 .cse6 .cse7) .cse18) .cse25 .cse31 .cse29) (and .cse2 .cse17 (and .cse14 .cse34 .cse15)) (and .cse26 (and .cse0 (and .cse8 .cse1 .cse32 .cse20 .cse5) .cse6) .cse27))))) [2018-12-31 10:26:24,251 INFO L448 ceAbstractionStarter]: For program point L1085(lines 1077 1094) no Hoare annotation was computed. [2018-12-31 10:26:24,251 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 10:26:24,251 INFO L448 ceAbstractionStarter]: For program point L755(lines 755 759) no Hoare annotation was computed. [2018-12-31 10:26:24,251 INFO L448 ceAbstractionStarter]: For program point L689(lines 689 693) no Hoare annotation was computed. [2018-12-31 10:26:24,251 INFO L444 ceAbstractionStarter]: At program point L1284(lines 1277 1303) the Hoare annotation is: (let ((.cse4 (= ~s_run_pc~0 2))) (let ((.cse9 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse16 (= ~m_run_pc~0 3)) (.cse34 (not .cse4)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse12 (<= ~m_run_pc~0 0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= ~c_m_lock~0 0)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse22 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse30 (= ~req_tt_a~0 0)) (.cse24 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (= 0 ~c_req_a~0)) (.cse3 (and .cse14 .cse15)) (.cse7 (= ~m_run_pc~0 6)) (.cse18 (= 0 ~c_req_type~0)) (.cse25 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 2 ~s_run_st~0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse26 (<= ~c_req_d~0 50)) (.cse0 (<= 0 ~a_t~0)) (.cse8 (= ~s_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= ~c_req_type~0 1)) (.cse20 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse34 .cse15))) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse27 (<= 50 ~c_req_d~0))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and (and .cse11 .cse16 .cse14 .cse15) .cse17) (and (and .cse11 .cse0 .cse1 .cse2 .cse17 .cse14 .cse15 .cse6) .cse7) (and .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse2 .cse4 .cse13 .cse14) (and .cse8 .cse2 .cse20) (and .cse21 .cse22 .cse0 .cse23 .cse24 .cse16 .cse25 .cse26 .cse27 .cse11 .cse1 .cse28 .cse2 .cse5 .cse4 .cse14 .cse6 .cse29) (and .cse21 .cse22 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (and (= ULTIMATE.start_s_run_~req_type~1 0) (and .cse19 (and .cse1 .cse2 (and .cse11 .cse14) .cse5 .cse4) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6 .cse7) .cse18) .cse30 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse31 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse0 .cse12 .cse18 .cse15 .cse19 .cse11 .cse1 .cse13 .cse14) (and .cse1 .cse2 (and .cse16 .cse14 .cse15) .cse4) (and .cse26 .cse27 (and (and .cse1 .cse32 .cse5 .cse4 (and .cse9 .cse10 (and .cse33 .cse16 .cse14 .cse15))) .cse0 .cse6)) (and .cse21 .cse22 .cse23 .cse28 .cse30 .cse24 (and (and .cse19 (and .cse1 .cse3 .cse5 .cse4) .cse0 .cse6 .cse7) .cse18) .cse25 .cse31 .cse29) (and .cse2 .cse17 (and .cse14 .cse34 .cse15)) (and .cse26 (and .cse0 (and .cse8 .cse1 .cse32 .cse20 .cse5) .cse6) .cse27))))) [2018-12-31 10:26:24,253 INFO L444 ceAbstractionStarter]: At program point L227(lines 220 255) the Hoare annotation is: (let ((.cse23 (= ~s_run_pc~0 2))) (let ((.cse17 (<= 1 ~c_req_type~0)) (.cse18 (<= ~m_run_pc~0 0)) (.cse19 (= ~m_run_pc~0 3)) (.cse0 (not .cse23)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse24 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (<= 0 ~c_req_a~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse21 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (let ((.cse4 (= ~s_run_pc~0 0)) (.cse5 (and (and .cse17 (or (and .cse18 .cse2 .cse0 .cse1) (and .cse19 .cse0 .cse1 .cse2)) .cse24) .cse14 .cse15 .cse16 .cse20 .cse21 .cse22)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (<= 0 ~a_t~0)) (.cse13 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse10 (<= ~c_req_type~0 1)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse3 .cse5) (and .cse6 .cse4 .cse7 .cse8 .cse9 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse8 .cse9 .cse13 (and (and .cse14 .cse15 .cse16 (and .cse17 (or (and .cse18 .cse2 .cse1) (and .cse19 .cse1 .cse2))) .cse20 .cse21 .cse22) .cse3 .cse10 .cse11 .cse12 .cse23 .cse24)))))) [2018-12-31 10:26:24,257 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 119) no Hoare annotation was computed. [2018-12-31 10:26:24,257 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1090) no Hoare annotation was computed. [2018-12-31 10:26:24,257 INFO L444 ceAbstractionStarter]: At program point L96(lines 91 833) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (= ~c_empty_rsp~0 1)) [2018-12-31 10:26:24,257 INFO L444 ceAbstractionStarter]: At program point L427(lines 420 446) the Hoare annotation is: (let ((.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~s_run_st~0)) (.cse0 (<= 2 ~s_run_pc~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~m_run_pc~0 3) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse3 .cse4 (not (= ~s_run_pc~0 2)) .cse1) .cse2 .cse0))) [2018-12-31 10:26:24,257 INFO L448 ceAbstractionStarter]: For program point L1286(lines 1286 1290) no Hoare annotation was computed. [2018-12-31 10:26:24,257 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 233) no Hoare annotation was computed. [2018-12-31 10:26:24,257 INFO L448 ceAbstractionStarter]: For program point L956(lines 956 960) no Hoare annotation was computed. [2018-12-31 10:26:24,257 INFO L444 ceAbstractionStarter]: At program point L164(lines 134 165) the Hoare annotation is: (let ((.cse9 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse0 (= ~s_run_pc~0 0)) (.cse11 (<= 0 ~a_t~0)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse12 (= 0 ~c_req_type~0)) (.cse10 (= 0 ~c_req_a~0)) (.cse1 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse16 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse5 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse17 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse14 (= ~s_run_pc~0 2)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (<= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ULTIMATE.start_m_run_~a~0) .cse8) (and .cse9 .cse10 .cse11 .cse12 (and (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7 .cse8) .cse15 .cse5) .cse16 .cse17) (and .cse9 .cse0 .cse11 .cse2 .cse3 .cse12 .cse7 .cse10 .cse1 .cse13 .cse15 .cse16 .cse5 .cse6 .cse17 .cse8) (and .cse4 (<= 2 ~s_run_pc~0) (and (not .cse14) .cse7 .cse6)))) [2018-12-31 10:26:24,261 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 118) no Hoare annotation was computed. [2018-12-31 10:26:24,261 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1076) no Hoare annotation was computed. [2018-12-31 10:26:24,262 INFO L444 ceAbstractionStarter]: At program point L561(lines 554 607) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 2))) (let ((.cse4 (<= 2 ~s_run_pc~0)) (.cse1 (not .cse5)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 (<= 3 ~m_run_pc~0)) .cse4) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse4 .cse1 .cse2 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= 0 ~c_req_type~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ULTIMATE.start_m_run_~req_type___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_s_run_~req_a~1 0) (and (and (= ~m_run_pc~0 3) .cse2 .cse3) .cse0 (<= 1 ~c_m_lock~0) .cse5) (= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2018-12-31 10:26:24,262 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2018-12-31 10:26:24,262 INFO L444 ceAbstractionStarter]: At program point L99(lines 91 833) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (= ~c_empty_rsp~0 1)) [2018-12-31 10:26:24,262 INFO L448 ceAbstractionStarter]: For program point L1024(lines 1024 1028) no Hoare annotation was computed. [2018-12-31 10:26:24,262 INFO L444 ceAbstractionStarter]: At program point L628-2(lines 628 656) the Hoare annotation is: (let ((.cse15 (= ~c_empty_rsp~0 1)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse11 (= 0 ~c_req_a~0)) (.cse8 (<= 0 ~a_t~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse22 (and .cse15 .cse14)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (= 0 ~c_req_type~0))) (let ((.cse0 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse16 (and (and .cse11 (and .cse8 (and .cse12 .cse4 .cse5 .cse22) .cse6)) .cse1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse17 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse18 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse13 (= ~req_tt_a~0 0)) (.cse19 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse20 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse9 (= ~m_run_pc~0 6))) (or (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~s_memory0~0 50) .cse9 .cse10 .cse11 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse14) (and .cse3 (<= 2 ~s_run_pc~0) (and .cse14 (not .cse5) .cse15)) (and .cse0 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse7 .cse17 .cse18 .cse19 .cse20 .cse10 .cse21) (and .cse0 .cse16 .cse7 .cse17 .cse18 .cse13 .cse19 .cse20 .cse10 .cse21) (and (and .cse4 (and .cse12 .cse3 .cse5 .cse22)) .cse8 .cse6) (and .cse8 .cse12 (and .cse2 .cse14 .cse15) .cse3 .cse5 .cse6 .cse9))))) [2018-12-31 10:26:24,270 INFO L444 ceAbstractionStarter]: At program point L761(lines 754 798) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,270 INFO L444 ceAbstractionStarter]: At program point L695(lines 688 714) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2018-12-31 10:26:24,270 INFO L448 ceAbstractionStarter]: For program point L629(lines 628 656) no Hoare annotation was computed. [2018-12-31 10:26:24,270 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 567) no Hoare annotation was computed. [2018-12-31 10:26:24,270 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 117) no Hoare annotation was computed. [2018-12-31 10:26:24,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:26:24 BoogieIcfgContainer [2018-12-31 10:26:24,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:26:24,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:26:24,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:26:24,465 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:26:24,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:24:25" (3/4) ... [2018-12-31 10:26:24,470 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 10:26:24,510 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 10:26:24,511 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 10:26:24,556 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) [2018-12-31 10:26:24,556 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) [2018-12-31 10:26:24,557 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && (((((2 <= c_write_req_ev && 2 <= s_run_st) && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && ((((((0 == c_req_a && 0 <= a_t) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 50 == rsp_d)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) [2018-12-31 10:26:24,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) [2018-12-31 10:26:24,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) [2018-12-31 10:26:24,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) [2018-12-31 10:26:24,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((req_type == 0 && ((((0 == c_req_a && 0 <= a_t) && (((2 <= s_run_st && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= v) && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((0 <= a_t && (2 <= c_write_req_ev && ((c_empty_req == 1 && 2 <= s_run_st) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a) && m_run_pc == 6)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) [2018-12-31 10:26:24,559 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) [2018-12-31 10:26:24,559 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) [2018-12-31 10:26:24,560 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((2 <= c_write_req_ev && (c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50) || ((c_req_d <= 50 && 50 <= c_req_d) && ((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && ((((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (s_run_pc == 0 && (((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1))) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && 0 <= a_t) && 0 == req_a) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((2 <= c_write_req_ev && 0 <= a_t) && 0 == c_req_type) && (((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) [2018-12-31 10:26:24,561 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == c_req_a) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && (0 <= a_t && ((2 <= c_write_req_ev && ((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && ((s_run_pc == 0 && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) || ((((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc))) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) [2018-12-31 10:26:24,562 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 <= a_t && 2 <= c_write_req_ev) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 6) || ((0 <= a_t && 1 <= c_m_lock && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 6)) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev)) || ((2 <= s_run_st && 2 <= s_run_pc) && ((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1)) || (((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 == c_req_type) && s_memory0 == req_d) && 50 <= req_d) && m_run_pc == 6) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_a == 0) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && req_d <= 50) [2018-12-31 10:26:24,564 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) [2018-12-31 10:26:24,564 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) [2018-12-31 10:26:24,564 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) [2018-12-31 10:26:24,565 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && ((((((0 == c_req_a && 0 <= a_t) && 0 == req_a) && ((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && (2 <= c_write_req_ev && 1 <= c_m_lock) && (((c_empty_req == 1 && m_run_pc == 3) && 2 <= s_run_pc) || (s_run_pc == 0 && c_empty_req == 1 && m_run_pc == 3))) && 0 <= a) && 50 <= req_d) && req_d <= 50) [2018-12-31 10:26:24,565 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) [2018-12-31 10:26:24,565 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) [2018-12-31 10:26:24,567 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((50 <= v && 50 == \result) && 0 == c_req_type) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && v <= 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 <= c_write_rsp_ev) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && a == 0) && (0 == c_req_a && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && 0 == c_req_type) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || (((((((((50 <= v && (0 == c_req_a && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && 0 == c_req_type) && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || (((1 <= c_m_lock && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a_t) && 0 <= a)) || ((((((0 <= a_t && 2 <= c_write_req_ev) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 0 <= a) && m_run_pc == 6) [2018-12-31 10:26:24,568 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,569 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == i) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,570 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,570 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,576 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,576 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,576 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,576 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,576 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,577 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,577 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,577 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,577 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,577 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,578 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2018-12-31 10:26:24,791 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:26:24,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:26:24,795 INFO L168 Benchmark]: Toolchain (without parser) took 121966.90 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 952.7 MB in the beginning and 1.8 GB in the end (delta: -828.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-31 10:26:24,798 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:26:24,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-31 10:26:24,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 180.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-31 10:26:24,801 INFO L168 Benchmark]: Boogie Preprocessor took 74.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:26:24,801 INFO L168 Benchmark]: RCFGBuilder took 2250.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.4 MB). Peak memory consumption was 79.4 MB. Max. memory is 11.5 GB. [2018-12-31 10:26:24,801 INFO L168 Benchmark]: TraceAbstraction took 118495.45 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -742.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-12-31 10:26:24,801 INFO L168 Benchmark]: Witness Printer took 328.03 ms. Allocated memory is still 3.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-31 10:26:24,813 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 631.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 180.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2250.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.4 MB). Peak memory consumption was 79.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 118495.45 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -742.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 328.03 ms. Allocated memory is still 3.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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 5 specifications checked. All of them hold - InvariantResult [Line: 925]: Loop Invariant Derived loop invariant: (((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && ((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && ((s_run_pc == 0 && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (2 <= s_run_pc && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || ((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && (((((((c_req_a <= 0 && 0 <= c_req_a) && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((50 <= v && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && 0 <= a_t) && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: (((((2 <= s_run_st && (((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= s_run_pc) || ((0 <= a_t && (((((m_run_pc == 3 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a)) || (((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a)) || (((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && ((2 <= s_run_st && (((c_empty_req == 1 && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && s_run_pc == 2) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && req_a == 0) && 0 <= a) && req_d <= 50)) || ((((((0 <= a_t && 2 <= c_write_req_ev) && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((req_d <= 50 && s_run_pc == 0) && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a) || ((((((((((((((((req_d <= 50 && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= req_d) && 1 <= req_type) && 0 == a) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((s_run_pc == 0 && a <= 0) && m_run_pc <= 0) && req_a <= 0) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a)) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: ((((((((((((((s_run_pc == 0 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a)) || ((((((((((((((((((req_d <= 50 && s_run_pc == 0) && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && 0 <= a_t) && c_req_type <= 1) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && 0 <= a_t) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: ((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((2 <= c_write_req_ev && (c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50) || ((c_req_d <= 50 && 50 <= c_req_d) && ((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && ((((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (s_run_pc == 0 && (((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1))) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && 0 <= a_t) && 0 == req_a) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((2 <= c_write_req_ev && 0 <= a_t) && 0 == c_req_type) && (((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 570]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && 0 == c_req_type) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && req_a == 0) && (((((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == a) && req_d <= 50) - InvariantResult [Line: 1341]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && 0 == c_req_type) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && req_a == 0) && (((((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == a) && req_d <= 50) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && (((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= s_run_pc) || ((((((0 <= a_t && 2 <= c_write_req_ev) && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 0 <= a) && m_run_pc == 6)) || ((0 <= a_t && (((((m_run_pc == 3 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 0 <= a) - InvariantResult [Line: 1269]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) - InvariantResult [Line: 746]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s_run_pc == 0 && a <= 0) && c_empty_req == 1) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a) || ((((((req_d <= 50 && 0 == c_req_a) && 0 <= a_t) && 0 == c_req_type) && (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= req_a) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && 0 == a)) || (((((((((((((((req_d <= 50 && s_run_pc == 0) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_type <= 1) && 50 <= req_d) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 1277]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 955]: Loop Invariant Derived loop invariant: (((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && ((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && ((s_run_pc == 0 && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (2 <= s_run_pc && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || ((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && (((((((c_req_a <= 0 && 0 <= c_req_a) && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((50 <= v && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && 0 <= a_t) && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 933]: Loop Invariant Derived loop invariant: (((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && ((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && ((s_run_pc == 0 && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (2 <= s_run_pc && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || ((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && (((((((c_req_a <= 0 && 0 <= c_req_a) && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((50 <= v && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && 0 <= a_t) && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && 2 <= s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 608]: Loop Invariant Derived loop invariant: ((0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && 0 == c_req_type) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && req_a == 0) && (((((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == a) && req_d <= 50) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc) || ((s_run_pc == 0 && 2 <= s_run_st) && (((((((1 <= c_req_type && ((((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (((m_run_pc == 3 && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && c_req_a <= 0) && a <= 0) && 0 <= c_req_a) && req_a <= 0) && 0 <= a) && 0 <= req_a)) || (((((((((req_d <= 50 && s_run_pc == 0) && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((((1 <= c_req_type && ((((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (((m_run_pc == 3 && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && c_req_a <= 0) && a <= 0) && 0 <= c_req_a) && req_a <= 0) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || (((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && 50 <= req_d) && (((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && 1 <= c_req_type && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && req_a <= 0) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((0 <= a_t && 2 <= c_write_req_ev) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 6) || ((0 <= a_t && 1 <= c_m_lock && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 6)) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev)) || ((2 <= s_run_st && 2 <= s_run_pc) && ((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1)) || (((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 == c_req_type) && s_memory0 == req_d) && 50 <= req_d) && m_run_pc == 6) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_a == 0) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && req_d <= 50) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 1307]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((req_type == 0 && ((((0 == c_req_a && 0 <= a_t) && (((2 <= s_run_st && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= v) && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((0 <= a_t && (2 <= c_write_req_ev && ((c_empty_req == 1 && 2 <= s_run_st) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a) && m_run_pc == 6)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) - InvariantResult [Line: 1285]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) - InvariantResult [Line: 762]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc) || ((s_run_pc == 0 && 2 <= s_run_st) && (((((((1 <= c_req_type && ((((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (((m_run_pc == 3 && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && c_req_a <= 0) && a <= 0) && 0 <= c_req_a) && req_a <= 0) && 0 <= a) && 0 <= req_a)) || (((((((((req_d <= 50 && s_run_pc == 0) && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((((1 <= c_req_type && ((((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (((m_run_pc == 3 && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && c_req_a <= 0) && a <= 0) && 0 <= c_req_a) && req_a <= 0) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || (((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && 50 <= req_d) && (((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && 1 <= c_req_type && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && req_a <= 0) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((s_run_pc == 0 && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) || (((((((((req_d <= 50 && s_run_pc == 0) && c_req_d <= 50) && 50 <= c_req_d) && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a) && 0 <= a_t) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || ((2 <= s_run_st && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && s_run_pc == 2) - InvariantResult [Line: 696]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 770]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc) || ((s_run_pc == 0 && 2 <= s_run_st) && (((((((1 <= c_req_type && ((((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (((m_run_pc == 3 && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && c_req_a <= 0) && a <= 0) && 0 <= c_req_a) && req_a <= 0) && 0 <= a) && 0 <= req_a)) || (((((((((req_d <= 50 && s_run_pc == 0) && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((((1 <= c_req_type && ((((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (((m_run_pc == 3 && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && c_req_a <= 0) && a <= 0) && 0 <= c_req_a) && req_a <= 0) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || (((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && 50 <= req_d) && (((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && 1 <= c_req_type && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && req_a <= 0) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) - InvariantResult [Line: 1172]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && 2 <= s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) - InvariantResult [Line: 518]: Loop Invariant Derived loop invariant: (((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((0 <= a_t && req_a == i) && s_memory0 == req_d) && (((2 <= c_write_req_ev && 2 <= s_run_st) && ((c_empty_req == 1 && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= req_d) && 0 == req_a___0) && 0 == req_type___0) && c_req_d <= 50) && 50 <= c_req_d) && req_a == 0) && v == req_d) && 0 == a) && req_d <= 50)) || ((2 <= s_run_st && ((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_pc) - InvariantResult [Line: 1180]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && 2 <= s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: (((((a <= 0 && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a) && 2 <= s_run_st) && 2 <= s_run_pc) || ((2 <= s_run_st && 2 <= s_run_pc) && ((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1)) || ((((((((((((0 <= a_t && req_a == i) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && 0 == req_type___0) && c_req_d <= 50) && 50 <= c_req_d) && req_a == 0) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (((c_empty_req == 1 && m_run_pc == 3) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && v == req_d) && 0 == a) && req_d <= 50) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == i) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1 - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= v && 50 == \result) && 0 == c_req_type) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && v <= 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 <= c_write_rsp_ev) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && a == 0) && (0 == c_req_a && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && 0 == c_req_type) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || (((((((((50 <= v && (0 == c_req_a && (0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && 0 == c_req_type) && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || (((1 <= c_m_lock && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a_t) && 0 <= a)) || ((((((0 <= a_t && 2 <= c_write_req_ev) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && 0 <= a) && m_run_pc == 6) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1 - InvariantResult [Line: 800]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 == a) || ((((((((((s_run_pc == 0 && c_req_a <= 0) && a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 == a)) || ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && 2 <= s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((s_run_pc == 0 && a <= 0) && m_run_pc <= 0) && req_a <= 0) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 2 <= s_run_st) && 1 <= req_type) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a) || (((((((((((((((((req_d <= 50 && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a)) || ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((((((req_d <= 50 && s_run_pc == 0) && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a) - InvariantResult [Line: 1031]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((c_req_d <= 50 && 50 <= c_req_d) && 0 <= a_t) && (((((c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && 50 <= v) && v <= 50) && 0 <= a_t) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((m_run_pc == 3 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || (((((((s_run_pc == 0 && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && c_req_type <= 1) && 1 <= c_m_lock) && (((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((s_run_pc == 0 && 2 <= s_run_st) && (((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == c_req_a) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && (0 <= a_t && ((2 <= c_write_req_ev && ((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && ((s_run_pc == 0 && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) || ((((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc))) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((s_run_pc == 0 && a <= 0) && c_empty_req == 1) && m_run_pc <= 0) && req_a <= 0) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || (((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a)) || ((((((((((((((((req_d <= 50 && s_run_pc == 0) && m_run_pc <= 0) && req_a <= 0) && 0 <= a_t) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) || ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && 2 <= s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && (0 <= a_t && ((((((s_run_pc == 0 && ((((c_empty_req == 1 && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || ((((((c_empty_req == 1 && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) && 1 <= c_req_type) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == 0) && (0 <= a_t && ((((((((c_empty_req == 1 && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && i == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 1188]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == i) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && 2 <= s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 1103]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (((((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && (((2 <= c_write_req_ev && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (1 <= c_req_type && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && (c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a) && 50 <= c_req_d)) || ((((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((2 <= s_run_st && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && 50 <= v) && v <= 50) && 0 <= a_t) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && 2 <= s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 1196]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 428]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && 2 <= s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 1157]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 1226]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 1204]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && ((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && ((s_run_pc == 0 && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (2 <= s_run_pc && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || ((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && (((((((c_req_a <= 0 && 0 <= c_req_a) && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((50 <= v && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && 0 <= a_t) && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && (((((2 <= c_write_req_ev && 2 <= s_run_st) && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && ((((((0 == c_req_a && 0 <= a_t) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 50 == rsp_d)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) - InvariantResult [Line: 909]: Loop Invariant Derived loop invariant: (((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && ((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && ((s_run_pc == 0 && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (2 <= s_run_pc && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || ((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && (((((((c_req_a <= 0 && 0 <= c_req_a) && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((50 <= v && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && 0 <= a_t) && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) - InvariantResult [Line: 868]: Loop Invariant Derived loop invariant: (((c_req_d <= 50 && 50 <= c_req_d) && ((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && ((((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (s_run_pc == 0 && (((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1))) && 0 <= a_t) && 0 <= a) || ((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && (((2 <= c_write_req_ev && ((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || (((((50 <= v && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && (((((((0 == c_req_a && 0 <= a_t) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 0 == req_a___0) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && ((((((0 == c_req_a && 0 <= a_t) && 0 == req_a) && ((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && (2 <= c_write_req_ev && 1 <= c_m_lock) && (((c_empty_req == 1 && m_run_pc == 3) && 2 <= s_run_pc) || (s_run_pc == 0 && c_empty_req == 1 && m_run_pc == 3))) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && ((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_pc) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && 0 == c_req_type) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && req_a == 0) && ((((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == a) && req_d <= 50) - InvariantResult [Line: 1055]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a_t) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1 && m_run_pc == 3) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && 0 == c_req_type) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && req_a == 0) && ((2 <= s_run_st && 1 <= c_m_lock) && s_run_pc == 2) && (m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 == a) && req_d <= 50) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: (((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((((((0 <= a_t && req_a == i) && s_memory0 == req_d) && (((((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= req_d) && 0 == req_a___0) && 0 == req_type___0) && c_req_d <= 50) && 50 <= c_req_d) && req_a == 0) && v == req_d) && 0 == a) && req_d <= 50) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: ((((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((0 <= a_t && req_a == i) && s_memory0 == req_d) && 50 <= req_d) && 0 == req_a___0) && 0 == req_type___0) && c_req_d <= 50) && 50 <= c_req_d) && req_a == 0) && v == req_d) && 0 == a) && (((((c_empty_req == 1 && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && req_d <= 50) - InvariantResult [Line: 1253]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((2 <= s_run_st && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((s_run_pc == 0 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a)) || ((((((((((((((((((req_d <= 50 && s_run_pc == 0) && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && 0 <= a_t) && c_req_type <= 1) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a) && 0 <= req_a) - InvariantResult [Line: 737]: Loop Invariant Derived loop invariant: (((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 664]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 1261]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= c_m_lock) && 0 <= a) && m_run_pc == 6) || ((((((((s_run_pc == 0 && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((s_run_pc == 0 && 2 <= s_run_st) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && s_memory0 == req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a == 0) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (req_type == 0 && ((((0 == c_req_a && (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || (((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (c_req_a <= 0 && 0 <= c_req_a) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 0 <= a)) || (((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && req_tt_a == 0) && s_memory0 == req_d) && ((((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a_t) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && (0 <= a_t && (((s_run_pc == 0 && 2 <= c_write_req_ev) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && (((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_m_lock) && 0 <= a) && 50 <= c_req_d) - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: (((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && ((((2 <= c_write_req_ev && 1 <= req_type) && c_req_type <= 1) && ((s_run_pc == 0 && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (2 <= s_run_pc && ((c_req_a <= 0 && 0 <= c_req_a) && req_a == 0) && ((((1 <= c_req_type && c_empty_req == 1) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || ((((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && (((((((c_req_a <= 0 && 0 <= c_req_a) && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || (((((50 <= v && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((((0 == c_req_a && 0 <= a_t) && ((((c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && 0 == req_a___0) - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: ((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: ((2 <= s_run_pc && ((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && (((2 <= c_write_req_ev && ((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || (((((50 <= v && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && (((((((0 == c_req_a && 0 <= a_t) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6) && 0 == c_req_type) && 0 == req_a___0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 270 locations, 5 error locations. SAFE Result, 118.2s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 29.2s AutomataDifference, 0.0s DeadEndRemovalTime, 74.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 13558 SDtfs, 16198 SDslu, 22573 SDs, 0 SdLazy, 2233 SolverSat, 467 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 297 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9345occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 53162 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 1161 NumberOfFragments, 15139 HoareAnnotationTreeSize, 98 FomulaSimplifications, 11629394 FormulaSimplificationTreeSizeReduction, 18.6s HoareSimplificationTime, 98 FomulaSimplificationsInter, 2323954 FormulaSimplificationTreeSizeReductionInter, 55.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2493 NumberOfCodeBlocks, 2493 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2468 ConstructedInterpolants, 0 QuantifiedInterpolants, 929067 SizeOfPredicates, 16 NumberOfNonLiveVariables, 649 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 25 InterpolantComputations, 23 PerfectInterpolantSequences, 327/431 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...