./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/mem_slave_tlm.2_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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.2_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 7974185e330e91a4e9731c3e8d6ea997b9a774a6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:29:25,657 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:29:25,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:29:25,671 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:29:25,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:29:25,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:29:25,674 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:29:25,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:29:25,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:29:25,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:29:25,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:29:25,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:29:25,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:29:25,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:29:25,684 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:29:25,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:29:25,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:29:25,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:29:25,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:29:25,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:29:25,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:29:25,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:29:25,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:29:25,697 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:29:25,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:29:25,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:29:25,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:29:25,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:29:25,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:29:25,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:29:25,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:29:25,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:29:25,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:29:25,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:29:25,706 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:29:25,707 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:29:25,708 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:29:25,723 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:29:25,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:29:25,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:29:25,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:29:25,725 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:29:25,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:29:25,725 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:29:25,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:29:25,727 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:29:25,727 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:29:25,727 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:29:25,727 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:29:25,727 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:29:25,727 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:29:25,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:29:25,729 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:29:25,729 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:29:25,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:29:25,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:29:25,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:29:25,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:29:25,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:29:25,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:29:25,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:29:25,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:29:25,730 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:29:25,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:29:25,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:29:25,732 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 -> 7974185e330e91a4e9731c3e8d6ea997b9a774a6 [2019-01-12 15:29:25,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:29:25,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:29:25,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:29:25,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:29:25,792 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:29:25,793 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/mem_slave_tlm.2_true-unreach-call_false-termination.cil.c [2019-01-12 15:29:25,849 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c04cb3f/375d93af80004eb9a539a01bea244428/FLAG9753c32e1 [2019-01-12 15:29:26,307 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:29:26,308 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/mem_slave_tlm.2_true-unreach-call_false-termination.cil.c [2019-01-12 15:29:26,332 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c04cb3f/375d93af80004eb9a539a01bea244428/FLAG9753c32e1 [2019-01-12 15:29:26,620 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c04cb3f/375d93af80004eb9a539a01bea244428 [2019-01-12 15:29:26,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:29:26,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:29:26,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:29:26,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:29:26,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:29:26,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:29:26" (1/1) ... [2019-01-12 15:29:26,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3d2060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:26, skipping insertion in model container [2019-01-12 15:29:26,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:29:26" (1/1) ... [2019-01-12 15:29:26,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:29:26,699 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:29:27,045 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:29:27,056 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:29:27,166 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:29:27,209 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:29:27,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27 WrapperNode [2019-01-12 15:29:27,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:29:27,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:29:27,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:29:27,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:29:27,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (1/1) ... [2019-01-12 15:29:27,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (1/1) ... [2019-01-12 15:29:27,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:29:27,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:29:27,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:29:27,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:29:27,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (1/1) ... [2019-01-12 15:29:27,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (1/1) ... [2019-01-12 15:29:27,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (1/1) ... [2019-01-12 15:29:27,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (1/1) ... [2019-01-12 15:29:27,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (1/1) ... [2019-01-12 15:29:27,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (1/1) ... [2019-01-12 15:29:27,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (1/1) ... [2019-01-12 15:29:27,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:29:27,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:29:27,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:29:27,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:29:27,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (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 [2019-01-12 15:29:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:29:27,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:29:29,529 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:29:29,530 INFO L286 CfgBuilder]: Removed 39 assue(true) statements. [2019-01-12 15:29:29,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:29:29 BoogieIcfgContainer [2019-01-12 15:29:29,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:29:29,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:29:29,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:29:29,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:29:29,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:29:26" (1/3) ... [2019-01-12 15:29:29,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b92d9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:29:29, skipping insertion in model container [2019-01-12 15:29:29,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:27" (2/3) ... [2019-01-12 15:29:29,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b92d9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:29:29, skipping insertion in model container [2019-01-12 15:29:29,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:29:29" (3/3) ... [2019-01-12 15:29:29,540 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2_true-unreach-call_false-termination.cil.c [2019-01-12 15:29:29,549 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:29:29,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-12 15:29:29,574 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-12 15:29:29,609 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:29:29,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:29:29,610 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:29:29,610 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:29:29,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:29:29,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:29:29,611 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:29:29,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:29:29,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:29:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states. [2019-01-12 15:29:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 15:29:29,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:29,650 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] [2019-01-12 15:29:29,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:29,660 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2019-01-12 15:29:29,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:29,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:29,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:29,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:29,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:29,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:29,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:29,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:29,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:29,875 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 3 states. [2019-01-12 15:29:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:30,719 INFO L93 Difference]: Finished difference Result 725 states and 1316 transitions. [2019-01-12 15:29:30,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:30,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-12 15:29:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:30,746 INFO L225 Difference]: With dead ends: 725 [2019-01-12 15:29:30,746 INFO L226 Difference]: Without dead ends: 450 [2019-01-12 15:29:30,751 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 [2019-01-12 15:29:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-01-12 15:29:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 434. [2019-01-12 15:29:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-01-12 15:29:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 681 transitions. [2019-01-12 15:29:30,835 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 681 transitions. Word has length 28 [2019-01-12 15:29:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:30,835 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 681 transitions. [2019-01-12 15:29:30,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 681 transitions. [2019-01-12 15:29:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 15:29:30,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:30,840 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] [2019-01-12 15:29:30,840 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:30,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:30,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1366485519, now seen corresponding path program 1 times [2019-01-12 15:29:30,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:30,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:30,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:30,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:30,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:30,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:30,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:30,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:30,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:30,932 INFO L87 Difference]: Start difference. First operand 434 states and 681 transitions. Second operand 3 states. [2019-01-12 15:29:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:31,570 INFO L93 Difference]: Finished difference Result 1135 states and 1805 transitions. [2019-01-12 15:29:31,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:31,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-12 15:29:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:31,577 INFO L225 Difference]: With dead ends: 1135 [2019-01-12 15:29:31,577 INFO L226 Difference]: Without dead ends: 715 [2019-01-12 15:29:31,580 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 [2019-01-12 15:29:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-01-12 15:29:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 699. [2019-01-12 15:29:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-01-12 15:29:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1128 transitions. [2019-01-12 15:29:31,660 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1128 transitions. Word has length 37 [2019-01-12 15:29:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:31,661 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 1128 transitions. [2019-01-12 15:29:31,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1128 transitions. [2019-01-12 15:29:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 15:29:31,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:31,668 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] [2019-01-12 15:29:31,669 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash -226101542, now seen corresponding path program 1 times [2019-01-12 15:29:31,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:31,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:31,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:31,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:31,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:31,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:31,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:31,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:31,761 INFO L87 Difference]: Start difference. First operand 699 states and 1128 transitions. Second operand 3 states. [2019-01-12 15:29:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:31,904 INFO L93 Difference]: Finished difference Result 1765 states and 2849 transitions. [2019-01-12 15:29:31,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:31,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-01-12 15:29:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:31,912 INFO L225 Difference]: With dead ends: 1765 [2019-01-12 15:29:31,912 INFO L226 Difference]: Without dead ends: 1091 [2019-01-12 15:29:31,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 [2019-01-12 15:29:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-01-12 15:29:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1079. [2019-01-12 15:29:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-01-12 15:29:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1738 transitions. [2019-01-12 15:29:31,970 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1738 transitions. Word has length 38 [2019-01-12 15:29:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:31,971 INFO L480 AbstractCegarLoop]: Abstraction has 1079 states and 1738 transitions. [2019-01-12 15:29:31,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1738 transitions. [2019-01-12 15:29:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 15:29:31,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:31,974 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] [2019-01-12 15:29:31,975 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:31,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash -775080850, now seen corresponding path program 1 times [2019-01-12 15:29:31,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:31,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:31,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:31,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:32,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:32,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:32,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:32,069 INFO L87 Difference]: Start difference. First operand 1079 states and 1738 transitions. Second operand 3 states. [2019-01-12 15:29:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:32,422 INFO L93 Difference]: Finished difference Result 2885 states and 4646 transitions. [2019-01-12 15:29:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:32,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-12 15:29:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:32,434 INFO L225 Difference]: With dead ends: 2885 [2019-01-12 15:29:32,435 INFO L226 Difference]: Without dead ends: 1831 [2019-01-12 15:29:32,438 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 [2019-01-12 15:29:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-01-12 15:29:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1685. [2019-01-12 15:29:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-01-12 15:29:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2676 transitions. [2019-01-12 15:29:32,522 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2676 transitions. Word has length 46 [2019-01-12 15:29:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:32,523 INFO L480 AbstractCegarLoop]: Abstraction has 1685 states and 2676 transitions. [2019-01-12 15:29:32,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2676 transitions. [2019-01-12 15:29:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 15:29:32,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:32,526 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] [2019-01-12 15:29:32,526 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:32,527 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2019-01-12 15:29:32,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:32,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:32,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:32,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:32,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:32,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:32,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:32,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:32,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:32,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:32,629 INFO L87 Difference]: Start difference. First operand 1685 states and 2676 transitions. Second operand 3 states. [2019-01-12 15:29:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:33,941 INFO L93 Difference]: Finished difference Result 4701 states and 7444 transitions. [2019-01-12 15:29:33,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:33,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-12 15:29:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:33,960 INFO L225 Difference]: With dead ends: 4701 [2019-01-12 15:29:33,961 INFO L226 Difference]: Without dead ends: 3035 [2019-01-12 15:29:33,964 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 [2019-01-12 15:29:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-01-12 15:29:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2969. [2019-01-12 15:29:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2969 states. [2019-01-12 15:29:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 4639 transitions. [2019-01-12 15:29:34,090 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 4639 transitions. Word has length 52 [2019-01-12 15:29:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:34,091 INFO L480 AbstractCegarLoop]: Abstraction has 2969 states and 4639 transitions. [2019-01-12 15:29:34,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 4639 transitions. [2019-01-12 15:29:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 15:29:34,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:34,094 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] [2019-01-12 15:29:34,095 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2019-01-12 15:29:34,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:34,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:34,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:34,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:34,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:34,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:34,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:34,186 INFO L87 Difference]: Start difference. First operand 2969 states and 4639 transitions. Second operand 3 states. [2019-01-12 15:29:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:34,566 INFO L93 Difference]: Finished difference Result 6983 states and 10862 transitions. [2019-01-12 15:29:34,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:34,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-12 15:29:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:34,589 INFO L225 Difference]: With dead ends: 6983 [2019-01-12 15:29:34,590 INFO L226 Difference]: Without dead ends: 4037 [2019-01-12 15:29:34,596 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 [2019-01-12 15:29:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2019-01-12 15:29:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 3853. [2019-01-12 15:29:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2019-01-12 15:29:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5937 transitions. [2019-01-12 15:29:34,766 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5937 transitions. Word has length 52 [2019-01-12 15:29:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:34,767 INFO L480 AbstractCegarLoop]: Abstraction has 3853 states and 5937 transitions. [2019-01-12 15:29:34,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5937 transitions. [2019-01-12 15:29:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 15:29:34,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:34,769 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] [2019-01-12 15:29:34,769 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:34,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1739823060, now seen corresponding path program 1 times [2019-01-12 15:29:34,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:34,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:34,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:34,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:34,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:34,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:34,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:34,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:34,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:34,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:34,882 INFO L87 Difference]: Start difference. First operand 3853 states and 5937 transitions. Second operand 3 states. [2019-01-12 15:29:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:38,027 INFO L93 Difference]: Finished difference Result 9269 states and 14370 transitions. [2019-01-12 15:29:38,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:38,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-12 15:29:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:38,057 INFO L225 Difference]: With dead ends: 9269 [2019-01-12 15:29:38,058 INFO L226 Difference]: Without dead ends: 5439 [2019-01-12 15:29:38,066 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 [2019-01-12 15:29:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2019-01-12 15:29:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5349. [2019-01-12 15:29:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5349 states. [2019-01-12 15:29:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5349 states to 5349 states and 8153 transitions. [2019-01-12 15:29:38,386 INFO L78 Accepts]: Start accepts. Automaton has 5349 states and 8153 transitions. Word has length 57 [2019-01-12 15:29:38,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:38,387 INFO L480 AbstractCegarLoop]: Abstraction has 5349 states and 8153 transitions. [2019-01-12 15:29:38,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5349 states and 8153 transitions. [2019-01-12 15:29:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-12 15:29:38,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:38,391 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] [2019-01-12 15:29:38,391 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash -635425216, now seen corresponding path program 1 times [2019-01-12 15:29:38,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:38,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:38,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:38,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:38,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:38,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:38,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:38,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:38,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:38,507 INFO L87 Difference]: Start difference. First operand 5349 states and 8153 transitions. Second operand 3 states. [2019-01-12 15:29:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:39,072 INFO L93 Difference]: Finished difference Result 10675 states and 16276 transitions. [2019-01-12 15:29:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:39,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-01-12 15:29:39,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:39,096 INFO L225 Difference]: With dead ends: 10675 [2019-01-12 15:29:39,096 INFO L226 Difference]: Without dead ends: 5349 [2019-01-12 15:29:39,105 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 [2019-01-12 15:29:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2019-01-12 15:29:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 5349. [2019-01-12 15:29:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5349 states. [2019-01-12 15:29:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5349 states to 5349 states and 8017 transitions. [2019-01-12 15:29:39,325 INFO L78 Accepts]: Start accepts. Automaton has 5349 states and 8017 transitions. Word has length 59 [2019-01-12 15:29:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:39,325 INFO L480 AbstractCegarLoop]: Abstraction has 5349 states and 8017 transitions. [2019-01-12 15:29:39,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 5349 states and 8017 transitions. [2019-01-12 15:29:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 15:29:39,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:39,329 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] [2019-01-12 15:29:39,329 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:39,331 INFO L82 PathProgramCache]: Analyzing trace with hash 556254941, now seen corresponding path program 1 times [2019-01-12 15:29:39,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:39,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:39,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:39,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:39,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:39,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:39,415 INFO L87 Difference]: Start difference. First operand 5349 states and 8017 transitions. Second operand 3 states. [2019-01-12 15:29:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:40,271 INFO L93 Difference]: Finished difference Result 12059 states and 18112 transitions. [2019-01-12 15:29:40,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:40,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-01-12 15:29:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:40,300 INFO L225 Difference]: With dead ends: 12059 [2019-01-12 15:29:40,301 INFO L226 Difference]: Without dead ends: 6733 [2019-01-12 15:29:40,310 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 [2019-01-12 15:29:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2019-01-12 15:29:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 5991. [2019-01-12 15:29:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5991 states. [2019-01-12 15:29:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 8803 transitions. [2019-01-12 15:29:40,571 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 8803 transitions. Word has length 60 [2019-01-12 15:29:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:40,572 INFO L480 AbstractCegarLoop]: Abstraction has 5991 states and 8803 transitions. [2019-01-12 15:29:40,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 8803 transitions. [2019-01-12 15:29:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 15:29:40,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:40,577 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] [2019-01-12 15:29:40,577 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:40,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1524089549, now seen corresponding path program 1 times [2019-01-12 15:29:40,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:40,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:40,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:40,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:40,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:40,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:29:40,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:29:40,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:29:40,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:29:40,716 INFO L87 Difference]: Start difference. First operand 5991 states and 8803 transitions. Second operand 5 states. [2019-01-12 15:29:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:43,795 INFO L93 Difference]: Finished difference Result 31245 states and 45936 transitions. [2019-01-12 15:29:43,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:29:43,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-01-12 15:29:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:43,857 INFO L225 Difference]: With dead ends: 31245 [2019-01-12 15:29:43,858 INFO L226 Difference]: Without dead ends: 25277 [2019-01-12 15:29:43,874 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 [2019-01-12 15:29:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25277 states. [2019-01-12 15:29:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25277 to 8339. [2019-01-12 15:29:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8339 states. [2019-01-12 15:29:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8339 states to 8339 states and 12256 transitions. [2019-01-12 15:29:44,685 INFO L78 Accepts]: Start accepts. Automaton has 8339 states and 12256 transitions. Word has length 62 [2019-01-12 15:29:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:44,685 INFO L480 AbstractCegarLoop]: Abstraction has 8339 states and 12256 transitions. [2019-01-12 15:29:44,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:29:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 8339 states and 12256 transitions. [2019-01-12 15:29:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:29:44,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:44,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:29:44,694 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:44,694 INFO L82 PathProgramCache]: Analyzing trace with hash 21161543, now seen corresponding path program 1 times [2019-01-12 15:29:44,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:44,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:44,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:44,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:45,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:45,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 15:29:45,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:29:45,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:29:45,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:29:45,030 INFO L87 Difference]: Start difference. First operand 8339 states and 12256 transitions. Second operand 7 states. [2019-01-12 15:29:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:48,574 INFO L93 Difference]: Finished difference Result 41373 states and 60773 transitions. [2019-01-12 15:29:48,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 15:29:48,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-01-12 15:29:48,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:48,644 INFO L225 Difference]: With dead ends: 41373 [2019-01-12 15:29:48,645 INFO L226 Difference]: Without dead ends: 33057 [2019-01-12 15:29:48,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2019-01-12 15:29:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33057 states. [2019-01-12 15:29:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33057 to 5545. [2019-01-12 15:29:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5545 states. [2019-01-12 15:29:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 8041 transitions. [2019-01-12 15:29:49,333 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 8041 transitions. Word has length 63 [2019-01-12 15:29:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:49,333 INFO L480 AbstractCegarLoop]: Abstraction has 5545 states and 8041 transitions. [2019-01-12 15:29:49,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:29:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 8041 transitions. [2019-01-12 15:29:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 15:29:49,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:49,336 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] [2019-01-12 15:29:49,336 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:49,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:49,337 INFO L82 PathProgramCache]: Analyzing trace with hash 633008800, now seen corresponding path program 1 times [2019-01-12 15:29:49,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:49,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:49,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:49,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:49,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:49,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:49,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:49,409 INFO L87 Difference]: Start difference. First operand 5545 states and 8041 transitions. Second operand 3 states. [2019-01-12 15:29:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:49,981 INFO L93 Difference]: Finished difference Result 11690 states and 16907 transitions. [2019-01-12 15:29:49,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:49,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-01-12 15:29:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:49,991 INFO L225 Difference]: With dead ends: 11690 [2019-01-12 15:29:49,992 INFO L226 Difference]: Without dead ends: 6166 [2019-01-12 15:29:50,000 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 [2019-01-12 15:29:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2019-01-12 15:29:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 6074. [2019-01-12 15:29:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6074 states. [2019-01-12 15:29:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 8769 transitions. [2019-01-12 15:29:50,700 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 8769 transitions. Word has length 77 [2019-01-12 15:29:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:50,700 INFO L480 AbstractCegarLoop]: Abstraction has 6074 states and 8769 transitions. [2019-01-12 15:29:50,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 8769 transitions. [2019-01-12 15:29:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-12 15:29:50,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:50,704 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] [2019-01-12 15:29:50,704 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash -120422989, now seen corresponding path program 1 times [2019-01-12 15:29:50,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:50,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:50,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:50,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:50,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:50,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:50,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:50,977 INFO L87 Difference]: Start difference. First operand 6074 states and 8769 transitions. Second operand 3 states. [2019-01-12 15:29:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:51,878 INFO L93 Difference]: Finished difference Result 15622 states and 22438 transitions. [2019-01-12 15:29:51,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:51,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-01-12 15:29:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:51,891 INFO L225 Difference]: With dead ends: 15622 [2019-01-12 15:29:51,892 INFO L226 Difference]: Without dead ends: 9437 [2019-01-12 15:29:51,903 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 [2019-01-12 15:29:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9437 states. [2019-01-12 15:29:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9437 to 9409. [2019-01-12 15:29:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9409 states. [2019-01-12 15:29:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 13387 transitions. [2019-01-12 15:29:52,944 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 13387 transitions. Word has length 88 [2019-01-12 15:29:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:52,944 INFO L480 AbstractCegarLoop]: Abstraction has 9409 states and 13387 transitions. [2019-01-12 15:29:52,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 13387 transitions. [2019-01-12 15:29:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:29:52,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:52,948 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] [2019-01-12 15:29:52,948 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1916611, now seen corresponding path program 1 times [2019-01-12 15:29:52,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:52,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:52,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:52,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:52,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:53,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:53,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:53,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:53,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:53,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:53,036 INFO L87 Difference]: Start difference. First operand 9409 states and 13387 transitions. Second operand 3 states. [2019-01-12 15:29:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:54,019 INFO L93 Difference]: Finished difference Result 17294 states and 24524 transitions. [2019-01-12 15:29:54,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:54,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-12 15:29:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:54,027 INFO L225 Difference]: With dead ends: 17294 [2019-01-12 15:29:54,028 INFO L226 Difference]: Without dead ends: 6922 [2019-01-12 15:29:54,038 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 [2019-01-12 15:29:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2019-01-12 15:29:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6509. [2019-01-12 15:29:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2019-01-12 15:29:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 8833 transitions. [2019-01-12 15:29:54,697 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 8833 transitions. Word has length 95 [2019-01-12 15:29:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:54,698 INFO L480 AbstractCegarLoop]: Abstraction has 6509 states and 8833 transitions. [2019-01-12 15:29:54,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 8833 transitions. [2019-01-12 15:29:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 15:29:54,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:54,699 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] [2019-01-12 15:29:54,700 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash -382912401, now seen corresponding path program 1 times [2019-01-12 15:29:54,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:54,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:54,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 15:29:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:54,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:54,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:54,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:54,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:54,792 INFO L87 Difference]: Start difference. First operand 6509 states and 8833 transitions. Second operand 3 states. [2019-01-12 15:29:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:55,249 INFO L93 Difference]: Finished difference Result 10522 states and 14348 transitions. [2019-01-12 15:29:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:55,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-12 15:29:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:55,255 INFO L225 Difference]: With dead ends: 10522 [2019-01-12 15:29:55,255 INFO L226 Difference]: Without dead ends: 4127 [2019-01-12 15:29:55,263 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 [2019-01-12 15:29:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2019-01-12 15:29:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 4109. [2019-01-12 15:29:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2019-01-12 15:29:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 5458 transitions. [2019-01-12 15:29:55,684 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 5458 transitions. Word has length 98 [2019-01-12 15:29:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:55,684 INFO L480 AbstractCegarLoop]: Abstraction has 4109 states and 5458 transitions. [2019-01-12 15:29:55,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 5458 transitions. [2019-01-12 15:29:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 15:29:55,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:55,687 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] [2019-01-12 15:29:55,687 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:55,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:55,687 INFO L82 PathProgramCache]: Analyzing trace with hash -390807016, now seen corresponding path program 1 times [2019-01-12 15:29:55,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:55,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:55,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:29:55,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:55,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:55,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:55,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:55,792 INFO L87 Difference]: Start difference. First operand 4109 states and 5458 transitions. Second operand 3 states. [2019-01-12 15:29:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:56,294 INFO L93 Difference]: Finished difference Result 7280 states and 9704 transitions. [2019-01-12 15:29:56,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:56,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-12 15:29:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:56,298 INFO L225 Difference]: With dead ends: 7280 [2019-01-12 15:29:56,299 INFO L226 Difference]: Without dead ends: 3246 [2019-01-12 15:29:56,304 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 [2019-01-12 15:29:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2019-01-12 15:29:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 2944. [2019-01-12 15:29:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-01-12 15:29:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3823 transitions. [2019-01-12 15:29:56,903 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3823 transitions. Word has length 98 [2019-01-12 15:29:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:56,903 INFO L480 AbstractCegarLoop]: Abstraction has 2944 states and 3823 transitions. [2019-01-12 15:29:56,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3823 transitions. [2019-01-12 15:29:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:29:56,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:56,907 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] [2019-01-12 15:29:56,907 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash 771669376, now seen corresponding path program 1 times [2019-01-12 15:29:56,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:56,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:56,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:56,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:29:56,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:56,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:56,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:56,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:56,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:56,989 INFO L87 Difference]: Start difference. First operand 2944 states and 3823 transitions. Second operand 3 states. [2019-01-12 15:29:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:57,781 INFO L93 Difference]: Finished difference Result 3266 states and 4207 transitions. [2019-01-12 15:29:57,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:57,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-12 15:29:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:57,788 INFO L225 Difference]: With dead ends: 3266 [2019-01-12 15:29:57,789 INFO L226 Difference]: Without dead ends: 3262 [2019-01-12 15:29:57,790 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 [2019-01-12 15:29:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2019-01-12 15:29:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3237. [2019-01-12 15:29:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3237 states. [2019-01-12 15:29:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4160 transitions. [2019-01-12 15:29:58,325 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4160 transitions. Word has length 99 [2019-01-12 15:29:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:58,326 INFO L480 AbstractCegarLoop]: Abstraction has 3237 states and 4160 transitions. [2019-01-12 15:29:58,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4160 transitions. [2019-01-12 15:29:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 15:29:58,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:58,330 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, 1] [2019-01-12 15:29:58,331 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:58,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:58,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1243765039, now seen corresponding path program 1 times [2019-01-12 15:29:58,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:58,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:58,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:58,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:58,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:58,865 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-12 15:29:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 15:29:58,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:58,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:29:58,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:29:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:29:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:29:58,907 INFO L87 Difference]: Start difference. First operand 3237 states and 4160 transitions. Second operand 5 states. [2019-01-12 15:30:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:00,294 INFO L93 Difference]: Finished difference Result 12052 states and 15568 transitions. [2019-01-12 15:30:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:30:00,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-01-12 15:30:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:00,303 INFO L225 Difference]: With dead ends: 12052 [2019-01-12 15:30:00,303 INFO L226 Difference]: Without dead ends: 9007 [2019-01-12 15:30:00,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:30:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9007 states. [2019-01-12 15:30:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9007 to 3239. [2019-01-12 15:30:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3239 states. [2019-01-12 15:30:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 4154 transitions. [2019-01-12 15:30:00,692 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 4154 transitions. Word has length 157 [2019-01-12 15:30:00,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:00,692 INFO L480 AbstractCegarLoop]: Abstraction has 3239 states and 4154 transitions. [2019-01-12 15:30:00,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:30:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4154 transitions. [2019-01-12 15:30:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 15:30:00,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:00,695 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, 1] [2019-01-12 15:30:00,695 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:00,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:00,696 INFO L82 PathProgramCache]: Analyzing trace with hash 114274644, now seen corresponding path program 1 times [2019-01-12 15:30:00,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:00,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:00,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:00,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:00,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:30:00,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:00,948 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 [2019-01-12 15:30:00,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:01,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:30:01,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:30:01,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:30:01,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:30:01,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:30:01,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:30:01,422 INFO L87 Difference]: Start difference. First operand 3239 states and 4154 transitions. Second operand 9 states. [2019-01-12 15:30:01,718 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 15:30:02,474 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 15:30:02,857 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 15:30:03,222 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 15:30:03,599 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 15:30:03,965 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 15:30:04,287 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 15:30:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:06,995 INFO L93 Difference]: Finished difference Result 17383 states and 22509 transitions. [2019-01-12 15:30:06,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 15:30:06,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 159 [2019-01-12 15:30:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:07,023 INFO L225 Difference]: With dead ends: 17383 [2019-01-12 15:30:07,023 INFO L226 Difference]: Without dead ends: 14358 [2019-01-12 15:30:07,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:30:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14358 states. [2019-01-12 15:30:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14358 to 4861. [2019-01-12 15:30:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4861 states. [2019-01-12 15:30:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4861 states to 4861 states and 6300 transitions. [2019-01-12 15:30:08,322 INFO L78 Accepts]: Start accepts. Automaton has 4861 states and 6300 transitions. Word has length 159 [2019-01-12 15:30:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:08,323 INFO L480 AbstractCegarLoop]: Abstraction has 4861 states and 6300 transitions. [2019-01-12 15:30:08,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:30:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4861 states and 6300 transitions. [2019-01-12 15:30:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-01-12 15:30:08,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:08,328 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 15:30:08,328 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:08,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1253383823, now seen corresponding path program 1 times [2019-01-12 15:30:08,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:08,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:08,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:30:08,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:08,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 15:30:08,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:30:08,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:30:08,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:30:08,649 INFO L87 Difference]: Start difference. First operand 4861 states and 6300 transitions. Second operand 7 states. [2019-01-12 15:30:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:09,841 INFO L93 Difference]: Finished difference Result 10462 states and 13562 transitions. [2019-01-12 15:30:09,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:30:09,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 257 [2019-01-12 15:30:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:09,849 INFO L225 Difference]: With dead ends: 10462 [2019-01-12 15:30:09,849 INFO L226 Difference]: Without dead ends: 5809 [2019-01-12 15:30:09,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:30:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5809 states. [2019-01-12 15:30:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5809 to 4707. [2019-01-12 15:30:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4707 states. [2019-01-12 15:30:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4707 states to 4707 states and 6094 transitions. [2019-01-12 15:30:10,576 INFO L78 Accepts]: Start accepts. Automaton has 4707 states and 6094 transitions. Word has length 257 [2019-01-12 15:30:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:10,576 INFO L480 AbstractCegarLoop]: Abstraction has 4707 states and 6094 transitions. [2019-01-12 15:30:10,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:30:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4707 states and 6094 transitions. [2019-01-12 15:30:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-01-12 15:30:10,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:10,581 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 15:30:10,581 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1467549623, now seen corresponding path program 1 times [2019-01-12 15:30:10,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:10,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:10,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:10,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:10,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-01-12 15:30:10,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:10,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:10,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:10,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:10,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:10,697 INFO L87 Difference]: Start difference. First operand 4707 states and 6094 transitions. Second operand 3 states. [2019-01-12 15:30:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:12,053 INFO L93 Difference]: Finished difference Result 10550 states and 13723 transitions. [2019-01-12 15:30:12,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:12,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-01-12 15:30:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:12,061 INFO L225 Difference]: With dead ends: 10550 [2019-01-12 15:30:12,061 INFO L226 Difference]: Without dead ends: 6057 [2019-01-12 15:30:12,065 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 [2019-01-12 15:30:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2019-01-12 15:30:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 5872. [2019-01-12 15:30:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2019-01-12 15:30:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 7429 transitions. [2019-01-12 15:30:12,851 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 7429 transitions. Word has length 257 [2019-01-12 15:30:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:12,852 INFO L480 AbstractCegarLoop]: Abstraction has 5872 states and 7429 transitions. [2019-01-12 15:30:12,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 7429 transitions. [2019-01-12 15:30:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-12 15:30:12,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:12,855 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 15:30:12,855 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:12,856 INFO L82 PathProgramCache]: Analyzing trace with hash 35825393, now seen corresponding path program 1 times [2019-01-12 15:30:12,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:12,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:12,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-01-12 15:30:12,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:12,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:12,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:12,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:12,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:12,983 INFO L87 Difference]: Start difference. First operand 5872 states and 7429 transitions. Second operand 3 states. [2019-01-12 15:30:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:13,489 INFO L93 Difference]: Finished difference Result 6789 states and 8462 transitions. [2019-01-12 15:30:13,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:13,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-01-12 15:30:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:13,491 INFO L225 Difference]: With dead ends: 6789 [2019-01-12 15:30:13,492 INFO L226 Difference]: Without dead ends: 1017 [2019-01-12 15:30:13,495 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 [2019-01-12 15:30:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-01-12 15:30:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1014. [2019-01-12 15:30:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-01-12 15:30:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1113 transitions. [2019-01-12 15:30:13,635 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1113 transitions. Word has length 258 [2019-01-12 15:30:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:13,635 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1113 transitions. [2019-01-12 15:30:13,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1113 transitions. [2019-01-12 15:30:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-01-12 15:30:13,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:13,638 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 15:30:13,638 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1838022629, now seen corresponding path program 1 times [2019-01-12 15:30:13,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:13,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:13,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:13,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:13,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-01-12 15:30:13,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:13,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 15:30:13,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:30:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:30:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:30:13,879 INFO L87 Difference]: Start difference. First operand 1014 states and 1113 transitions. Second operand 7 states. [2019-01-12 15:30:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:14,442 INFO L93 Difference]: Finished difference Result 2061 states and 2258 transitions. [2019-01-12 15:30:14,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:30:14,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2019-01-12 15:30:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:14,445 INFO L225 Difference]: With dead ends: 2061 [2019-01-12 15:30:14,445 INFO L226 Difference]: Without dead ends: 1747 [2019-01-12 15:30:14,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:30:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-01-12 15:30:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1012. [2019-01-12 15:30:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-01-12 15:30:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1107 transitions. [2019-01-12 15:30:14,596 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1107 transitions. Word has length 259 [2019-01-12 15:30:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:14,597 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1107 transitions. [2019-01-12 15:30:14,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:30:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1107 transitions. [2019-01-12 15:30:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-12 15:30:14,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:14,599 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 15:30:14,599 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:14,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1163152431, now seen corresponding path program 1 times [2019-01-12 15:30:14,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:14,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:14,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:14,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:14,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-01-12 15:30:14,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:14,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:30:14,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:30:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:30:14,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:30:14,909 INFO L87 Difference]: Start difference. First operand 1012 states and 1107 transitions. Second operand 5 states. [2019-01-12 15:30:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:15,712 INFO L93 Difference]: Finished difference Result 1582 states and 1732 transitions. [2019-01-12 15:30:15,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:30:15,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 260 [2019-01-12 15:30:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:15,715 INFO L225 Difference]: With dead ends: 1582 [2019-01-12 15:30:15,715 INFO L226 Difference]: Without dead ends: 1266 [2019-01-12 15:30:15,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:30:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2019-01-12 15:30:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 994. [2019-01-12 15:30:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-01-12 15:30:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1074 transitions. [2019-01-12 15:30:15,867 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1074 transitions. Word has length 260 [2019-01-12 15:30:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:15,868 INFO L480 AbstractCegarLoop]: Abstraction has 994 states and 1074 transitions. [2019-01-12 15:30:15,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:30:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1074 transitions. [2019-01-12 15:30:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-01-12 15:30:15,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:15,871 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 15:30:15,871 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:15,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:15,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1173960251, now seen corresponding path program 1 times [2019-01-12 15:30:15,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:15,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:15,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:15,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 15 proven. 160 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 15:30:16,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:16,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:30:16,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:16,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-01-12 15:30:17,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:30:17,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-01-12 15:30:17,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 15:30:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 15:30:17,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-01-12 15:30:17,435 INFO L87 Difference]: Start difference. First operand 994 states and 1074 transitions. Second operand 29 states. [2019-01-12 15:30:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:19,276 INFO L93 Difference]: Finished difference Result 1358 states and 1474 transitions. [2019-01-12 15:30:19,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-12 15:30:19,277 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 318 [2019-01-12 15:30:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:19,280 INFO L225 Difference]: With dead ends: 1358 [2019-01-12 15:30:19,280 INFO L226 Difference]: Without dead ends: 1356 [2019-01-12 15:30:19,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 315 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=385, Invalid=2267, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 15:30:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-01-12 15:30:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 994. [2019-01-12 15:30:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-01-12 15:30:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1073 transitions. [2019-01-12 15:30:19,443 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1073 transitions. Word has length 318 [2019-01-12 15:30:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:19,444 INFO L480 AbstractCegarLoop]: Abstraction has 994 states and 1073 transitions. [2019-01-12 15:30:19,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 15:30:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1073 transitions. [2019-01-12 15:30:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-12 15:30:19,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:19,447 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 15:30:19,447 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:19,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1814260282, now seen corresponding path program 1 times [2019-01-12 15:30:19,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:19,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:19,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:19,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:19,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:19,772 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2019-01-12 15:30:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 119 proven. 82 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-12 15:30:20,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:20,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:30:20,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:20,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:30:20,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:30:20,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2019-01-12 15:30:20,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:30:20,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:30:20,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:30:20,310 INFO L87 Difference]: Start difference. First operand 994 states and 1073 transitions. Second operand 11 states. [2019-01-12 15:30:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:21,334 INFO L93 Difference]: Finished difference Result 1369 states and 1481 transitions. [2019-01-12 15:30:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 15:30:21,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 364 [2019-01-12 15:30:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:21,337 INFO L225 Difference]: With dead ends: 1369 [2019-01-12 15:30:21,337 INFO L226 Difference]: Without dead ends: 1267 [2019-01-12 15:30:21,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2019-01-12 15:30:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-01-12 15:30:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 992. [2019-01-12 15:30:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-01-12 15:30:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1068 transitions. [2019-01-12 15:30:21,517 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1068 transitions. Word has length 364 [2019-01-12 15:30:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:21,517 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1068 transitions. [2019-01-12 15:30:21,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:30:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1068 transitions. [2019-01-12 15:30:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-01-12 15:30:21,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:21,520 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 15:30:21,520 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash -73771068, now seen corresponding path program 1 times [2019-01-12 15:30:21,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:21,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:21,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:22,240 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-12 15:30:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 23 proven. 398 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 15:30:22,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:22,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:30:22,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:22,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 88 proven. 330 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:30:23,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:30:23,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 37 [2019-01-12 15:30:23,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-12 15:30:23,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-12 15:30:23,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 15:30:23,691 INFO L87 Difference]: Start difference. First operand 992 states and 1068 transitions. Second operand 37 states. [2019-01-12 15:30:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:26,055 INFO L93 Difference]: Finished difference Result 1267 states and 1369 transitions. [2019-01-12 15:30:26,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-12 15:30:26,056 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 424 [2019-01-12 15:30:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:26,057 INFO L225 Difference]: With dead ends: 1267 [2019-01-12 15:30:26,058 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:30:26,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=575, Invalid=4681, Unknown=0, NotChecked=0, Total=5256 [2019-01-12 15:30:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:30:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:30:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:30:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:30:26,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 424 [2019-01-12 15:30:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:26,064 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:30:26,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-12 15:30:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:30:26,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:30:26,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:30:26,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:26,704 WARN L181 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 296 [2019-01-12 15:30:26,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:26,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,099 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 264 [2019-01-12 15:30:27,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:27,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,018 WARN L181 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 319 [2019-01-12 15:30:28,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,167 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 176 [2019-01-12 15:30:28,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:28,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,127 WARN L181 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 344 [2019-01-12 15:30:29,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,346 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 179 [2019-01-12 15:30:29,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,715 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 174 [2019-01-12 15:30:29,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:29,987 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 217 [2019-01-12 15:30:30,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:30,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,350 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 720 DAG size of output: 467 [2019-01-12 15:30:31,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:31,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,669 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 720 DAG size of output: 481 [2019-01-12 15:30:32,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:32,991 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 296 [2019-01-12 15:30:33,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,173 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 327 DAG size of output: 219 [2019-01-12 15:30:33,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,347 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 252 [2019-01-12 15:30:33,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,549 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 296 [2019-01-12 15:30:33,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,826 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 435 DAG size of output: 256 [2019-01-12 15:30:33,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:33,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,871 WARN L181 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 505 DAG size of output: 443 [2019-01-12 15:30:34,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:34,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,287 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 163 [2019-01-12 15:30:35,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:35,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,443 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 720 DAG size of output: 467 [2019-01-12 15:30:36,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:36,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,607 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 724 DAG size of output: 471 [2019-01-12 15:30:37,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,727 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 129 [2019-01-12 15:30:37,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:37,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,007 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 296 [2019-01-12 15:30:38,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,216 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 296 [2019-01-12 15:30:38,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,551 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 202 [2019-01-12 15:30:38,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:38,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:39,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:40,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:41,863 WARN L181 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 1316 DAG size of output: 842 [2019-01-12 15:30:42,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:42,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,615 WARN L181 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 960 DAG size of output: 561 [2019-01-12 15:30:43,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:43,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,719 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 724 DAG size of output: 471 [2019-01-12 15:30:44,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:44,999 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 217 [2019-01-12 15:30:45,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,258 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 202 [2019-01-12 15:30:45,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,395 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 201 [2019-01-12 15:30:45,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:45,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,647 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 720 DAG size of output: 467 [2019-01-12 15:30:46,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:46,967 WARN L181 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 374 DAG size of output: 306 [2019-01-12 15:30:46,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,477 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 344 [2019-01-12 15:30:47,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:47,981 WARN L181 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 344 [2019-01-12 15:30:48,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,485 WARN L181 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 424 DAG size of output: 359 [2019-01-12 15:30:48,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,974 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 140 [2019-01-12 15:30:48,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:48,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,161 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 213 [2019-01-12 15:30:49,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,307 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 180 [2019-01-12 15:30:49,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,862 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 344 [2019-01-12 15:30:49,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:49,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,061 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 229 [2019-01-12 15:30:50,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,554 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 344 [2019-01-12 15:30:50,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,739 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 296 [2019-01-12 15:30:50,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:50,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:51,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:52,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:30:53,207 WARN L181 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 1187 DAG size of output: 767 [2019-01-12 15:30:53,640 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-01-12 15:30:55,627 WARN L181 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 287 DAG size of output: 108 [2019-01-12 15:30:57,025 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 252 DAG size of output: 91 [2019-01-12 15:30:59,247 WARN L181 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 312 DAG size of output: 107 [2019-01-12 15:30:59,880 WARN L181 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 83 [2019-01-12 15:31:02,239 WARN L181 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 339 DAG size of output: 116 [2019-01-12 15:31:02,785 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 79 [2019-01-12 15:31:03,434 WARN L181 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 87 [2019-01-12 15:31:04,227 WARN L181 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 86 [2019-01-12 15:31:08,598 WARN L181 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 455 DAG size of output: 163 [2019-01-12 15:31:08,994 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 76 [2019-01-12 15:31:13,413 WARN L181 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 468 DAG size of output: 163 [2019-01-12 15:31:13,788 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-01-12 15:31:15,574 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 287 DAG size of output: 108 [2019-01-12 15:31:15,936 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2019-01-12 15:31:17,104 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 199 DAG size of output: 78 [2019-01-12 15:31:18,401 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 244 DAG size of output: 85 [2019-01-12 15:31:18,781 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-01-12 15:31:20,558 WARN L181 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 287 DAG size of output: 108 [2019-01-12 15:31:21,455 WARN L181 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 93 [2019-01-12 15:31:21,761 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 63 [2019-01-12 15:31:25,993 WARN L181 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 428 DAG size of output: 128 [2019-01-12 15:31:26,221 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-01-12 15:31:26,905 WARN L181 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 83 [2019-01-12 15:31:27,831 WARN L181 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 76 [2019-01-12 15:31:28,067 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-01-12 15:31:28,754 WARN L181 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 83 [2019-01-12 15:31:28,984 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-01-12 15:31:29,472 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 74 [2019-01-12 15:31:33,965 WARN L181 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 455 DAG size of output: 163 [2019-01-12 15:31:34,359 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2019-01-12 15:31:35,382 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 162 DAG size of output: 91 [2019-01-12 15:31:40,005 WARN L181 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 459 DAG size of output: 163 [2019-01-12 15:31:40,599 WARN L181 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 76 [2019-01-12 15:31:41,032 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2019-01-12 15:31:42,015 WARN L181 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 79 [2019-01-12 15:31:43,763 WARN L181 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 287 DAG size of output: 108 [2019-01-12 15:31:44,138 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-01-12 15:31:45,963 WARN L181 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 287 DAG size of output: 108 [2019-01-12 15:31:46,389 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-01-12 15:31:47,423 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 162 DAG size of output: 91 [2019-01-12 15:31:47,716 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2019-01-12 15:31:48,172 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 25 [2019-01-12 15:31:48,408 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-01-12 15:31:49,117 WARN L181 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 83 [2019-01-12 15:31:50,313 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 191 DAG size of output: 94 [2019-01-12 15:31:59,656 WARN L181 SmtUtils]: Spent 9.33 s on a formula simplification. DAG size of input: 819 DAG size of output: 163 [2019-01-12 15:31:59,876 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-01-12 15:32:00,537 WARN L181 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 73 [2019-01-12 15:32:05,322 WARN L181 SmtUtils]: Spent 4.78 s on a formula simplification. DAG size of input: 542 DAG size of output: 166 [2019-01-12 15:32:09,711 WARN L181 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 459 DAG size of output: 163 [2019-01-12 15:32:10,083 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2019-01-12 15:32:10,438 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-01-12 15:32:10,822 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2019-01-12 15:32:12,135 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 215 DAG size of output: 79 [2019-01-12 15:32:12,692 WARN L181 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 68 [2019-01-12 15:32:12,967 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2019-01-12 15:32:13,754 WARN L181 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 89 [2019-01-12 15:32:14,383 WARN L181 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 88 [2019-01-12 15:32:14,658 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2019-01-12 15:32:14,998 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-01-12 15:32:15,222 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-01-12 15:32:16,199 WARN L181 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 91 [2019-01-12 15:32:16,460 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-01-12 15:32:20,738 WARN L181 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 455 DAG size of output: 163 [2019-01-12 15:32:23,311 WARN L181 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 301 DAG size of output: 109 [2019-01-12 15:32:23,682 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2019-01-12 15:32:26,034 WARN L181 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 339 DAG size of output: 116 [2019-01-12 15:32:26,408 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2019-01-12 15:32:28,746 WARN L181 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 339 DAG size of output: 116 [2019-01-12 15:32:31,260 WARN L181 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 350 DAG size of output: 118 [2019-01-12 15:32:31,430 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 50 [2019-01-12 15:32:31,700 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2019-01-12 15:32:31,804 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-12 15:32:32,247 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2019-01-12 15:32:32,519 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2019-01-12 15:32:32,630 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-12 15:32:32,897 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2019-01-12 15:32:33,392 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 78 [2019-01-12 15:32:34,100 WARN L181 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 78 [2019-01-12 15:32:34,723 WARN L181 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 76 [2019-01-12 15:32:35,469 WARN L181 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 83 [2019-01-12 15:32:37,763 WARN L181 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 339 DAG size of output: 116 [2019-01-12 15:32:38,940 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 226 DAG size of output: 96 [2019-01-12 15:32:41,190 WARN L181 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 339 DAG size of output: 116 [2019-01-12 15:32:43,092 WARN L181 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 287 DAG size of output: 108 [2019-01-12 15:32:50,986 WARN L181 SmtUtils]: Spent 7.89 s on a formula simplification. DAG size of input: 746 DAG size of output: 165 [2019-01-12 15:32:50,994 INFO L444 ceAbstractionStarter]: At program point L432(lines 425 451) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (or (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) .cse0 (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1 (<= 0 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse6 .cse7 (not .cse4) .cse8) .cse3 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)))) [2019-01-12 15:32:50,994 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1295) no Hoare annotation was computed. [2019-01-12 15:32:50,994 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 238) no Hoare annotation was computed. [2019-01-12 15:32:50,995 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:32:50,995 INFO L448 ceAbstractionStarter]: For program point L961(lines 961 965) no Hoare annotation was computed. [2019-01-12 15:32:50,995 INFO L444 ceAbstractionStarter]: At program point L169(lines 139 170) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse18 (= ~s_run_pc~0 0)) (.cse6 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse1 (= 0 ~c_req_a~0)) (.cse16 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse17 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 2 ~s_run_st~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse9 (= ~s_run_pc~0 2)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse3 (<= 0 ~a_t~0)) (.cse15 (<= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 (and .cse3 (and (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) .cse15) .cse16 .cse17) (and .cse18 (<= ULTIMATE.start_m_run_~a~0 0) .cse4 .cse6 .cse7 .cse8 .cse14 .cse10 .cse11 (<= 0 ULTIMATE.start_m_run_~a~0) .cse12) (and .cse8 (<= 2 ~s_run_pc~0) (and (not .cse9) .cse11 .cse10)) (and .cse0 .cse18 .cse3 .cse6 .cse7 .cse2 .cse15 .cse11 .cse1 .cse4 .cse5 .cse13 .cse16 .cse14 .cse10 .cse17 .cse12) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_m_run_~req_a~0 1) (and (and .cse4 (= ~m_run_pc~0 3) .cse11 .cse10) .cse5 .cse8 .cse13 .cse9 .cse14) .cse3 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse15 (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-01-12 15:32:50,995 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 123) no Hoare annotation was computed. [2019-01-12 15:32:50,995 INFO L448 ceAbstractionStarter]: For program point L1028(lines 1028 1081) no Hoare annotation was computed. [2019-01-12 15:32:50,996 INFO L444 ceAbstractionStarter]: At program point L566(lines 559 612) the Hoare annotation is: (let ((.cse12 (= ~s_run_pc~0 2))) (let ((.cse4 (<= 2 ~s_run_pc~0)) (.cse1 (not .cse12)) (.cse5 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse7 (= 0 ~c_req_type~0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 (<= 3 ~m_run_pc~0)) .cse4) (and .cse5 .cse0 .cse4 .cse1 .cse2 .cse3 .cse6) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse7 .cse8 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= 0 ~c_req_a~0) (<= 1 ~a_t~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (and .cse5 (and .cse0 .cse11 .cse12 (and (= ~m_run_pc~0 3) .cse2 .cse3))) .cse6) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 .cse9 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_a~0 1) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and .cse0 (and .cse2 .cse3) .cse11 .cse12) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6)) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v))))) [2019-01-12 15:32:50,996 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-01-12 15:32:50,996 INFO L444 ceAbstractionStarter]: At program point L104(lines 96 838) 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)) [2019-01-12 15:32:50,996 INFO L448 ceAbstractionStarter]: For program point L1029(lines 1029 1033) no Hoare annotation was computed. [2019-01-12 15:32:50,997 INFO L444 ceAbstractionStarter]: At program point L633-2(lines 633 661) the Hoare annotation is: (let ((.cse9 (= ~c_empty_rsp~0 1)) (.cse7 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse12 (<= 2 ~c_write_req_ev~0)) (.cse21 (<= 1 ~c_m_lock~0)) (.cse8 (= ~s_run_pc~0 2)) (.cse29 (and .cse9 .cse7))) (let ((.cse31 (<= 1 ~c_req_a~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (= 0 ~c_req_type~0)) (.cse26 (<= 0 ~a_t~0)) (.cse25 (and .cse12 .cse21 .cse8 .cse29)) (.cse14 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse23 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse15 (= ~m_run_pc~0 6)) (.cse18 (= ~s_memory0~0 50)) (.cse30 (<= ~c_req_a~0 1))) (let ((.cse4 (and .cse31 (and (and .cse16 .cse17 (and (and .cse26 .cse25 .cse14) .cse23 .cse15)) .cse18) .cse30)) (.cse10 (= ~a_t~0 0)) (.cse20 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse22 (= 0 ~c_req_a~0)) (.cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse24 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse2 (= ~s_memory1~0 51)) (.cse27 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse5 (= ~req_tt_a~0 1)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~s_run_st~0)) (.cse11 (<= 1 ~a_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 (<= 2 ~s_run_pc~0) (and .cse7 (not .cse8) .cse9)) (and .cse0 .cse1 (= ULTIMATE.start_m_run_~a~0 1) .cse2 .cse10 .cse3 .cse4) (and .cse11 (and .cse12 (and .cse13 .cse7 .cse9) .cse6 .cse8) .cse14 .cse15) (and .cse16 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse17 .cse18 .cse2 .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and .cse20 .cse13 .cse12 .cse6 .cse21 .cse8 .cse7) .cse22 .cse23 .cse15) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse10 .cse3 .cse24) (and (and .cse20 (and .cse18 (and (and .cse22 (and (and (= ULTIMATE.start_s_memory_write_~i 1) .cse25) .cse26)) .cse17) .cse19) .cse27 .cse28 .cse24) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (and .cse26 (and (and .cse12 .cse6 .cse8 .cse29) .cse21) .cse24) (and .cse0 .cse16 .cse17 .cse18 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse2 .cse27 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse28 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse5 .cse30 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse31 .cse1 (= 51 ~c_rsp_d~0) .cse3 (and (and .cse13 .cse12 .cse6 .cse21 .cse8 .cse7) .cse11 .cse14 .cse15) (<= ULTIMATE.start_s_memory_read_~i 1))))))) [2019-01-12 15:32:50,998 INFO L444 ceAbstractionStarter]: At program point L766(lines 759 803) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse4 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse5 (= ~m_run_pc~0 6)) (.cse3 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (<= 1 ~a_t~0) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse5) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7))) [2019-01-12 15:32:50,998 INFO L444 ceAbstractionStarter]: At program point L700(lines 693 719) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (and (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)))) (.cse1 (= ~m_run_pc~0 6))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse0 (<= 1 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1) .cse2 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse2 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse7 (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-01-12 15:32:50,999 INFO L448 ceAbstractionStarter]: For program point L634(lines 633 661) no Hoare annotation was computed. [2019-01-12 15:32:50,999 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 572) no Hoare annotation was computed. [2019-01-12 15:32:50,999 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 122) no Hoare annotation was computed. [2019-01-12 15:32:50,999 INFO L444 ceAbstractionStarter]: At program point L899(lines 873 900) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse19 (<= 1 ~c_req_type~0)) (.cse20 (= ~m_run_pc~0 3)) (.cse21 (<= 2 ~c_write_rsp_ev~0)) (.cse22 (= ~c_empty_rsp~0 1))) (let ((.cse5 (and .cse19 .cse20 .cse21 .cse22)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse2 (<= ~c_req_type~0 1)) (.cse15 (<= ~c_req_a~0 0)) (.cse16 (<= 0 ~c_req_a~0)) (.cse14 (<= 0 ~a_t~0)) (.cse10 (<= ~a_t~0 0)) (.cse13 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse27 (= ~s_memory1~0 51)) (.cse28 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (<= 1 ~c_req_a~0)) (.cse26 (= 0 ~c_req_type~0)) (.cse7 (<= 1 ~a_t~0)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse24 (and .cse1 (and .cse21 .cse22) .cse3 .cse4)) (.cse25 (= ~m_run_pc~0 6)) (.cse8 (= ~s_memory0~0 50)) (.cse6 (<= ~c_req_a~0 1))) (or (and (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse7 .cse8 .cse9) (<= ~c_req_d~0 51) (<= 51 ~c_req_d~0)) (and .cse10 (and .cse11 .cse12 (and .cse13 .cse14 (and (and .cse15 .cse16 .cse5) .cse1 .cse2 .cse3 .cse4))) .cse17) (and (and .cse11 .cse12 (and .cse13 (and .cse1 .cse2 .cse3 (let ((.cse18 (and .cse15 .cse16 .cse19 .cse20 .cse21 (not .cse4) .cse22))) (or (and .cse18 (<= 2 ~s_run_pc~0)) (and (= ~s_run_pc~0 0) .cse18)))))) .cse14 .cse10 .cse17) (and .cse23 (= ~req_tt_a~0 0) (and (and (= 0 ~c_req_a~0) (and .cse13 .cse24) .cse25) .cse26) .cse8 .cse27 (= ~a_t~0 0) .cse28 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse17) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse23 .cse27 .cse28 (= ~req_tt_a~0 1) (and .cse0 (and .cse26 (and .cse7 .cse9 .cse24 .cse25)) .cse8 .cse6))))) [2019-01-12 15:32:50,999 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 639) no Hoare annotation was computed. [2019-01-12 15:32:51,000 INFO L444 ceAbstractionStarter]: At program point L107(lines 96 838) the Hoare annotation is: (let ((.cse21 (= ~s_run_pc~0 2))) (let ((.cse15 (<= ~c_req_a~0 0)) (.cse16 (<= 0 ~c_req_a~0)) (.cse2 (not .cse21)) (.cse31 (<= 1 ~c_req_type~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse22 (= ~c_empty_req~0 1)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse20 (<= 1 ~c_m_lock~0)) (.cse0 (= ~m_run_pc~0 3)) (.cse1 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse5 (<= 2 ~s_run_pc~0)) (.cse10 (and .cse22 .cse18 .cse4 .cse20 .cse21 .cse0 .cse1)) (.cse17 (and .cse31 .cse0 .cse1 .cse3)) (.cse23 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse24 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse7 (<= 1 ~a_t~0)) (.cse8 (<= ~c_req_d~0 51)) (.cse26 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 51 ~c_req_d~0)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (<= 0 ~a_t~0)) (.cse19 (<= ~c_req_type~0 1)) (.cse14 (<= ~a_t~0 0)) (.cse29 (= ~s_run_pc~0 0)) (.cse30 (and .cse15 .cse16 .cse31 .cse0 .cse1 .cse2 .cse3))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse7 (= ~s_memory0~0 50) .cse8 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 .cse10) (and .cse11 .cse12 (and .cse13 .cse14 (and (and .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21))) (and .cse22 .cse5 .cse0 .cse1 .cse3) (and .cse11 (and .cse10 .cse13) .cse12 .cse23 .cse24 .cse6 .cse25 .cse14 .cse26 .cse27 .cse28) (and (and (<= 1 ~c_req_a~0) (and .cse18 .cse19 .cse20 .cse21 .cse17) (<= ~c_req_a~0 1)) .cse23 .cse24 .cse6 .cse25 .cse7 .cse8 .cse26 .cse9 .cse27 .cse28) (and .cse18 .cse4 (and .cse0 .cse1 .cse3) .cse21) (and .cse29 .cse11 .cse12 .cse18 .cse13 .cse19 .cse14 .cse20 .cse30) (and .cse29 .cse4 .cse30))))) [2019-01-12 15:32:51,000 INFO L444 ceAbstractionStarter]: At program point L173-2(lines 173 201) the Hoare annotation is: (let ((.cse9 (<= 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)) (.cse12 (= 0 ~c_req_type~0)) (.cse10 (= 0 ~c_req_a~0)) (.cse18 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse19 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse14 (<= 2 ~s_run_pc~0)) (.cse13 (<= ~a_t~0 0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse20 (= ~s_run_pc~0 2)) (.cse5 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse11 (<= 0 ~a_t~0)) (.cse1 (= ~c_empty_req~0 1)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 2 ~c_write_req_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 .cse13 (and .cse2 .cse3 .cse14 .cse7 .cse1 .cse15 .cse4 .cse16 .cse17 .cse5 .cse6 .cse8) .cse18 .cse19) (and .cse9 .cse0 .cse2 .cse3 .cse11 .cse12 .cse13 .cse7 .cse10 .cse1 .cse15 .cse16 .cse17 .cse5 .cse18 .cse6 .cse19 .cse8) (and (and (not .cse20) .cse7 .cse6) .cse4 .cse14) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse13 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 1 ULTIMATE.start_m_run_~a~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse4 (<= ULTIMATE.start_m_run_~a~0 1) .cse16 .cse17 .cse20 .cse5 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_memory_write_~v 50) .cse11 (and .cse1 (= ~m_run_pc~0 3) .cse7 .cse6) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 50 ~c_req_d~0) .cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-01-12 15:32:51,000 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 772) no Hoare annotation was computed. [2019-01-12 15:32:51,000 INFO L448 ceAbstractionStarter]: For program point L702(lines 702 706) no Hoare annotation was computed. [2019-01-12 15:32:51,001 INFO L444 ceAbstractionStarter]: At program point L1297(lines 1290 1307) the Hoare annotation is: (let ((.cse23 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse55 (= ~s_run_pc~0 2))) (let ((.cse20 (= ~c_empty_req~0 1)) (.cse26 (<= 2 ~s_run_st~0)) (.cse24 (<= ~c_req_a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse61 (<= 1 ~c_req_type~0)) (.cse41 (= ~m_run_pc~0 3)) (.cse60 (not .cse55)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse54 (and .cse23 .cse19)) (.cse32 (<= 1 ~c_m_lock~0))) (let ((.cse1 (and .cse21 .cse54 .cse32 .cse55)) (.cse15 (= ~s_run_pc~0 0)) (.cse31 (and .cse24 .cse25 (and .cse61 .cse41 .cse23 .cse60 .cse19))) (.cse36 (and .cse20 .cse21 .cse26 .cse32 .cse55 .cse41 .cse23)) (.cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ~c_req_d~0 50)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ~a_t~0)) (.cse17 (<= ~m_run_pc~0 0)) (.cse18 (<= ~a_t~0 0)) (.cse22 (<= ~c_m_lock~0 0)) (.cse43 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse52 (= ~req_tt_a~0 1)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse34 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse35 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse40 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse47 (<= 1 ~a_t~0)) (.cse37 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse45 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse58 (and .cse61 .cse41 .cse23 .cse19)) (.cse50 (<= ~c_req_a~0 1)) (.cse49 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse38 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse56 (<= ~c_req_d~0 51)) (.cse57 (<= 51 ~c_req_d~0)) (.cse42 (<= 2 ~s_run_pc~0)) (.cse5 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse0 (= 0 ~c_req_a~0)) (.cse59 (and .cse21 .cse26 (and .cse20 .cse23) .cse32 .cse55)) (.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse2 (= ~m_run_pc~0 6)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse44 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse12 (= ~req_tt_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse51 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse22 .cse23) (and .cse15 .cse24 .cse25 .cse20 .cse17 .cse26 .cse22 .cse23 .cse19) (and (and .cse27 .cse28 (and .cse29 .cse16 .cse18 (and .cse15 .cse21 .cse30 .cse31 .cse32))) .cse33) (and .cse29 .cse16 (and .cse27 .cse28 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse4 .cse40 .cse18 .cse33) (and (and .cse20 .cse41 .cse23 .cse19) .cse42) (and .cse43 .cse44 (and .cse45 (and .cse46 .cse3 (and .cse47 .cse1 .cse48 .cse49 .cse2)) .cse5 .cse50) .cse7 .cse51 .cse52) (and .cse15 .cse26 .cse31) (and (let ((.cse53 (and (and .cse21 .cse26 .cse54 .cse55) .cse32))) (or (and .cse29 .cse16 .cse18 .cse53 .cse33) (and .cse47 .cse53 .cse49))) .cse2) (and (and (and (= ULTIMATE.start_s_memory_write_~i 1) .cse36) .cse47 .cse5 .cse8 .cse9 .cse49) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse56 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse14 .cse57) (and (and .cse27 .cse28 (and (and .cse29 (and .cse21 .cse30 .cse32 .cse55 (and .cse24 .cse25 .cse58)) .cse18) .cse16)) .cse33) (and .cse21 .cse26 (and .cse41 .cse23 .cse19) .cse55) (and .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse26 .cse55 .cse22 .cse23) (and .cse43 .cse44 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse51 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse52 (and .cse45 .cse5 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse50 (and (and .cse47 .cse59 .cse49 .cse2) .cse46 .cse3) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (and (and .cse20 .cse21 .cse26 .cse42 .cse23 .cse19) .cse47 .cse49) .cse2) (and (and .cse34 .cse35 .cse4 .cse40 .cse47 .cse37 (and .cse45 (and .cse21 .cse30 .cse32 .cse55 .cse58) .cse50) .cse49 .cse38 .cse39) .cse56 .cse57) (and .cse26 .cse42 (and .cse23 .cse60 .cse19)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse7 (and .cse46 .cse3 (and .cse0 .cse59 .cse48 .cse2)) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse44 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 50 ~c_rsp_d~0) .cse13 .cse51))))) [2019-01-12 15:32:51,001 INFO L444 ceAbstractionStarter]: At program point L240(lines 233 259) the Hoare annotation is: (let ((.cse19 (= ~s_run_pc~0 2))) (let ((.cse0 (not .cse19)) (.cse12 (<= ~c_req_a~0 0)) (.cse13 (<= 0 ~c_req_a~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse21 (<= 1 ~c_req_type~0)) (.cse22 (<= ~m_run_pc~0 0)) (.cse23 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse24 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse15 (and .cse21 (or (and .cse22 .cse2 .cse1) (and .cse23 .cse1 .cse2)) .cse24)) (.cse3 (<= 2 ~s_run_st~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ~s_run_pc~0 0)) (.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (<= 0 ~a_t~0)) (.cse5 (and (and .cse21 (or (and .cse22 .cse2 .cse0 .cse1) (and .cse23 .cse0 .cse1 .cse2)) .cse24) .cse12 (<= ULTIMATE.start_m_run_~a~0 0) .cse13 .cse14 (<= 0 ULTIMATE.start_m_run_~a~0) .cse16)) (.cse11 (<= ~c_req_type~0 1)) (.cse10 (<= ~a_t~0 0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse3 .cse5) (and .cse6 .cse7 .cse8 (and .cse9 .cse10 (and .cse3 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19)) .cse20 (= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse10 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 1) (and .cse15 .cse3 .cse11 .cse17 .cse18 .cse19) (<= ~c_req_a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~c_req_d~0 51) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse6 .cse4 .cse7 .cse8 .cse9 .cse5 .cse11 .cse10 .cse17 .cse18 .cse20))))) [2019-01-12 15:32:51,001 INFO L448 ceAbstractionStarter]: For program point L174(lines 173 201) no Hoare annotation was computed. [2019-01-12 15:32:51,002 INFO L444 ceAbstractionStarter]: At program point L967(lines 960 977) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse19 (<= 1 ~c_req_type~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse17 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse21 (= ~m_run_pc~0 3)) (.cse22 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~c_empty_rsp~0 1))) (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 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (and .cse19 .cse20 .cse17 .cse21 .cse22 .cse23)) (.cse4 (<= ~c_req_type~0 1)) (.cse11 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse2 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= 0 ~a_t~0)) (.cse13 (<= ~a_t~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse24 (<= 1 ~c_req_a~0)) (.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= 0 ~c_req_type~0)) (.cse32 (and (and .cse20 .cse22 .cse23) .cse3 .cse5 .cse6)) (.cse26 (<= 1 ~a_t~0)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (= ~m_run_pc~0 6)) (.cse27 (= ~s_memory0~0 50)) (.cse25 (<= ~c_req_a~0 1)) (.cse30 (= ~s_memory1~0 51)) (.cse31 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse12 (and .cse0 .cse1 (and (and .cse3 .cse17 .cse4 (let ((.cse18 (and .cse7 .cse8 .cse10 (and .cse19 .cse20 .cse21 .cse22 (not .cse6) .cse23)))) (or (and (= ~s_run_pc~0 0) .cse18) (and (<= 2 ~s_run_pc~0) .cse18))) .cse5 .cse11) (= 0 ULTIMATE.start_m_run_~a~0)) .cse14 .cse15) .cse13) (and (and (and .cse24 (= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse11) .cse25) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse26 .cse27 .cse28) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse29 (= ~req_tt_a~0 0) .cse27 .cse30 .cse31 (and (and (= 0 ~c_req_a~0) (and .cse2 .cse12 .cse32 .cse13) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse33) .cse34 .cse35) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse29 (and .cse24 (and .cse34 .cse35 (and .cse32 .cse26 .cse28 .cse33)) .cse27 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse25) .cse30 .cse31 (= ~req_tt_a~0 1))))) [2019-01-12 15:32:51,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:32:51,002 INFO L448 ceAbstractionStarter]: For program point L1298(lines 1250 1339) no Hoare annotation was computed. [2019-01-12 15:32:51,002 INFO L448 ceAbstractionStarter]: For program point L1232(lines 1232 1236) no Hoare annotation was computed. [2019-01-12 15:32:51,002 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 179) no Hoare annotation was computed. [2019-01-12 15:32:51,002 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 121) no Hoare annotation was computed. [2019-01-12 15:32:51,002 INFO L448 ceAbstractionStarter]: For program point L968(lines 960 977) no Hoare annotation was computed. [2019-01-12 15:32:51,003 INFO L444 ceAbstractionStarter]: At program point L440(lines 433 450) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (or (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) .cse0 (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1 (<= 0 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse6 .cse7 (not .cse4) .cse8) .cse3 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)))) [2019-01-12 15:32:51,003 INFO L448 ceAbstractionStarter]: For program point L374(lines 374 378) no Hoare annotation was computed. [2019-01-12 15:32:51,003 INFO L448 ceAbstractionStarter]: For program point L1299(lines 1299 1303) no Hoare annotation was computed. [2019-01-12 15:32:51,003 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-01-12 15:32:51,003 INFO L448 ceAbstractionStarter]: For program point L1167(lines 1167 1171) no Hoare annotation was computed. [2019-01-12 15:32:51,003 INFO L444 ceAbstractionStarter]: At program point L110(lines 96 838) 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)) [2019-01-12 15:32:51,003 INFO L448 ceAbstractionStarter]: For program point L1167-2(lines 1165 1344) no Hoare annotation was computed. [2019-01-12 15:32:51,004 INFO L444 ceAbstractionStarter]: At program point L1035(lines 1028 1081) the Hoare annotation is: (let ((.cse28 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_req_ev~0)) (.cse27 (= ~c_empty_req~0 1)) (.cse31 (<= 1 ~c_m_lock~0)) (.cse29 (= ~s_run_pc~0 2))) (let ((.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (= ~s_memory1~0 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (and .cse30 .cse27 .cse31 .cse29)) (.cse5 (= ~m_run_pc~0 6)) (.cse8 (<= 1 ~a_t~0)) (.cse0 (= ~s_memory0~0 50)) (.cse10 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse11 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse12 (and .cse30 .cse31 .cse29 (and .cse27 .cse28))) (.cse15 (<= 0 ~a_t~0)) (.cse18 (<= ~c_req_d~0 50)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse22 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse23 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse17 (<= ~a_t~0 0)) (.cse25 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (and .cse2 .cse3 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5)) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) (and (<= 1 ~c_req_a~0) .cse0 (and .cse2 .cse3 (and .cse8 .cse4 .cse9 .cse5)) .cse10 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse12 .cse13 .cse8 .cse0 .cse10 .cse11 .cse9) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0)) (and .cse14 .cse15 .cse13 .cse16 .cse17 (and .cse18 .cse12 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (and .cse15 (and .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse14 (and (<= 1 ~c_req_type~0) (let ((.cse26 (and .cse27 .cse28 (not .cse29)))) (or (and (= ~s_run_pc~0 0) .cse26) (and .cse26 (<= 2 ~s_run_pc~0)))) .cse30 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse31 (<= ULTIMATE.start_s_run_~req_type~1 1))) .cse23 .cse24) .cse13 .cse16 .cse17 .cse25)))) [2019-01-12 15:32:51,004 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 973) no Hoare annotation was computed. [2019-01-12 15:32:51,004 INFO L448 ceAbstractionStarter]: For program point L441(lines 129 475) no Hoare annotation was computed. [2019-01-12 15:32:51,004 INFO L444 ceAbstractionStarter]: At program point L574(lines 567 611) the Hoare annotation is: (let ((.cse4 (= 0 ~c_req_type~0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse4 (and .cse0 (and (= ~m_run_pc~0 3) .cse2 .cse3) .cse5 .cse1) .cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= 0 ~c_req_a~0) (<= 1 ~a_t~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0)) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse6 .cse7 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_a~0 1) .cse8 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse0 (and .cse2 .cse3) .cse5 .cse1) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6)) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v)))) [2019-01-12 15:32:51,004 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-01-12 15:32:51,004 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2019-01-12 15:32:51,004 INFO L448 ceAbstractionStarter]: For program point L1037(lines 1037 1041) no Hoare annotation was computed. [2019-01-12 15:32:51,005 INFO L444 ceAbstractionStarter]: At program point L113(lines 96 838) 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)) [2019-01-12 15:32:51,005 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 959) no Hoare annotation was computed. [2019-01-12 15:32:51,005 INFO L444 ceAbstractionStarter]: At program point L774(lines 767 802) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse4 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse5 (= ~m_run_pc~0 6)) (.cse3 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (<= 1 ~a_t~0) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse5) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7))) [2019-01-12 15:32:51,005 INFO L444 ceAbstractionStarter]: At program point L708(lines 701 718) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (and (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)))) (.cse1 (= ~m_run_pc~0 6))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse0 (<= 1 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1) .cse2 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse2 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse7 (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-01-12 15:32:51,005 INFO L448 ceAbstractionStarter]: For program point L576(lines 576 580) no Hoare annotation was computed. [2019-01-12 15:32:51,005 INFO L451 ceAbstractionStarter]: At program point L1369(lines 1346 1371) the Hoare annotation is: true [2019-01-12 15:32:51,006 INFO L444 ceAbstractionStarter]: At program point L312(lines 282 313) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (and (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) (<= 2 ~c_write_rsp_ev~0))))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (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) .cse0 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-01-12 15:32:51,006 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 911) no Hoare annotation was computed. [2019-01-12 15:32:51,006 INFO L448 ceAbstractionStarter]: For program point L709(lines 480 832) no Hoare annotation was computed. [2019-01-12 15:32:51,006 INFO L444 ceAbstractionStarter]: At program point L1238(lines 1231 1248) 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) (<= ~a_t~0 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))) [2019-01-12 15:32:51,006 INFO L448 ceAbstractionStarter]: For program point L1172-1(lines 1165 1344) no Hoare annotation was computed. [2019-01-12 15:32:51,006 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2019-01-12 15:32:51,006 INFO L448 ceAbstractionStarter]: For program point L776(lines 776 780) no Hoare annotation was computed. [2019-01-12 15:32:51,006 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 714) no Hoare annotation was computed. [2019-01-12 15:32:51,007 INFO L444 ceAbstractionStarter]: At program point L380(lines 373 390) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (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) .cse0 (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse1) (= 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) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-01-12 15:32:51,009 INFO L444 ceAbstractionStarter]: At program point L248(lines 241 258) the Hoare annotation is: (let ((.cse19 (= ~s_run_pc~0 2))) (let ((.cse0 (not .cse19)) (.cse12 (<= ~c_req_a~0 0)) (.cse13 (<= 0 ~c_req_a~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse21 (<= 1 ~c_req_type~0)) (.cse22 (<= ~m_run_pc~0 0)) (.cse23 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse24 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse15 (and .cse21 (or (and .cse22 .cse2 .cse1) (and .cse23 .cse1 .cse2)) .cse24)) (.cse3 (<= 2 ~s_run_st~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ~s_run_pc~0 0)) (.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (<= 0 ~a_t~0)) (.cse5 (and (and .cse21 (or (and .cse22 .cse2 .cse0 .cse1) (and .cse23 .cse0 .cse1 .cse2)) .cse24) .cse12 (<= ULTIMATE.start_m_run_~a~0 0) .cse13 .cse14 (<= 0 ULTIMATE.start_m_run_~a~0) .cse16)) (.cse11 (<= ~c_req_type~0 1)) (.cse10 (<= ~a_t~0 0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse3 .cse5) (and .cse6 .cse7 .cse8 (and .cse9 .cse10 (and .cse3 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19)) .cse20 (= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse10 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 1) (and .cse15 .cse3 .cse11 .cse17 .cse18 .cse19) (<= ~c_req_a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~c_req_d~0 51) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse6 .cse4 .cse7 .cse8 .cse9 .cse5 .cse11 .cse10 .cse17 .cse18 .cse20))))) [2019-01-12 15:32:51,009 INFO L444 ceAbstractionStarter]: At program point L116(lines 96 838) the Hoare annotation is: (let ((.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse27 (<= 3 ~m_run_pc~0)) (.cse16 (= ~c_empty_rsp~0 1))) (let ((.cse21 (and .cse15 .cse27 .cse16)) (.cse14 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 2 ~s_run_st~0)) (.cse20 (<= 1 ~c_m_lock~0)) (.cse18 (= ~s_run_pc~0 2))) (let ((.cse3 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~req_tt_a~0 1)) (.cse12 (<= ~c_req_a~0 1)) (.cse0 (<= 1 ~c_req_a~0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse10 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse23 (and .cse14 .cse13 .cse17 .cse20 .cse18 .cse15)) (.cse1 (<= 1 ~a_t~0)) (.cse7 (= 0 ~c_req_type~0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse25 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse4 (= ~m_run_pc~0 6)) (.cse22 (= 0 ~c_req_a~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse19 (<= 0 ~a_t~0)) (.cse2 (and .cse13 .cse21 .cse20 .cse18))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 (and .cse13 (and .cse14 .cse15 .cse16) .cse17 .cse18) .cse4) (and (and .cse19 (and .cse20 (and .cse13 .cse21 .cse17 .cse18))) .cse4) (and .cse6 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse8 .cse9 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (and .cse22 .cse23 .cse3 .cse4) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse24 (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse10) (and .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 .cse25 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse26 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse11 .cse12 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse5 (= 51 ~c_rsp_d~0) .cse10 (and .cse23 .cse1 .cse4) (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse17 (<= 2 ~s_run_pc~0) (and .cse15 (not .cse18) .cse27 .cse16)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse7 .cse8 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse9 .cse25 .cse26 .cse4 .cse22 .cse24 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (and .cse19 .cse2 (<= ~a_t~0 0))))))) [2019-01-12 15:32:51,009 INFO L448 ceAbstractionStarter]: For program point L381(lines 373 390) no Hoare annotation was computed. [2019-01-12 15:32:51,009 INFO L448 ceAbstractionStarter]: For program point L249(lines 129 475) no Hoare annotation was computed. [2019-01-12 15:32:51,009 INFO L448 ceAbstractionStarter]: For program point L1240(lines 1240 1244) no Hoare annotation was computed. [2019-01-12 15:32:51,009 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-01-12 15:32:51,009 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-01-12 15:32:51,010 INFO L444 ceAbstractionStarter]: At program point L1043(lines 1036 1080) the Hoare annotation is: (let ((.cse28 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_req_ev~0)) (.cse27 (= ~c_empty_req~0 1)) (.cse31 (<= 1 ~c_m_lock~0)) (.cse29 (= ~s_run_pc~0 2))) (let ((.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (= ~s_memory1~0 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (and .cse30 .cse27 .cse31 .cse29)) (.cse5 (= ~m_run_pc~0 6)) (.cse8 (<= 1 ~a_t~0)) (.cse0 (= ~s_memory0~0 50)) (.cse10 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse11 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse12 (and .cse30 .cse31 .cse29 (and .cse27 .cse28))) (.cse15 (<= 0 ~a_t~0)) (.cse18 (<= ~c_req_d~0 50)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse22 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse23 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse17 (<= ~a_t~0 0)) (.cse25 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (and .cse2 .cse3 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5)) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) (and (<= 1 ~c_req_a~0) .cse0 (and .cse2 .cse3 (and .cse8 .cse4 .cse9 .cse5)) .cse10 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse12 .cse13 .cse8 .cse0 .cse10 .cse11 .cse9) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0)) (and .cse14 .cse15 .cse13 .cse16 .cse17 (and .cse18 .cse12 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (and .cse15 (and .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse14 (and (<= 1 ~c_req_type~0) (let ((.cse26 (and .cse27 .cse28 (not .cse29)))) (or (and (= ~s_run_pc~0 0) .cse26) (and .cse26 (<= 2 ~s_run_pc~0)))) .cse30 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse31 (<= ULTIMATE.start_s_run_~req_type~1 1))) .cse23 .cse24) .cse13 .cse16 .cse17 .cse25)))) [2019-01-12 15:32:51,010 INFO L444 ceAbstractionStarter]: At program point L582(lines 575 610) the Hoare annotation is: (let ((.cse4 (= 0 ~c_req_type~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse4 .cse5 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= 0 ~c_req_a~0) (and (<= 0 ~a_t~0) (and .cse0 .cse8 (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) .cse1)) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0)) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse5 .cse6 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_a~0 1) .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse0 (and .cse2 .cse3) .cse8 .cse1) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6)) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v)))) [2019-01-12 15:32:51,013 INFO L448 ceAbstractionStarter]: For program point L1045(lines 1045 1049) no Hoare annotation was computed. [2019-01-12 15:32:51,013 INFO L444 ceAbstractionStarter]: At program point L913(lines 906 959) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse19 (<= 1 ~c_req_type~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse17 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse21 (= ~m_run_pc~0 3)) (.cse22 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~c_empty_rsp~0 1))) (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 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (and .cse19 .cse20 .cse17 .cse21 .cse22 .cse23)) (.cse4 (<= ~c_req_type~0 1)) (.cse11 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse2 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= 0 ~a_t~0)) (.cse13 (<= ~a_t~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse24 (<= 1 ~c_req_a~0)) (.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= 0 ~c_req_type~0)) (.cse32 (and (and .cse20 .cse22 .cse23) .cse3 .cse5 .cse6)) (.cse26 (<= 1 ~a_t~0)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (= ~m_run_pc~0 6)) (.cse27 (= ~s_memory0~0 50)) (.cse25 (<= ~c_req_a~0 1)) (.cse30 (= ~s_memory1~0 51)) (.cse31 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse12 (and .cse0 .cse1 (and (and .cse3 .cse17 .cse4 (let ((.cse18 (and .cse7 .cse8 .cse10 (and .cse19 .cse20 .cse21 .cse22 (not .cse6) .cse23)))) (or (and (= ~s_run_pc~0 0) .cse18) (and (<= 2 ~s_run_pc~0) .cse18))) .cse5 .cse11) (= 0 ULTIMATE.start_m_run_~a~0)) .cse14 .cse15) .cse13) (and (and (and .cse24 (= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse11) .cse25) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse26 .cse27 .cse28) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse29 (= ~req_tt_a~0 0) .cse27 .cse30 .cse31 (and (and (= 0 ~c_req_a~0) (and .cse2 .cse12 .cse32 .cse13) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse33) .cse34 .cse35) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse29 (and .cse24 (and .cse34 .cse35 (and .cse32 .cse26 .cse28 .cse33)) .cse27 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse25) .cse30 .cse31 (= ~req_tt_a~0 1))))) [2019-01-12 15:32:51,015 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 372) no Hoare annotation was computed. [2019-01-12 15:32:51,015 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1182) no Hoare annotation was computed. [2019-01-12 15:32:51,015 INFO L448 ceAbstractionStarter]: For program point L980(lines 980 994) no Hoare annotation was computed. [2019-01-12 15:32:51,015 INFO L444 ceAbstractionStarter]: At program point L782(lines 775 801) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse4 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse5 (= ~m_run_pc~0 6)) (.cse3 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (<= 1 ~a_t~0) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse5) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7))) [2019-01-12 15:32:51,020 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 588) no Hoare annotation was computed. [2019-01-12 15:32:51,020 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-01-12 15:32:51,020 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 919) no Hoare annotation was computed. [2019-01-12 15:32:51,020 INFO L444 ceAbstractionStarter]: At program point L519(lines 489 520) the Hoare annotation is: (let ((.cse9 (= ~s_run_pc~0 2))) (let ((.cse4 (<= 2 ~s_run_pc~0)) (.cse0 (not .cse9)) (.cse5 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~s_memory1~0 51)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_type___0~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 (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_type~0) .cse5 .cse6 (and (= 0 ~c_req_a~0) (and .cse7 .cse3 (and .cse8 .cse1 .cse2) .cse9) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6)) (<= ULTIMATE.start_m_run_~req_a___0~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= ULTIMATE.start_s_memory_write_~v 51) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse5 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (and .cse7 .cse3 (and .cse8 (= ~m_run_pc~0 3) .cse1 .cse2) .cse9) .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0))))) [2019-01-12 15:32:51,020 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-01-12 15:32:51,021 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 788) no Hoare annotation was computed. [2019-01-12 15:32:51,021 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1317) no Hoare annotation was computed. [2019-01-12 15:32:51,021 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:32:51,023 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1114 1155) no Hoare annotation was computed. [2019-01-12 15:32:51,023 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 62) no Hoare annotation was computed. [2019-01-12 15:32:51,023 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 460) no Hoare annotation was computed. [2019-01-12 15:32:51,023 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:32:51,023 INFO L444 ceAbstractionStarter]: At program point L126(lines 96 838) the Hoare annotation is: (let ((.cse4 (<= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~s_run_st~0)) (.cse12 (= ~s_run_pc~0 0)) (.cse1 (<= 0 ~a_t~0)) (.cse0 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (<= ~a_t~0 0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= 0 ~c_req_a~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= ~c_m_lock~0 0)) (.cse11 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse9 .cse4 .cse11 (not (= ~s_run_pc~0 2)) .cse5) (and .cse12 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse7 .cse0 .cse9 .cse10 .cse11 .cse5) (and .cse12 .cse1 .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) [2019-01-12 15:32:51,024 INFO L444 ceAbstractionStarter]: At program point L1051(lines 1044 1079) the Hoare annotation is: (let ((.cse28 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_req_ev~0)) (.cse27 (= ~c_empty_req~0 1)) (.cse31 (<= 1 ~c_m_lock~0)) (.cse29 (= ~s_run_pc~0 2))) (let ((.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (= ~s_memory1~0 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (and .cse30 .cse27 .cse31 .cse29)) (.cse5 (= ~m_run_pc~0 6)) (.cse8 (<= 1 ~a_t~0)) (.cse0 (= ~s_memory0~0 50)) (.cse10 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse11 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse12 (and .cse30 .cse31 .cse29 (and .cse27 .cse28))) (.cse15 (<= 0 ~a_t~0)) (.cse18 (<= ~c_req_d~0 50)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse22 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse23 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse17 (<= ~a_t~0 0)) (.cse25 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (and .cse2 .cse3 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5)) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) (and (<= 1 ~c_req_a~0) .cse0 (and .cse2 .cse3 (and .cse8 .cse4 .cse9 .cse5)) .cse10 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse12 .cse13 .cse8 .cse0 .cse10 .cse11 .cse9) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0)) (and .cse14 .cse15 .cse13 .cse16 .cse17 (and .cse18 .cse12 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (and .cse15 (and .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse14 (and (<= 1 ~c_req_type~0) (let ((.cse26 (and .cse27 .cse28 (not .cse29)))) (or (and (= ~s_run_pc~0 0) .cse26) (and .cse26 (<= 2 ~s_run_pc~0)))) .cse30 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse31 (<= ULTIMATE.start_s_run_~req_type~1 1))) .cse23 .cse24) .cse13 .cse16 .cse17 .cse25)))) [2019-01-12 15:32:51,026 INFO L444 ceAbstractionStarter]: At program point L523-2(lines 523 551) the Hoare annotation is: (let ((.cse8 (= ~s_run_pc~0 2))) (let ((.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse9 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse11 (not .cse8)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (<= 2 ~s_run_pc~0))) (or (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (and .cse2 .cse3 (and .cse4 (= ~m_run_pc~0 3) .cse5 .cse6) .cse7 .cse8) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse10 .cse11 .cse5 .cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_type~0) .cse0 .cse1 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse9 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= ULTIMATE.start_s_memory_write_~v 51) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v) (and (= 0 ~c_req_a~0) (and (and .cse2 .cse3 (and .cse4 .cse5 .cse6) .cse7 .cse8) (<= 1 ULTIMATE.start_m_run_~a~0)) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6))) (and .cse3 (and .cse11 .cse5 .cse6 (<= 3 ~m_run_pc~0)) .cse10)))) [2019-01-12 15:32:51,029 INFO L444 ceAbstractionStarter]: At program point L1184(lines 1177 1230) 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) (<= ~a_t~0 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))) [2019-01-12 15:32:51,029 INFO L448 ceAbstractionStarter]: For program point L986(lines 986 993) no Hoare annotation was computed. [2019-01-12 15:32:51,029 INFO L444 ceAbstractionStarter]: At program point L590(lines 583 609) the Hoare annotation is: (let ((.cse4 (= 0 ~c_req_type~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse4 .cse5 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= 0 ~c_req_a~0) (and (<= 0 ~a_t~0) (and .cse0 .cse8 (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) .cse1)) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0)) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse5 .cse6 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_a~0 1) .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (and (and .cse0 (and .cse2 .cse3) .cse8 .cse1) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6)) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v)))) [2019-01-12 15:32:51,029 INFO L448 ceAbstractionStarter]: For program point L524(lines 523 551) no Hoare annotation was computed. [2019-01-12 15:32:51,033 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 398) no Hoare annotation was computed. [2019-01-12 15:32:51,033 INFO L444 ceAbstractionStarter]: At program point L392-1(lines 392 398) 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))) (let ((.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse5 (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) .cse0 .cse2) (<= 2 ~c_write_req_ev~0) .cse3 .cse1))) (or (and (and .cse0 (not .cse1) .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse4 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse5 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (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) .cse4 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse5) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-01-12 15:32:51,033 INFO L444 ceAbstractionStarter]: At program point L326(lines 319 372) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (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) .cse0 (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse1) (= 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) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-01-12 15:32:51,033 INFO L448 ceAbstractionStarter]: For program point L1251(line 1251) no Hoare annotation was computed. [2019-01-12 15:32:51,033 INFO L448 ceAbstractionStarter]: For program point L1119(lines 1119 1123) no Hoare annotation was computed. [2019-01-12 15:32:51,034 INFO L448 ceAbstractionStarter]: For program point L1119-1(lines 1114 1155) no Hoare annotation was computed. [2019-01-12 15:32:51,034 INFO L448 ceAbstractionStarter]: For program point L1053(lines 1053 1057) no Hoare annotation was computed. [2019-01-12 15:32:51,034 INFO L444 ceAbstractionStarter]: At program point L921(lines 914 958) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse19 (<= 1 ~c_req_type~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse17 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse21 (= ~m_run_pc~0 3)) (.cse22 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~c_empty_rsp~0 1))) (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 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (and .cse19 .cse20 .cse17 .cse21 .cse22 .cse23)) (.cse4 (<= ~c_req_type~0 1)) (.cse11 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse2 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= 0 ~a_t~0)) (.cse13 (<= ~a_t~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse24 (<= 1 ~c_req_a~0)) (.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= 0 ~c_req_type~0)) (.cse32 (and (and .cse20 .cse22 .cse23) .cse3 .cse5 .cse6)) (.cse26 (<= 1 ~a_t~0)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (= ~m_run_pc~0 6)) (.cse27 (= ~s_memory0~0 50)) (.cse25 (<= ~c_req_a~0 1)) (.cse30 (= ~s_memory1~0 51)) (.cse31 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse12 (and .cse0 .cse1 (and (and .cse3 .cse17 .cse4 (let ((.cse18 (and .cse7 .cse8 .cse10 (and .cse19 .cse20 .cse21 .cse22 (not .cse6) .cse23)))) (or (and (= ~s_run_pc~0 0) .cse18) (and (<= 2 ~s_run_pc~0) .cse18))) .cse5 .cse11) (= 0 ULTIMATE.start_m_run_~a~0)) .cse14 .cse15) .cse13) (and (and (and .cse24 (= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse11) .cse25) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse26 .cse27 .cse28) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse29 (= ~req_tt_a~0 0) .cse27 .cse30 .cse31 (and (and (= 0 ~c_req_a~0) (and .cse2 .cse12 .cse32 .cse13) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse33) .cse34 .cse35) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse29 (and .cse24 (and .cse34 .cse35 (and .cse32 .cse26 .cse28 .cse33)) .cse27 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse25) .cse30 .cse31 (= ~req_tt_a~0 1))))) [2019-01-12 15:32:51,036 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2019-01-12 15:32:51,036 INFO L448 ceAbstractionStarter]: For program point L1186(lines 1186 1190) no Hoare annotation was computed. [2019-01-12 15:32:51,036 INFO L444 ceAbstractionStarter]: At program point L129-2(lines 129 475) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse9 (<= 0 ~a_t~0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse10 (= 0 ~c_req_type~0)) (.cse11 (<= ~a_t~0 0)) (.cse12 (= 0 ~c_req_a~0)) (.cse14 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (not (= ~s_run_pc~0 2))) (.cse8 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse2 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse16 (<= 2 ~s_run_pc~0)) (.cse17 (= ~m_run_pc~0 3)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1))) (or (and .cse0 (<= ~c_req_a~0 0) .cse1 (<= 0 ~c_req_a~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse3 .cse10 .cse11 .cse7 .cse12 .cse2 .cse13 .cse5 .cse6 .cse14) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 .cse15 .cse11 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse16 .cse17 .cse7 (<= 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) .cse2 .cse13 .cse4 (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse5 .cse6 .cse18 .cse7) .cse4 .cse16) (and .cse9 .cse3 .cse10 .cse11 .cse16 .cse7 .cse12 .cse2 .cse13 .cse4 .cse5 .cse6 .cse14) (and .cse1 .cse4 .cse16 .cse6 .cse18 .cse7 .cse8) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse15 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 2 ULTIMATE.start_m_run_~a~0) (and .cse2 .cse13 .cse4 .cse16 .cse17 .cse5 .cse6 .cse7) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)))) [2019-01-12 15:32:51,041 INFO L448 ceAbstractionStarter]: For program point L856(lines 856 868) no Hoare annotation was computed. [2019-01-12 15:32:51,041 INFO L444 ceAbstractionStarter]: At program point L790(lines 783 800) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse4 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse5 (= ~m_run_pc~0 6)) (.cse3 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (<= 1 ~a_t~0) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse5) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7))) [2019-01-12 15:32:51,041 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 728) no Hoare annotation was computed. [2019-01-12 15:32:51,042 INFO L448 ceAbstractionStarter]: For program point L592(lines 592 596) no Hoare annotation was computed. [2019-01-12 15:32:51,042 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 332) no Hoare annotation was computed. [2019-01-12 15:32:51,042 INFO L444 ceAbstractionStarter]: At program point L1319(lines 1312 1329) the Hoare annotation is: (let ((.cse23 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse55 (= ~s_run_pc~0 2))) (let ((.cse20 (= ~c_empty_req~0 1)) (.cse26 (<= 2 ~s_run_st~0)) (.cse24 (<= ~c_req_a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse61 (<= 1 ~c_req_type~0)) (.cse41 (= ~m_run_pc~0 3)) (.cse59 (not .cse55)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse58 (and .cse23 .cse19)) (.cse32 (<= 1 ~c_m_lock~0))) (let ((.cse1 (and .cse21 .cse58 .cse32 .cse55)) (.cse15 (= ~s_run_pc~0 0)) (.cse31 (and .cse24 .cse25 (and .cse61 .cse41 .cse23 .cse59 .cse19))) (.cse36 (and .cse20 .cse21 .cse26 .cse32 .cse55 .cse41 .cse23)) (.cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ~c_req_d~0 50)) (.cse28 (<= 50 ~c_req_d~0)) (.cse17 (<= ~m_run_pc~0 0)) (.cse22 (<= ~c_m_lock~0 0)) (.cse34 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse35 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse40 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse37 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (<= ~c_req_type~0 1)) (.cse56 (and .cse61 .cse41 .cse23 .cse19)) (.cse38 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse53 (<= ~c_req_d~0 51)) (.cse54 (<= 51 ~c_req_d~0)) (.cse16 (<= 0 ~a_t~0)) (.cse29 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= ~a_t~0 0)) (.cse33 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse42 (<= 2 ~s_run_pc~0)) (.cse0 (= 0 ~c_req_a~0)) (.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~req_tt_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse43 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse44 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse45 (<= 1 ~c_req_a~0)) (.cse5 (= ~s_memory0~0 50)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse47 (<= 1 ~a_t~0)) (.cse60 (and (and .cse26 (and .cse20 .cse23)) .cse21 .cse32 .cse55)) (.cse49 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse2 (= ~m_run_pc~0 6)) (.cse3 (= 0 ~c_req_type~0)) (.cse50 (<= ~c_req_a~0 1)) (.cse7 (= ~s_memory1~0 51)) (.cse51 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse52 (= ~req_tt_a~0 1))) (or (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse22 .cse23) (and .cse15 .cse24 .cse25 .cse20 .cse17 .cse26 .cse22 .cse23 .cse19) (and (and .cse27 .cse28 (and .cse29 .cse16 .cse18 (and .cse15 .cse21 .cse30 .cse31 .cse32))) .cse33) (and .cse29 .cse16 (and .cse27 .cse28 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse4 .cse40 .cse18 .cse33) (and (and .cse20 .cse41 .cse23 .cse19) .cse42) (and .cse43 .cse44 (and .cse45 (and .cse46 .cse3 (and .cse47 .cse1 .cse48 .cse49 .cse2)) .cse5 .cse50) .cse7 .cse51 .cse52) (and .cse15 .cse26 .cse31) (and (and (and (= ULTIMATE.start_s_memory_write_~i 1) .cse36) .cse47 .cse5 .cse8 .cse9 .cse49) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse53 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse14 .cse54) (and (and .cse27 .cse28 (and (and .cse29 (and .cse21 .cse30 .cse32 .cse55 (and .cse24 .cse25 .cse56)) .cse18) .cse16)) .cse33) (and (and (and .cse21 (and .cse20 .cse26 .cse23 .cse19) .cse55) .cse47 .cse49) .cse2) (and .cse21 .cse26 (and .cse41 .cse23 .cse19) .cse55) (and .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse26 .cse55 .cse22 .cse23) (and (and .cse34 .cse35 .cse4 .cse40 .cse47 .cse37 (and .cse45 (and .cse21 .cse30 .cse32 .cse55 .cse56) .cse50) .cse49 .cse38 .cse39) .cse53 .cse54) (and (let ((.cse57 (and .cse32 (and .cse21 .cse26 .cse58 .cse55)))) (or (and .cse47 .cse57 .cse49) (and .cse16 (and .cse29 .cse18 .cse57) .cse33))) .cse2) (and .cse26 .cse42 (and .cse23 .cse59 .cse19)) (and (and .cse46 .cse3 (and .cse0 .cse60 .cse48 .cse2)) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse7 .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse44 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 50 ~c_rsp_d~0) .cse13 .cse51) (and .cse43 .cse44 (and .cse45 .cse5 .cse8 .cse9 (and .cse46 (and .cse47 .cse60 .cse49 .cse2) .cse3) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse50 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse51 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse52 (= 51 ULTIMATE.start_s_run_~rsp_d~1)))))) [2019-01-12 15:32:51,047 INFO L448 ceAbstractionStarter]: For program point L130(lines 129 475) no Hoare annotation was computed. [2019-01-12 15:32:51,047 INFO L444 ceAbstractionStarter]: At program point L64(lines 53 65) the Hoare annotation is: (let ((.cse7 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse0 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse2 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse4 (= 0 ~c_req_type~0)) (.cse5 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse6 (= ~m_run_pc~0 6))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse2 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (and (<= 1 ~c_req_a~0) (and .cse3 .cse4 (and .cse5 (<= 1 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse6)) .cse7 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1))) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse2 (and .cse3 .cse4 (and (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_memory_read_~i) (= 0 ULTIMATE.start_s_run_~req_a~1) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse5) .cse6)) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-01-12 15:32:51,047 INFO L448 ceAbstractionStarter]: For program point L923(lines 923 927) no Hoare annotation was computed. [2019-01-12 15:32:51,047 INFO L448 ceAbstractionStarter]: For program point L791(lines 480 832) no Hoare annotation was computed. [2019-01-12 15:32:51,047 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1250 1339) no Hoare annotation was computed. [2019-01-12 15:32:51,047 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 135) no Hoare annotation was computed. [2019-01-12 15:32:51,047 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 15:32:51,047 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 796) no Hoare annotation was computed. [2019-01-12 15:32:51,048 INFO L444 ceAbstractionStarter]: At program point L462(lines 455 472) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (or (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) .cse0 (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1 (<= 0 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse6 .cse7 (not .cse4) .cse8) .cse3 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)))) [2019-01-12 15:32:51,051 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1325) no Hoare annotation was computed. [2019-01-12 15:32:51,051 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 268) no Hoare annotation was computed. [2019-01-12 15:32:51,051 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 867) no Hoare annotation was computed. [2019-01-12 15:32:51,051 INFO L448 ceAbstractionStarter]: For program point L463(lines 455 472) no Hoare annotation was computed. [2019-01-12 15:32:51,051 INFO L444 ceAbstractionStarter]: At program point L860(lines 855 1106) the Hoare annotation is: false [2019-01-12 15:32:51,052 INFO L444 ceAbstractionStarter]: At program point L662(lines 632 663) the Hoare annotation is: (let ((.cse4 (and (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0)) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse5 (= ~m_run_pc~0 6)) (.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 (and (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse4 .cse5) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (<= 1 ~a_t~0) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse5) .cse0 .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-01-12 15:32:51,052 INFO L448 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-01-12 15:32:51,052 INFO L444 ceAbstractionStarter]: At program point L1125(lines 1114 1155) the Hoare annotation is: (let ((.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (= ~c_empty_rsp~0 1)) (.cse35 (= ~s_run_pc~0 2))) (let ((.cse41 (<= ~c_req_a~0 0)) (.cse42 (<= 0 ~c_req_a~0)) (.cse62 (<= 1 ~c_req_type~0)) (.cse61 (not .cse35)) (.cse33 (<= 2 ~s_run_st~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse16 (= ~m_run_pc~0 3)) (.cse39 (= ~m_run_st~0 0)) (.cse32 (<= 2 ~c_write_req_ev~0)) (.cse34 (and .cse17 .cse18)) (.cse36 (<= 1 ~c_m_lock~0))) (let ((.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~req_tt_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse37 (<= ~m_run_pc~0 0)) (.cse0 (= 0 ~c_req_a~0)) (.cse38 (<= ~c_m_lock~0 0)) (.cse1 (and .cse32 .cse34 .cse36 .cse35)) (.cse22 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse43 (and .cse32 .cse33 (and .cse15 .cse16 .cse39 .cse17) .cse36 .cse35)) (.cse50 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse5 (= ~s_memory0~0 50)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse20 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse21 (and .cse32 .cse33 .cse36 .cse35 (and .cse15 .cse39 .cse17))) (.cse3 (= 0 ~c_req_type~0)) (.cse23 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (= ~s_memory1~0 51)) (.cse24 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse53 (= ~req_tt_a~0 1)) (.cse40 (= ~s_run_pc~0 0)) (.cse49 (and .cse41 .cse42 (and .cse62 .cse16 .cse17 .cse61 .cse18))) (.cse46 (<= ~c_req_d~0 50)) (.cse47 (<= 50 ~c_req_d~0)) (.cse25 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse27 (<= ~a_t~0 0)) (.cse26 (<= 0 ~a_t~0)) (.cse29 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (= ~m_run_pc~0 6)) (.cse54 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse55 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse59 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse30 (<= 1 ~a_t~0)) (.cse56 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse51 (<= 1 ~c_req_a~0)) (.cse48 (<= ~c_req_type~0 1)) (.cse60 (and .cse62 .cse16 .cse17 .cse18)) (.cse52 (<= ~c_req_a~0 1)) (.cse31 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse57 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse58 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse44 (<= ~c_req_d~0 51)) (.cse45 (<= 51 ~c_req_d~0)) (.cse19 (<= 2 ~s_run_pc~0))) (or (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse15 .cse16 .cse17 .cse18) .cse19) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse7 (and .cse20 .cse3 (and .cse0 .cse21 .cse22 .cse2)) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse23 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 50 ~c_rsp_d~0) .cse13 .cse24) (and (let ((.cse28 (and (and .cse32 .cse33 .cse34 .cse35) .cse36))) (or (and .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse28 .cse31))) .cse2) (and .cse37 .cse26 .cse3 .cse27 .cse19 .cse18 .cse0 .cse15 .cse32 .cse33 .cse38 .cse39 .cse17) (and .cse40 .cse41 .cse42 .cse15 .cse37 .cse33 .cse38 .cse39 .cse17 .cse18) (and .cse32 .cse33 (and .cse16 .cse17 .cse18) .cse35) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse43 .cse4 .cse30 .cse5 .cse8 .cse9 .cse31) .cse44 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse14 .cse45) (and .cse40 .cse26 .cse37 .cse3 .cse27 .cse18 .cse0 .cse15 .cse32 .cse38 .cse17) (and (and .cse46 .cse47 (and .cse25 .cse26 .cse27 (and .cse40 .cse32 .cse48 .cse49 .cse36))) .cse29) (and .cse50 .cse23 (and .cse51 (and .cse20 .cse3 (and .cse30 .cse1 .cse22 .cse31 .cse2)) .cse5 .cse52) .cse7 .cse24 .cse53) (and (and .cse46 .cse47 .cse54 .cse55 .cse4 (and .cse25 .cse26 .cse43) .cse56 .cse57 .cse58) .cse59 .cse27 .cse29) (and .cse50 (and .cse51 .cse5 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse52 (and .cse20 (and .cse21 .cse30 .cse31 .cse2) .cse3) (<= ULTIMATE.start_s_memory_read_~i 1)) .cse23 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse24 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse53 (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse40 .cse33 .cse49) (and (and .cse46 .cse47 (and (and .cse25 (and .cse32 .cse48 .cse36 .cse35 (and .cse41 .cse42 .cse60)) .cse27) .cse26)) .cse29) (and (and (and .cse15 .cse32 .cse33 .cse19 .cse17 .cse18) .cse30 .cse31) .cse2) (and (and .cse54 .cse55 .cse4 .cse59 .cse30 .cse56 (and .cse51 (and .cse32 .cse48 .cse36 .cse35 .cse60) .cse52) .cse31 .cse57 .cse58) .cse44 .cse45) (and .cse33 .cse19 (and .cse17 .cse61 .cse18)))))) [2019-01-12 15:32:51,060 INFO L444 ceAbstractionStarter]: At program point L1059(lines 1052 1078) the Hoare annotation is: (let ((.cse28 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_req_ev~0)) (.cse27 (= ~c_empty_req~0 1)) (.cse31 (<= 1 ~c_m_lock~0)) (.cse29 (= ~s_run_pc~0 2))) (let ((.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (= ~s_memory1~0 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (and .cse30 .cse27 .cse31 .cse29)) (.cse5 (= ~m_run_pc~0 6)) (.cse8 (<= 1 ~a_t~0)) (.cse0 (= ~s_memory0~0 50)) (.cse10 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse11 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse12 (and .cse30 .cse31 .cse29 (and .cse27 .cse28))) (.cse15 (<= 0 ~a_t~0)) (.cse18 (<= ~c_req_d~0 50)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse22 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse23 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse17 (<= ~a_t~0 0)) (.cse25 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (and .cse2 .cse3 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5)) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) (and (<= 1 ~c_req_a~0) .cse0 (and .cse2 .cse3 (and .cse8 .cse4 .cse9 .cse5)) .cse10 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse12 .cse13 .cse8 .cse0 .cse10 .cse11 .cse9) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0)) (and .cse14 .cse15 .cse13 .cse16 .cse17 (and .cse18 .cse12 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (and .cse15 (and .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse14 (and (<= 1 ~c_req_type~0) (let ((.cse26 (and .cse27 .cse28 (not .cse29)))) (or (and (= ~s_run_pc~0 0) .cse26) (and .cse26 (<= 2 ~s_run_pc~0)))) .cse30 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse31 (<= ULTIMATE.start_s_run_~req_type~1 1))) .cse23 .cse24) .cse13 .cse16 .cse17 .cse25)))) [2019-01-12 15:32:51,060 INFO L448 ceAbstractionStarter]: For program point L1258(lines 1258 1311) no Hoare annotation was computed. [2019-01-12 15:32:51,060 INFO L444 ceAbstractionStarter]: At program point L1192(lines 1185 1229) 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) (<= ~a_t~0 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))) [2019-01-12 15:32:51,064 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 74) no Hoare annotation was computed. [2019-01-12 15:32:51,064 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 866) no Hoare annotation was computed. [2019-01-12 15:32:51,064 INFO L444 ceAbstractionStarter]: At program point L730(lines 723 740) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (and (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)))) (.cse1 (= ~m_run_pc~0 6))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse0 (<= 1 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1) .cse2 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse2 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse7 (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-01-12 15:32:51,064 INFO L444 ceAbstractionStarter]: At program point L598(lines 591 608) the Hoare annotation is: (let ((.cse4 (= 0 ~c_req_type~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse1 (= ~s_run_pc~0 2)) (.cse7 (= 0 ULTIMATE.start_m_run_~req_type___0~0))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse4 .cse5 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= 0 ~c_req_a~0) (and (<= 0 ~a_t~0) (and .cse0 .cse8 (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) .cse1)) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0)) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse5 .cse6 (and (and .cse0 (and .cse2 .cse3) .cse8 .cse1) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6)) (<= ULTIMATE.start_m_run_~req_a___0~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_a~0 1) .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v)))) [2019-01-12 15:32:51,065 INFO L444 ceAbstractionStarter]: At program point L334(lines 327 371) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (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) .cse0 (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse1) (= 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) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-01-12 15:32:51,065 INFO L448 ceAbstractionStarter]: For program point L1259(lines 1259 1263) no Hoare annotation was computed. [2019-01-12 15:32:51,066 INFO L444 ceAbstractionStarter]: At program point L202(lines 172 203) the Hoare annotation is: (let ((.cse10 (= ~s_run_pc~0 0)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse18 (= 0 ~c_req_a~0)) (.cse0 (<= 0 ~a_t~0)) (.cse17 (= 0 ~c_req_type~0)) (.cse9 (<= ~a_t~0 0)) (.cse19 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse11 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse12 (<= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (= ~s_run_pc~0 2)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (<= 2 ~s_run_st~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (and (<= ULTIMATE.start_m_run_~req_a~0 1) (and .cse1 .cse2 .cse3 .cse4 (and .cse5 (= ~m_run_pc~0 3) .cse6 .cse7) .cse8) (<= 1 ULTIMATE.start_m_run_~req_a~0)) .cse9 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 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) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse10 .cse11 .cse12 .cse13 .cse2 .cse5 .cse7 .cse6 .cse14 .cse15) (and .cse16 .cse10 .cse0 .cse12 .cse13 .cse17 .cse9 .cse6 .cse18 .cse1 .cse3 .cse4 .cse19 .cse5 .cse7 (= 0 ULTIMATE.start_m_run_~a~0) .cse15) (and .cse16 .cse18 .cse0 .cse17 .cse9 .cse19 (and .cse11 .cse13 .cse12 .cse6 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse7 .cse15) .cse14) (and (and (not .cse8) .cse6 .cse7) .cse2 (<= 2 ~s_run_pc~0)))) [2019-01-12 15:32:51,066 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2019-01-12 15:32:51,066 INFO L444 ceAbstractionStarter]: At program point L929(lines 922 957) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse19 (<= 1 ~c_req_type~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse17 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse21 (= ~m_run_pc~0 3)) (.cse22 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~c_empty_rsp~0 1))) (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 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (and .cse19 .cse20 .cse17 .cse21 .cse22 .cse23)) (.cse4 (<= ~c_req_type~0 1)) (.cse11 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse2 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= 0 ~a_t~0)) (.cse13 (<= ~a_t~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse24 (<= 1 ~c_req_a~0)) (.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= 0 ~c_req_type~0)) (.cse32 (and (and .cse20 .cse22 .cse23) .cse3 .cse5 .cse6)) (.cse26 (<= 1 ~a_t~0)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (= ~m_run_pc~0 6)) (.cse27 (= ~s_memory0~0 50)) (.cse25 (<= ~c_req_a~0 1)) (.cse30 (= ~s_memory1~0 51)) (.cse31 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse12 (and .cse0 .cse1 (and (and .cse3 .cse17 .cse4 (let ((.cse18 (and .cse7 .cse8 .cse10 (and .cse19 .cse20 .cse21 .cse22 (not .cse6) .cse23)))) (or (and (= ~s_run_pc~0 0) .cse18) (and (<= 2 ~s_run_pc~0) .cse18))) .cse5 .cse11) (= 0 ULTIMATE.start_m_run_~a~0)) .cse14 .cse15) .cse13) (and (and (and .cse24 (= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse11) .cse25) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse26 .cse27 .cse28) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse29 (= ~req_tt_a~0 0) .cse27 .cse30 .cse31 (and (and (= 0 ~c_req_a~0) (and .cse2 .cse12 .cse32 .cse13) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse33) .cse34 .cse35) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse29 (and .cse24 (and .cse34 .cse35 (and .cse32 .cse26 .cse28 .cse33)) .cse27 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse25) .cse30 .cse31 (= ~req_tt_a~0 1))))) [2019-01-12 15:32:51,067 INFO L444 ceAbstractionStarter]: At program point L863(lines 855 1106) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse12 (= ~m_run_pc~0 3)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1))) (let ((.cse5 (and (<= 1 ~c_req_type~0) .cse12 .cse13 .cse14)) (.cse2 (<= ~c_req_type~0 1)) (.cse10 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse19 (= ~s_memory1~0 51)) (.cse20 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (<= 1 ~c_req_a~0)) (.cse18 (= 0 ~c_req_type~0)) (.cse7 (<= 1 ~a_t~0)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse16 (and .cse1 (and .cse13 .cse14) .cse3 .cse4)) (.cse17 (= ~m_run_pc~0 6)) (.cse8 (= ~s_memory0~0 50)) (.cse6 (<= ~c_req_a~0 1))) (or (and (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse7 .cse8 .cse9) (<= ~c_req_d~0 51) (<= 51 ~c_req_d~0)) (and (<= ~a_t~0 0) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse10 (<= 0 ~a_t~0) (and (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse5) .cse1 .cse2 .cse3 .cse4))) .cse11) (and (<= 2 ~s_run_pc~0) (and (= ~c_empty_req~0 1) .cse12 .cse13 .cse14)) (and .cse15 (= ~req_tt_a~0 0) (and (and (= 0 ~c_req_a~0) (and .cse10 .cse16) .cse17) .cse18) .cse8 .cse19 (= ~a_t~0 0) .cse20 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse15 .cse19 .cse20 (= ~req_tt_a~0 1) (and .cse0 (and .cse18 (and .cse7 .cse9 .cse16 .cse17)) .cse8 .cse6))))) [2019-01-12 15:32:51,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L731(lines 723 740) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L599(lines 480 832) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L401(lines 401 454) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L1194(lines 1194 1198) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 74) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L996-1(lines 871 1101) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 736) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 406) no Hoare annotation was computed. [2019-01-12 15:32:51,070 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-01-12 15:32:51,071 INFO L444 ceAbstractionStarter]: At program point L270(lines 263 280) 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 (<= 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) (<= ~a_t~0 0) (<= ULTIMATE.start_m_run_~req_type~0 1) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_m_run_~req_d~0)) (and .cse0 .cse1 .cse2) (and .cse2 .cse3 (<= 2 ~s_run_pc~0)) (and (and .cse4 .cse5) .cse2 .cse6))))) [2019-01-12 15:32:51,075 INFO L448 ceAbstractionStarter]: For program point L1129(lines 1129 1136) no Hoare annotation was computed. [2019-01-12 15:32:51,075 INFO L448 ceAbstractionStarter]: For program point L997(lines 996 1020) no Hoare annotation was computed. [2019-01-12 15:32:51,075 INFO L448 ceAbstractionStarter]: For program point L931(lines 931 935) no Hoare annotation was computed. [2019-01-12 15:32:51,075 INFO L448 ceAbstractionStarter]: For program point L271(lines 263 280) no Hoare annotation was computed. [2019-01-12 15:32:51,075 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1002) no Hoare annotation was computed. [2019-01-12 15:32:51,075 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-01-12 15:32:51,075 INFO L444 ceAbstractionStarter]: At program point L140-2(lines 140 168) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= 0 ~c_req_type~0)) (.cse8 (= 0 ~c_req_a~0)) (.cse14 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse17 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (= ~s_run_pc~0 0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse5 (<= ~a_t~0 0)) (.cse2 (<= 0 ~a_t~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse13 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse15 (<= ~c_m_lock~0 0)) (.cse11 (<= 2 ~s_run_st~0)) (.cse6 (<= 2 ~s_run_pc~0)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~s_run_pc~0 2)) (.cse7 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse1 .cse7 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse9 .cse11 .cse13 .cse15 .cse16 (<= 0 ULTIMATE.start_m_run_~a~0) .cse18) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse5 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 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) (and (<= ULTIMATE.start_m_run_~req_a~0 1) .cse2 (<= 1 ULTIMATE.start_m_run_~req_a~0) (and .cse10 .cse11 .cse12 .cse20 (and .cse9 .cse13 (= ~m_run_pc~0 3) .cse15 .cse7 .cse16))) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 .cse6 .cse16 (not .cse20) .cse7))) [2019-01-12 15:32:51,075 INFO L448 ceAbstractionStarter]: For program point L669(lines 669 722) no Hoare annotation was computed. [2019-01-12 15:32:51,076 INFO L448 ceAbstractionStarter]: For program point L141(lines 140 168) no Hoare annotation was computed. [2019-01-12 15:32:51,076 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 674) no Hoare annotation was computed. [2019-01-12 15:32:51,079 INFO L444 ceAbstractionStarter]: At program point L1265(lines 1258 1311) the Hoare annotation is: (let ((.cse23 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse55 (= ~s_run_pc~0 2))) (let ((.cse20 (= ~c_empty_req~0 1)) (.cse26 (<= 2 ~s_run_st~0)) (.cse24 (<= ~c_req_a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse61 (<= 1 ~c_req_type~0)) (.cse41 (= ~m_run_pc~0 3)) (.cse60 (not .cse55)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse54 (and .cse23 .cse19)) (.cse32 (<= 1 ~c_m_lock~0))) (let ((.cse1 (and .cse21 .cse54 .cse32 .cse55)) (.cse15 (= ~s_run_pc~0 0)) (.cse31 (and .cse24 .cse25 (and .cse61 .cse41 .cse23 .cse60 .cse19))) (.cse36 (and .cse20 .cse21 .cse26 .cse32 .cse55 .cse41 .cse23)) (.cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ~c_req_d~0 50)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ~a_t~0)) (.cse17 (<= ~m_run_pc~0 0)) (.cse18 (<= ~a_t~0 0)) (.cse22 (<= ~c_m_lock~0 0)) (.cse43 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse52 (= ~req_tt_a~0 1)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse34 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse35 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse40 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse47 (<= 1 ~a_t~0)) (.cse37 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse45 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse58 (and .cse61 .cse41 .cse23 .cse19)) (.cse50 (<= ~c_req_a~0 1)) (.cse49 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse38 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse56 (<= ~c_req_d~0 51)) (.cse57 (<= 51 ~c_req_d~0)) (.cse42 (<= 2 ~s_run_pc~0)) (.cse5 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse0 (= 0 ~c_req_a~0)) (.cse59 (and .cse21 .cse26 (and .cse20 .cse23) .cse32 .cse55)) (.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse2 (= ~m_run_pc~0 6)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse44 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse12 (= ~req_tt_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse51 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse22 .cse23) (and .cse15 .cse24 .cse25 .cse20 .cse17 .cse26 .cse22 .cse23 .cse19) (and (and .cse27 .cse28 (and .cse29 .cse16 .cse18 (and .cse15 .cse21 .cse30 .cse31 .cse32))) .cse33) (and .cse29 .cse16 (and .cse27 .cse28 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse4 .cse40 .cse18 .cse33) (and (and .cse20 .cse41 .cse23 .cse19) .cse42) (and .cse43 .cse44 (and .cse45 (and .cse46 .cse3 (and .cse47 .cse1 .cse48 .cse49 .cse2)) .cse5 .cse50) .cse7 .cse51 .cse52) (and .cse15 .cse26 .cse31) (and (let ((.cse53 (and (and .cse21 .cse26 .cse54 .cse55) .cse32))) (or (and .cse29 .cse16 .cse18 .cse53 .cse33) (and .cse47 .cse53 .cse49))) .cse2) (and (and (and (= ULTIMATE.start_s_memory_write_~i 1) .cse36) .cse47 .cse5 .cse8 .cse9 .cse49) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse56 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse14 .cse57) (and (and .cse27 .cse28 (and (and .cse29 (and .cse21 .cse30 .cse32 .cse55 (and .cse24 .cse25 .cse58)) .cse18) .cse16)) .cse33) (and .cse21 .cse26 (and .cse41 .cse23 .cse19) .cse55) (and .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse26 .cse55 .cse22 .cse23) (and .cse43 .cse44 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse51 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse52 (and .cse45 .cse5 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse50 (and (and .cse47 .cse59 .cse49 .cse2) .cse46 .cse3) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (and (and .cse20 .cse21 .cse26 .cse42 .cse23 .cse19) .cse47 .cse49) .cse2) (and (and .cse34 .cse35 .cse4 .cse40 .cse47 .cse37 (and .cse45 (and .cse21 .cse30 .cse32 .cse55 .cse58) .cse50) .cse49 .cse38 .cse39) .cse56 .cse57) (and .cse26 .cse42 (and .cse23 .cse60 .cse19)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse7 (and .cse46 .cse3 (and .cse0 .cse59 .cse48 .cse2)) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse44 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 50 ~c_rsp_d~0) .cse13 .cse51))))) [2019-01-12 15:32:51,080 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-01-12 15:32:51,084 INFO L444 ceAbstractionStarter]: At program point L1067(lines 1060 1077) the Hoare annotation is: (let ((.cse28 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_req_ev~0)) (.cse27 (= ~c_empty_req~0 1)) (.cse31 (<= 1 ~c_m_lock~0)) (.cse29 (= ~s_run_pc~0 2))) (let ((.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (= ~s_memory1~0 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (and .cse30 .cse27 .cse31 .cse29)) (.cse5 (= ~m_run_pc~0 6)) (.cse8 (<= 1 ~a_t~0)) (.cse0 (= ~s_memory0~0 50)) (.cse10 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse11 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse12 (and .cse30 .cse31 .cse29 (and .cse27 .cse28))) (.cse15 (<= 0 ~a_t~0)) (.cse18 (<= ~c_req_d~0 50)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse22 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse23 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse17 (<= ~a_t~0 0)) (.cse25 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (and .cse2 .cse3 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5)) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) (and (<= 1 ~c_req_a~0) .cse0 (and .cse2 .cse3 (and .cse8 .cse4 .cse9 .cse5)) .cse10 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse12 .cse13 .cse8 .cse0 .cse10 .cse11 .cse9) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0)) (and .cse14 .cse15 .cse13 .cse16 .cse17 (and .cse18 .cse12 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (and .cse15 (and .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse14 (and (<= 1 ~c_req_type~0) (let ((.cse26 (and .cse27 .cse28 (not .cse29)))) (or (and (= ~s_run_pc~0 0) .cse26) (and .cse26 (<= 2 ~s_run_pc~0)))) .cse30 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse31 (<= ULTIMATE.start_s_run_~req_type~1 1))) .cse23 .cse24) .cse13 .cse16 .cse17 .cse25)))) [2019-01-12 15:32:51,084 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-01-12 15:32:51,084 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-01-12 15:32:51,084 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-01-12 15:32:51,084 INFO L448 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-01-12 15:32:51,084 INFO L448 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2019-01-12 15:32:51,084 INFO L448 ceAbstractionStarter]: For program point L209(lines 209 262) no Hoare annotation was computed. [2019-01-12 15:32:51,084 INFO L444 ceAbstractionStarter]: At program point L1200(lines 1193 1228) 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) (<= ~a_t~0 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))) [2019-01-12 15:32:51,089 INFO L448 ceAbstractionStarter]: For program point L1068(lines 871 1101) no Hoare annotation was computed. [2019-01-12 15:32:51,089 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 1 1371) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse0 (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse1 (= ~m_run_pc~0 6)) (.cse5 (= ~s_memory0~0 50))) (or (and (and (and (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_memory_read_~i) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1) .cse2 .cse3) (= ULTIMATE.start_m_run_~a~0 0) .cse4 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse5 .cse6 (= ~a_t~0 0) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse7 (= ~req_tt_a~0 1) (and (<= 1 ~c_req_a~0) (and .cse2 .cse3 (and .cse0 (<= 1 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1)) .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1))))) [2019-01-12 15:32:51,089 INFO L444 ceAbstractionStarter]: At program point L11-4(lines 67 77) the Hoare annotation is: (let ((.cse13 (= ~c_empty_req~0 1)) (.cse15 (= ~m_run_pc~0 3)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (= ~c_empty_rsp~0 1)) (.cse19 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse20 (<= 1 ~c_m_lock~0)) (.cse17 (= ~s_run_pc~0 2)) (.cse21 (<= ULTIMATE.start_s_run_~req_type~1 1))) (let ((.cse1 (and (and .cse13 .cse15 .cse16 .cse18) .cse19 .cse14 .cse20 .cse17 .cse21)) (.cse8 (<= 0 ~a_t~0)) (.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse2 (<= ~c_req_d~0 50)) (.cse3 (<= 50 ~c_req_d~0)) (.cse4 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse7 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse9 (<= ~a_t~0 0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (and .cse0 (<= 1 ~a_t~0) .cse1 (= ~s_memory0~0 50) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_m_run_~a~0)) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0)) (and (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 (and (<= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse9 .cse1) .cse10 .cse11) (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse7 (and (and (let ((.cse12 (and .cse13 .cse14 .cse15 .cse16 (not .cse17) .cse18))) (or (and (<= 2 ~s_run_pc~0) .cse12) (and (= ~s_run_pc~0 0) .cse12))) (<= 1 ~c_req_type~0) .cse19 (<= ~c_req_type~0 1) .cse20 .cse21) (= 0 ULTIMATE.start_m_run_~a~0)) .cse10 .cse11) .cse6 .cse9)))) [2019-01-12 15:32:51,089 INFO L444 ceAbstractionStarter]: At program point L408(lines 401 454) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (or (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) .cse0 (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1 (<= 0 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse6 .cse7 (not .cse4) .cse8) .cse3 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)))) [2019-01-12 15:32:51,091 INFO L444 ceAbstractionStarter]: At program point L342(lines 335 370) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (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) .cse0 (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse1) (= 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) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-01-12 15:32:51,091 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1337) no Hoare annotation was computed. [2019-01-12 15:32:51,091 INFO L448 ceAbstractionStarter]: For program point L1333-1(lines 1165 1344) no Hoare annotation was computed. [2019-01-12 15:32:51,091 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1271) no Hoare annotation was computed. [2019-01-12 15:32:51,091 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 214) no Hoare annotation was computed. [2019-01-12 15:32:51,092 INFO L448 ceAbstractionStarter]: For program point L1069(lines 1069 1073) no Hoare annotation was computed. [2019-01-12 15:32:51,092 INFO L444 ceAbstractionStarter]: At program point L937(lines 930 956) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse19 (<= 1 ~c_req_type~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse17 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse21 (= ~m_run_pc~0 3)) (.cse22 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~c_empty_rsp~0 1))) (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 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (and .cse19 .cse20 .cse17 .cse21 .cse22 .cse23)) (.cse4 (<= ~c_req_type~0 1)) (.cse11 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse2 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= 0 ~a_t~0)) (.cse13 (<= ~a_t~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse24 (<= 1 ~c_req_a~0)) (.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= 0 ~c_req_type~0)) (.cse32 (and (and .cse20 .cse22 .cse23) .cse3 .cse5 .cse6)) (.cse26 (<= 1 ~a_t~0)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (= ~m_run_pc~0 6)) (.cse27 (= ~s_memory0~0 50)) (.cse25 (<= ~c_req_a~0 1)) (.cse30 (= ~s_memory1~0 51)) (.cse31 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse12 (and .cse0 .cse1 (and (and .cse3 .cse17 .cse4 (let ((.cse18 (and .cse7 .cse8 .cse10 (and .cse19 .cse20 .cse21 .cse22 (not .cse6) .cse23)))) (or (and (= ~s_run_pc~0 0) .cse18) (and (<= 2 ~s_run_pc~0) .cse18))) .cse5 .cse11) (= 0 ULTIMATE.start_m_run_~a~0)) .cse14 .cse15) .cse13) (and (and (and .cse24 (= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse11) .cse25) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse26 .cse27 .cse28) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse29 (= ~req_tt_a~0 0) .cse27 .cse30 .cse31 (and (and (= 0 ~c_req_a~0) (and .cse2 .cse12 .cse32 .cse13) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse33) .cse34 .cse35) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse29 (and .cse24 (and .cse34 .cse35 (and .cse32 .cse26 .cse28 .cse33)) .cse27 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse25) .cse30 .cse31 (= ~req_tt_a~0 1))))) [2019-01-12 15:32:51,095 INFO L444 ceAbstractionStarter]: At program point L871-1(lines 855 1106) the Hoare annotation is: (let ((.cse18 (= ~s_run_pc~0 2)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse24 (= ~c_empty_req~0 1)) (.cse16 (= ~m_run_pc~0 3)) (.cse17 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0)) (.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse9 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (and .cse10 .cse11 (and .cse24 .cse16 .cse17))) (.cse20 (<= 0 ~a_t~0)) (.cse21 (<= ~a_t~0 0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~s_run_pc~0)) (.cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse1 (<= 1 ~a_t~0)) (.cse6 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse3 (= ~s_memory0~0 50)) (.cse27 (and (and .cse24 .cse17) .cse10 .cse11 .cse18)) (.cse28 (= ~m_run_pc~0 6)) (.cse26 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse23 (= 0 ~c_req_type~0)) (.cse29 (= ~s_memory1~0 51)) (.cse25 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse30 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0)) (and (and .cse7 .cse8 (and .cse9 (and .cse10 (<= ~c_req_type~0 1) .cse11 (let ((.cse12 (and .cse14 .cse15 (<= 1 ~c_req_type~0) .cse16 .cse17 (not .cse18) .cse19))) (or (and .cse12 .cse13) (and (= ~s_run_pc~0 0) .cse12)))))) .cse20 .cse21 .cse22) (and .cse10 .cse20 .cse23 .cse21 (and .cse14 .cse15 .cse24 (<= ~m_run_pc~0 0) (<= ~c_m_lock~0 0) .cse17 .cse19)) (and (and .cse7 .cse8 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and .cse9 .cse2 .cse20 .cse21) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) .cse22) (and (and .cse24 .cse16 .cse17 .cse19) .cse13) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse25 (and (<= 1 ~c_req_a~0) .cse3 .cse4 (and .cse26 .cse23 (and .cse1 .cse27 .cse6 .cse28)) .cse5 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse29 .cse30 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse3 (and (and (= 0 ~c_req_a~0) .cse27 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse28) .cse26 .cse23) .cse29 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse25 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse30)))) [2019-01-12 15:32:51,097 INFO L448 ceAbstractionStarter]: For program point L1202(lines 1202 1206) no Hoare annotation was computed. [2019-01-12 15:32:51,097 INFO L448 ceAbstractionStarter]: For program point L806(lines 806 810) no Hoare annotation was computed. [2019-01-12 15:32:51,097 INFO L444 ceAbstractionStarter]: At program point L476(lines 128 477) the Hoare annotation is: (let ((.cse3 (<= 2 ~s_run_st~0)) (.cse4 (<= 2 ~s_run_pc~0)) (.cse0 (<= ~c_m_lock~0 0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1))) (or (and (and .cse0 .cse1 (not (= ~s_run_pc~0 2)) .cse2) .cse3 .cse4) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 2 ULTIMATE.start_m_run_~a~0) (and (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse3 .cse4 (= ~m_run_pc~0 3) .cse0 .cse1 .cse2) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)))) [2019-01-12 15:32:51,101 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-01-12 15:32:51,101 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 348) no Hoare annotation was computed. [2019-01-12 15:32:51,101 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 943) no Hoare annotation was computed. [2019-01-12 15:32:51,101 INFO L448 ceAbstractionStarter]: For program point L874-1(lines 871 1101) no Hoare annotation was computed. [2019-01-12 15:32:51,101 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 748) no Hoare annotation was computed. [2019-01-12 15:32:51,102 INFO L444 ceAbstractionStarter]: At program point L742-1(lines 742 748) the Hoare annotation is: (let ((.cse4 (and (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)))) (.cse5 (= ~m_run_pc~0 6)) (.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (and .cse4 (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (<= 1 ~a_t~0) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse5) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-01-12 15:32:51,102 INFO L444 ceAbstractionStarter]: At program point L676(lines 669 722) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (and (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)))) (.cse1 (= ~m_run_pc~0 6))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse0 (<= 1 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1) .cse2 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse2 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse7 (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-01-12 15:32:51,106 INFO L448 ceAbstractionStarter]: For program point L875(lines 874 898) no Hoare annotation was computed. [2019-01-12 15:32:51,107 INFO L444 ceAbstractionStarter]: At program point L1140(lines 1114 1155) the Hoare annotation is: (let ((.cse22 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~c_empty_rsp~0 1)) (.cse44 (= ~s_run_pc~0 2))) (let ((.cse18 (= ~c_empty_req~0 1)) (.cse20 (<= 2 ~s_run_st~0)) (.cse16 (<= ~c_req_a~0 0)) (.cse17 (<= 0 ~c_req_a~0)) (.cse61 (<= 1 ~c_req_type~0)) (.cse37 (= ~m_run_pc~0 3)) (.cse60 (not .cse44)) (.cse42 (<= 2 ~c_write_req_ev~0)) (.cse43 (and .cse22 .cse23)) (.cse45 (<= 1 ~c_m_lock~0))) (let ((.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~req_tt_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse19 (<= ~m_run_pc~0 0)) (.cse0 (= 0 ~c_req_a~0)) (.cse21 (<= ~c_m_lock~0 0)) (.cse1 (and .cse42 .cse43 .cse45 .cse44)) (.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse15 (= ~s_run_pc~0 0)) (.cse52 (and .cse16 .cse17 (and .cse61 .cse37 .cse22 .cse60 .cse23))) (.cse30 (and .cse18 .cse42 .cse20 .cse45 .cse44 .cse37 .cse22)) (.cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse26 (<= ~c_req_d~0 50)) (.cse27 (<= 50 ~c_req_d~0)) (.cse24 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse35 (<= ~a_t~0 0)) (.cse25 (<= 0 ~a_t~0)) (.cse36 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse53 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse49 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (= ~s_memory1~0 51)) (.cse50 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse56 (= ~req_tt_a~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse47 (and .cse42 .cse20 (and .cse18 .cse22) .cse45 .cse44)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse2 (= ~m_run_pc~0 6)) (.cse28 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse29 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse34 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse40 (<= 1 ~a_t~0)) (.cse31 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse54 (<= 1 ~c_req_a~0)) (.cse51 (<= ~c_req_type~0 1)) (.cse59 (and .cse61 .cse37 .cse22 .cse23)) (.cse55 (<= ~c_req_a~0 1)) (.cse41 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse32 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse33 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse57 (<= ~c_req_d~0 51)) (.cse58 (<= 51 ~c_req_d~0)) (.cse38 (<= 2 ~s_run_pc~0))) (or (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse25 (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse4 .cse34 .cse35 .cse36) (and (and .cse18 .cse37 .cse22 .cse23) .cse38) (and (let ((.cse39 (and (and .cse42 .cse20 .cse43 .cse44) .cse45))) (or (and .cse24 .cse25 .cse35 .cse39 .cse36) (and .cse40 .cse39 .cse41))) .cse2) (and .cse42 .cse20 (and .cse37 .cse22 .cse23) .cse44) (and .cse25 .cse19 .cse3 .cse35 .cse23 .cse0 .cse18 .cse42 .cse20 .cse44 .cse21 .cse22) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse7 (and .cse46 .cse3 (and .cse0 .cse47 .cse48 .cse2)) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse49 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 50 ~c_rsp_d~0) .cse13 .cse50) (and .cse15 .cse25 .cse19 .cse3 .cse35 .cse23 .cse0 .cse18 .cse42 .cse21 .cse22) (and (and .cse26 .cse27 (and .cse24 .cse25 .cse35 (and .cse15 .cse42 .cse51 .cse52 .cse45))) .cse36) (and .cse53 .cse49 (and .cse54 (and .cse46 .cse3 (and .cse40 .cse1 .cse48 .cse41 .cse2)) .cse5 .cse55) .cse7 .cse50 .cse56) (and .cse15 .cse20 .cse52) (and (and (and (= ULTIMATE.start_s_memory_write_~i 1) .cse30) .cse40 .cse5 .cse8 .cse9 .cse41) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse57 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse14 .cse58) (and (and .cse26 .cse27 (and (and .cse24 (and .cse42 .cse51 .cse45 .cse44 (and .cse16 .cse17 .cse59)) .cse35) .cse25)) .cse36) (and .cse53 .cse49 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse50 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse56 (and .cse54 .cse5 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse55 (and (and .cse40 .cse47 .cse41 .cse2) .cse46 .cse3) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (and (and .cse18 .cse42 .cse20 .cse38 .cse22 .cse23) .cse40 .cse41) .cse2) (and (and .cse28 .cse29 .cse4 .cse34 .cse40 .cse31 (and .cse54 (and .cse42 .cse51 .cse45 .cse44 .cse59) .cse55) .cse41 .cse32 .cse33) .cse57 .cse58) (and .cse20 .cse38 (and .cse22 .cse60 .cse23)))))) [2019-01-12 15:32:51,108 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 880) no Hoare annotation was computed. [2019-01-12 15:32:51,110 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 682) no Hoare annotation was computed. [2019-01-12 15:32:51,111 INFO L444 ceAbstractionStarter]: At program point L480-2(lines 480 832) the Hoare annotation is: (let ((.cse9 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~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 (= ~s_run_pc~0 2))) (let ((.cse8 (= ~m_run_pc~0 3)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse6 (<= 1 ~a_t~0)) (.cse13 (and .cse9 (and .cse15 .cse1 .cse2 .cse4) .cse0 .cse10)) (.cse7 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse14 (= ~m_run_pc~0 6)) (.cse5 (<= 2 ~s_run_pc~0)) (.cse3 (not .cse10))) (or (and .cse0 (and .cse1 .cse2 .cse3 (<= 3 ~m_run_pc~0) .cse4) .cse5) (and .cse6 .cse7 (and (and .cse8 .cse1 .cse2 .cse4) .cse9 .cse0 .cse10)) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) .cse11 .cse12 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (and (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse13 .cse14) (<= ULTIMATE.start_s_memory_write_~v 51) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v)) (and (and (and .cse0 (and .cse15 .cse8 .cse1 .cse2 .cse4)) .cse9 .cse10) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse11 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse6 (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0)) (and .cse6 .cse13 .cse7 .cse14) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse5 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-01-12 15:32:51,111 INFO L444 ceAbstractionStarter]: At program point L1273(lines 1266 1310) the Hoare annotation is: (let ((.cse23 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse55 (= ~s_run_pc~0 2))) (let ((.cse20 (= ~c_empty_req~0 1)) (.cse26 (<= 2 ~s_run_st~0)) (.cse24 (<= ~c_req_a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse61 (<= 1 ~c_req_type~0)) (.cse41 (= ~m_run_pc~0 3)) (.cse60 (not .cse55)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse54 (and .cse23 .cse19)) (.cse32 (<= 1 ~c_m_lock~0))) (let ((.cse1 (and .cse21 .cse54 .cse32 .cse55)) (.cse15 (= ~s_run_pc~0 0)) (.cse31 (and .cse24 .cse25 (and .cse61 .cse41 .cse23 .cse60 .cse19))) (.cse36 (and .cse20 .cse21 .cse26 .cse32 .cse55 .cse41 .cse23)) (.cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ~c_req_d~0 50)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ~a_t~0)) (.cse17 (<= ~m_run_pc~0 0)) (.cse18 (<= ~a_t~0 0)) (.cse22 (<= ~c_m_lock~0 0)) (.cse43 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse52 (= ~req_tt_a~0 1)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse34 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse35 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse40 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse47 (<= 1 ~a_t~0)) (.cse37 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse45 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse58 (and .cse61 .cse41 .cse23 .cse19)) (.cse50 (<= ~c_req_a~0 1)) (.cse49 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse38 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse56 (<= ~c_req_d~0 51)) (.cse57 (<= 51 ~c_req_d~0)) (.cse42 (<= 2 ~s_run_pc~0)) (.cse5 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse0 (= 0 ~c_req_a~0)) (.cse59 (and .cse21 .cse26 (and .cse20 .cse23) .cse32 .cse55)) (.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse2 (= ~m_run_pc~0 6)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse44 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse12 (= ~req_tt_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse51 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse22 .cse23) (and .cse15 .cse24 .cse25 .cse20 .cse17 .cse26 .cse22 .cse23 .cse19) (and (and .cse27 .cse28 (and .cse29 .cse16 .cse18 (and .cse15 .cse21 .cse30 .cse31 .cse32))) .cse33) (and .cse29 .cse16 (and .cse27 .cse28 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse4 .cse40 .cse18 .cse33) (and (and .cse20 .cse41 .cse23 .cse19) .cse42) (and .cse43 .cse44 (and .cse45 (and .cse46 .cse3 (and .cse47 .cse1 .cse48 .cse49 .cse2)) .cse5 .cse50) .cse7 .cse51 .cse52) (and .cse15 .cse26 .cse31) (and (let ((.cse53 (and (and .cse21 .cse26 .cse54 .cse55) .cse32))) (or (and .cse29 .cse16 .cse18 .cse53 .cse33) (and .cse47 .cse53 .cse49))) .cse2) (and (and (and (= ULTIMATE.start_s_memory_write_~i 1) .cse36) .cse47 .cse5 .cse8 .cse9 .cse49) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse56 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse14 .cse57) (and (and .cse27 .cse28 (and (and .cse29 (and .cse21 .cse30 .cse32 .cse55 (and .cse24 .cse25 .cse58)) .cse18) .cse16)) .cse33) (and .cse21 .cse26 (and .cse41 .cse23 .cse19) .cse55) (and .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse26 .cse55 .cse22 .cse23) (and .cse43 .cse44 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse51 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse52 (and .cse45 .cse5 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse50 (and (and .cse47 .cse59 .cse49 .cse2) .cse46 .cse3) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (and (and .cse20 .cse21 .cse26 .cse42 .cse23 .cse19) .cse47 .cse49) .cse2) (and (and .cse34 .cse35 .cse4 .cse40 .cse47 .cse37 (and .cse45 (and .cse21 .cse30 .cse32 .cse55 .cse58) .cse50) .cse49 .cse38 .cse39) .cse56 .cse57) (and .cse26 .cse42 (and .cse23 .cse60 .cse19)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse7 (and .cse46 .cse3 (and .cse0 .cse59 .cse48 .cse2)) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse44 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 50 ~c_rsp_d~0) .cse13 .cse51))))) [2019-01-12 15:32:51,114 INFO L444 ceAbstractionStarter]: At program point L216(lines 209 262) the Hoare annotation is: (let ((.cse3 (<= 2 ~s_run_pc~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (<= ~m_run_pc~0 0)) (.cse9 (<= 0 ~a_t~0)) (.cse1 (<= ~c_req_type~0 1)) (.cse2 (<= ~a_t~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse18 (<= ~c_req_d~0 50)) (.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0)) (.cse19 (<= 50 ~c_req_d~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse21 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse1 .cse2 .cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse5 (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 51 ~c_req_d~0) (= ~m_run_pc~0 3) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_a~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= ~c_req_d~0 51) .cse10 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse5 .cse3 (not (= ~s_run_pc~0 2)) .cse4 .cse10) (and .cse11 (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse12 .cse13 .cse4 .cse14 .cse15 .cse5 .cse8 .cse10 (<= 0 ULTIMATE.start_m_run_~a~0) .cse16) (and .cse17 .cse18 .cse19 .cse20 (and .cse0 .cse9 .cse12 .cse13 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse10 .cse16) .cse21) (and .cse17 .cse11 .cse0 .cse12 .cse13 .cse9 .cse1 .cse2 .cse4 .cse18 .cse14 .cse15 .cse19 .cse6 .cse7 .cse8 .cse20 .cse10 .cse21 .cse16))) [2019-01-12 15:32:51,117 INFO L448 ceAbstractionStarter]: For program point L481(lines 480 832) no Hoare annotation was computed. [2019-01-12 15:32:51,117 INFO L451 ceAbstractionStarter]: At program point L1340(lines 1162 1345) the Hoare annotation is: true [2019-01-12 15:32:51,117 INFO L444 ceAbstractionStarter]: At program point L283-2(lines 283 311) the Hoare annotation is: (let ((.cse30 (<= 2 ~c_write_rsp_ev~0)) (.cse21 (= ~s_run_pc~0 2)) (.cse29 (= ~c_empty_rsp~0 1))) (let ((.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse10 (and .cse30 (not .cse21) .cse29)) (.cse31 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 2 ~s_run_st~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse32 (= ~m_run_pc~0 3))) (let ((.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse17 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (and .cse31 .cse4 .cse9 .cse6 .cse21 .cse32 .cse30)) (.cse8 (<= ~a_t~0 0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 2 ~s_run_pc~0)) (.cse3 (= ~s_run_pc~0 0)) (.cse7 (and .cse18 .cse19 (and .cse33 .cse10))) (.cse23 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse24 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (<= 0 ~a_t~0)) (.cse5 (<= ~c_req_type~0 1)) (.cse20 (and .cse33 .cse29 .cse30)) (.cse14 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse26 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (<= ~c_req_d~0 51)) (.cse13 (<= 51 ~c_req_d~0))) (or (and (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7) (= 0 ULTIMATE.start_m_run_~a~0))) .cse8) (and .cse9 .cse10 .cse11) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse12 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse13 .cse14 (<= 1 ~a_t~0) .cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse16) (and .cse8 (and .cse0 .cse1 (and .cse2 (and .cse17 (and .cse4 .cse5 (and .cse18 .cse19 .cse20) .cse6 .cse21)) .cse22))) (and .cse0 .cse1 (and .cse17 .cse16 .cse2 .cse8) .cse23 .cse24 .cse12 .cse25 .cse26 .cse27 .cse22 .cse28) (and (and .cse29 .cse30) .cse4 .cse9 .cse21) (and .cse31 .cse11 .cse32 .cse30 .cse29) (and .cse3 .cse9 .cse7) (and (and .cse23 .cse24 (and .cse2 (and (<= 1 ~c_req_a~0) (and .cse4 .cse5 .cse20 .cse6 .cse21) (<= ~c_req_a~0 1)) .cse14) .cse12 .cse25 .cse26 .cse27 .cse28) .cse15 .cse13))))) [2019-01-12 15:32:51,118 INFO L444 ceAbstractionStarter]: At program point L1208(lines 1201 1227) 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) (<= ~a_t~0 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))) [2019-01-12 15:32:51,118 INFO L444 ceAbstractionStarter]: At program point L812(lines 805 822) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse4 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse5 (= ~m_run_pc~0 6)) (.cse3 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (<= 1 ~a_t~0) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse5) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7))) [2019-01-12 15:32:51,125 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 618) no Hoare annotation was computed. [2019-01-12 15:32:51,125 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2019-01-12 15:32:51,125 INFO L444 ceAbstractionStarter]: At program point L416(lines 409 453) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (or (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) .cse0 (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1 (<= 0 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse6 .cse7 (not .cse4) .cse8) .cse3 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)))) [2019-01-12 15:32:51,126 INFO L444 ceAbstractionStarter]: At program point L350(lines 343 369) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (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) .cse0 (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse1) (= 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) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-01-12 15:32:51,131 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:32:51,131 INFO L448 ceAbstractionStarter]: For program point L284(lines 283 311) no Hoare annotation was computed. [2019-01-12 15:32:51,131 INFO L448 ceAbstractionStarter]: For program point L1275(lines 1275 1279) no Hoare annotation was computed. [2019-01-12 15:32:51,132 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 222) no Hoare annotation was computed. [2019-01-12 15:32:51,132 INFO L444 ceAbstractionStarter]: At program point L945(lines 938 955) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse19 (<= 1 ~c_req_type~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse17 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse21 (= ~m_run_pc~0 3)) (.cse22 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (= ~c_empty_rsp~0 1))) (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 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (and .cse19 .cse20 .cse17 .cse21 .cse22 .cse23)) (.cse4 (<= ~c_req_type~0 1)) (.cse11 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse2 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= 0 ~a_t~0)) (.cse13 (<= ~a_t~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse24 (<= 1 ~c_req_a~0)) (.cse34 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse35 (= 0 ~c_req_type~0)) (.cse32 (and (and .cse20 .cse22 .cse23) .cse3 .cse5 .cse6)) (.cse26 (<= 1 ~a_t~0)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (= ~m_run_pc~0 6)) (.cse27 (= ~s_memory0~0 50)) (.cse25 (<= ~c_req_a~0 1)) (.cse30 (= ~s_memory1~0 51)) (.cse31 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11) .cse12) .cse13 .cse14 .cse15 .cse16) (and .cse12 (and .cse0 .cse1 (and (and .cse3 .cse17 .cse4 (let ((.cse18 (and .cse7 .cse8 .cse10 (and .cse19 .cse20 .cse21 .cse22 (not .cse6) .cse23)))) (or (and (= ~s_run_pc~0 0) .cse18) (and (<= 2 ~s_run_pc~0) .cse18))) .cse5 .cse11) (= 0 ULTIMATE.start_m_run_~a~0)) .cse14 .cse15) .cse13) (and (and (and .cse24 (= 1 ULTIMATE.start_s_run_~req_a~1) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse11) .cse25) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse26 .cse27 .cse28) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) (and .cse29 (= ~req_tt_a~0 0) .cse27 .cse30 .cse31 (and (and (= 0 ~c_req_a~0) (and .cse2 .cse12 .cse32 .cse13) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse33) .cse34 .cse35) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse29 (and .cse24 (and .cse34 .cse35 (and .cse32 .cse26 .cse28 .cse33)) .cse27 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse25) .cse30 .cse31 (= ~req_tt_a~0 1))))) [2019-01-12 15:32:51,133 INFO L448 ceAbstractionStarter]: For program point L813(lines 805 822) no Hoare annotation was computed. [2019-01-12 15:32:51,133 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-01-12 15:32:51,133 INFO L448 ceAbstractionStarter]: For program point L1210(lines 1210 1214) no Hoare annotation was computed. [2019-01-12 15:32:51,133 INFO L448 ceAbstractionStarter]: For program point L1144(lines 1144 1151) no Hoare annotation was computed. [2019-01-12 15:32:51,133 INFO L448 ceAbstractionStarter]: For program point L946(lines 871 1101) no Hoare annotation was computed. [2019-01-12 15:32:51,133 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 818) no Hoare annotation was computed. [2019-01-12 15:32:51,133 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-01-12 15:32:51,133 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 356) no Hoare annotation was computed. [2019-01-12 15:32:51,133 INFO L448 ceAbstractionStarter]: For program point L947(lines 947 951) no Hoare annotation was computed. [2019-01-12 15:32:51,134 INFO L444 ceAbstractionStarter]: At program point L684(lines 677 721) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (and (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)))) (.cse1 (= ~m_run_pc~0 6))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse0 (<= 1 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1) .cse2 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse2 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse7 (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-01-12 15:32:51,135 INFO L444 ceAbstractionStarter]: At program point L552(lines 522 553) the Hoare annotation is: (let ((.cse10 (= ~s_run_pc~0 2))) (let ((.cse2 (not .cse10)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse7 (= 0 ULTIMATE.start_m_run_~req_type___0~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 (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_type~0) .cse5 .cse6 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= ULTIMATE.start_s_memory_write_~v 51) (and (= 0 ~c_req_a~0) (and (and .cse8 .cse0 (and .cse3 .cse4) .cse9 .cse10) (<= 1 ULTIMATE.start_m_run_~a~0)) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6)) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse5 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and .cse8 .cse0 (and (= ~m_run_pc~0 3) .cse3 .cse4) .cse9 .cse10) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0))))) [2019-01-12 15:32:51,135 INFO L448 ceAbstractionStarter]: For program point L751(lines 751 804) no Hoare annotation was computed. [2019-01-12 15:32:51,135 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 756) no Hoare annotation was computed. [2019-01-12 15:32:51,135 INFO L448 ceAbstractionStarter]: For program point L686(lines 686 690) no Hoare annotation was computed. [2019-01-12 15:32:51,135 INFO L444 ceAbstractionStarter]: At program point L620(lines 613 630) 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)))) [2019-01-12 15:32:51,140 INFO L444 ceAbstractionStarter]: At program point L1281(lines 1274 1309) the Hoare annotation is: (let ((.cse23 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse55 (= ~s_run_pc~0 2))) (let ((.cse20 (= ~c_empty_req~0 1)) (.cse26 (<= 2 ~s_run_st~0)) (.cse24 (<= ~c_req_a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse61 (<= 1 ~c_req_type~0)) (.cse41 (= ~m_run_pc~0 3)) (.cse60 (not .cse55)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse54 (and .cse23 .cse19)) (.cse32 (<= 1 ~c_m_lock~0))) (let ((.cse1 (and .cse21 .cse54 .cse32 .cse55)) (.cse15 (= ~s_run_pc~0 0)) (.cse31 (and .cse24 .cse25 (and .cse61 .cse41 .cse23 .cse60 .cse19))) (.cse36 (and .cse20 .cse21 .cse26 .cse32 .cse55 .cse41 .cse23)) (.cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ~c_req_d~0 50)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ~a_t~0)) (.cse17 (<= ~m_run_pc~0 0)) (.cse18 (<= ~a_t~0 0)) (.cse22 (<= ~c_m_lock~0 0)) (.cse43 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse52 (= ~req_tt_a~0 1)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse34 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse35 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse40 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse47 (<= 1 ~a_t~0)) (.cse37 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse45 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse58 (and .cse61 .cse41 .cse23 .cse19)) (.cse50 (<= ~c_req_a~0 1)) (.cse49 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse38 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse56 (<= ~c_req_d~0 51)) (.cse57 (<= 51 ~c_req_d~0)) (.cse42 (<= 2 ~s_run_pc~0)) (.cse5 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse0 (= 0 ~c_req_a~0)) (.cse59 (and .cse21 .cse26 (and .cse20 .cse23) .cse32 .cse55)) (.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse2 (= ~m_run_pc~0 6)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse44 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse12 (= ~req_tt_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse51 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse22 .cse23) (and .cse15 .cse24 .cse25 .cse20 .cse17 .cse26 .cse22 .cse23 .cse19) (and (and .cse27 .cse28 (and .cse29 .cse16 .cse18 (and .cse15 .cse21 .cse30 .cse31 .cse32))) .cse33) (and .cse29 .cse16 (and .cse27 .cse28 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse4 .cse40 .cse18 .cse33) (and (and .cse20 .cse41 .cse23 .cse19) .cse42) (and .cse43 .cse44 (and .cse45 (and .cse46 .cse3 (and .cse47 .cse1 .cse48 .cse49 .cse2)) .cse5 .cse50) .cse7 .cse51 .cse52) (and .cse15 .cse26 .cse31) (and (let ((.cse53 (and (and .cse21 .cse26 .cse54 .cse55) .cse32))) (or (and .cse29 .cse16 .cse18 .cse53 .cse33) (and .cse47 .cse53 .cse49))) .cse2) (and (and (and (= ULTIMATE.start_s_memory_write_~i 1) .cse36) .cse47 .cse5 .cse8 .cse9 .cse49) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse56 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse14 .cse57) (and (and .cse27 .cse28 (and (and .cse29 (and .cse21 .cse30 .cse32 .cse55 (and .cse24 .cse25 .cse58)) .cse18) .cse16)) .cse33) (and .cse21 .cse26 (and .cse41 .cse23 .cse19) .cse55) (and .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse26 .cse55 .cse22 .cse23) (and .cse43 .cse44 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse51 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse52 (and .cse45 .cse5 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse50 (and (and .cse47 .cse59 .cse49 .cse2) .cse46 .cse3) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (and (and .cse20 .cse21 .cse26 .cse42 .cse23 .cse19) .cse47 .cse49) .cse2) (and (and .cse34 .cse35 .cse4 .cse40 .cse47 .cse37 (and .cse45 (and .cse21 .cse30 .cse32 .cse55 .cse58) .cse50) .cse49 .cse38 .cse39) .cse56 .cse57) (and .cse26 .cse42 (and .cse23 .cse60 .cse19)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse7 (and .cse46 .cse3 (and .cse0 .cse59 .cse48 .cse2)) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse44 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 50 ~c_rsp_d~0) .cse13 .cse51))))) [2019-01-12 15:32:51,143 INFO L444 ceAbstractionStarter]: At program point L224(lines 217 261) the Hoare annotation is: (let ((.cse17 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (<= ~m_run_pc~0 0)) (.cse9 (<= 0 ~a_t~0)) (.cse2 (<= ~c_req_type~0 1)) (.cse10 (<= ~a_t~0 0)) (.cse18 (<= ~c_req_d~0 50)) (.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0)) (.cse19 (<= 50 ~c_req_d~0)) (.cse3 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse6 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse22 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse1 (<= 2 ~s_run_st~0)) (.cse21 (<= 2 ~s_run_pc~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_run_pc~0 3) .cse7 .cse8) (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ~c_req_a~0 1)) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse10 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~c_req_d~0 51) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse12 .cse13 .cse7 .cse14 .cse15 .cse1 .cse6 .cse8 (<= 0 ULTIMATE.start_m_run_~a~0) .cse16) (and .cse17 .cse18 .cse19 .cse20 (and .cse0 .cse9 .cse12 .cse13 .cse2 .cse10 .cse21 .cse7 .cse14 .cse15 .cse1 .cse3 .cse4 .cse6 .cse8 .cse16) .cse22) (and .cse17 .cse11 .cse0 .cse12 .cse13 .cse9 .cse2 .cse10 .cse7 .cse18 .cse14 .cse15 .cse19 .cse3 .cse4 .cse6 .cse20 .cse8 .cse22 .cse16) (and .cse1 .cse21 (and (not .cse5) .cse7 .cse8)))) [2019-01-12 15:32:51,148 INFO L448 ceAbstractionStarter]: For program point L1083(lines 1083 1087) no Hoare annotation was computed. [2019-01-12 15:32:51,149 INFO L448 ceAbstractionStarter]: For program point L621(lines 613 630) no Hoare annotation was computed. [2019-01-12 15:32:51,149 INFO L444 ceAbstractionStarter]: At program point L1216(lines 1209 1226) 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) (<= ~a_t~0 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))) [2019-01-12 15:32:51,149 INFO L448 ceAbstractionStarter]: For program point L622(lines 622 626) no Hoare annotation was computed. [2019-01-12 15:32:51,149 INFO L444 ceAbstractionStarter]: At program point L424(lines 417 452) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (or (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) .cse0 (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1 (<= 0 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse6 .cse7 (not .cse4) .cse8) .cse3 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)))) [2019-01-12 15:32:51,150 INFO L444 ceAbstractionStarter]: At program point L490-2(lines 490 518) the Hoare annotation is: (let ((.cse8 (= ~s_run_pc~0 2))) (let ((.cse9 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse5 (<= ~c_m_lock~0 0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse11 (<= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (not .cse8)) (.cse6 (= ~c_empty_rsp~0 1))) (or (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse0 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (and .cse2 .cse3 (and .cse4 (= ~m_run_pc~0 3) .cse5 .cse6 .cse7) .cse8) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~a~0)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= ULTIMATE.start_s_memory_write_~v 51) (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) (and .cse2 .cse3 .cse8 (and .cse4 .cse5 .cse6 .cse7)) (= 1 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse0 .cse1 (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v)) (and (and (<= ULTIMATE.start_m_run_~a~0 0) (and .cse5 .cse7 .cse10 .cse6) (<= 0 ULTIMATE.start_m_run_~a~0)) .cse3 .cse11) (and .cse3 .cse11 (and .cse7 .cse10 (<= 3 ~m_run_pc~0) .cse6))))) [2019-01-12 15:32:51,150 INFO L444 ceAbstractionStarter]: At program point L358(lines 351 368) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2)))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (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) .cse0 (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse1) (= 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) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1287) no Hoare annotation was computed. [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 230) no Hoare annotation was computed. [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point L1217(lines 1165 1344) no Hoare annotation was computed. [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point L491(lines 490 518) no Hoare annotation was computed. [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point L359(lines 129 475) no Hoare annotation was computed. [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1222) no Hoare annotation was computed. [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 496) no Hoare annotation was computed. [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-01-12 15:32:51,153 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 364) no Hoare annotation was computed. [2019-01-12 15:32:51,154 INFO L444 ceAbstractionStarter]: At program point L1021(lines 995 1022) the Hoare annotation is: (let ((.cse24 (= ~m_run_pc~0 3)) (.cse23 (= ~c_empty_req~0 1)) (.cse27 (<= 2 ~c_write_req_ev~0)) (.cse28 (<= 1 ~c_m_lock~0)) (.cse25 (= ~s_run_pc~0 2)) (.cse26 (<= 2 ~c_write_rsp_ev~0)) (.cse33 (= ~c_empty_rsp~0 1))) (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)) (.cse11 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse6 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 0 ~a_t~0)) (.cse12 (<= ~a_t~0 0)) (.cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse8 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse15 (= ~s_memory1~0 51)) (.cse18 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (= 0 ~c_req_type~0)) (.cse16 (and .cse23 .cse27 .cse28 .cse25 .cse26 .cse33)) (.cse17 (= ~m_run_pc~0 6)) (.cse21 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (and .cse27 .cse28 .cse25 (and .cse23 .cse24 .cse26 .cse33))) (.cse10 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse29 (<= 1 ~a_t~0)) (.cse14 (= ~s_memory0~0 50)) (.cse31 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse32 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse14 .cse15 (and (and (= 0 ~c_req_a~0) .cse16 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse17) .cse18 .cse19) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse20 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse21) (and (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 (and .cse4 .cse9 (and (let ((.cse22 (and .cse23 .cse24 (not .cse25) .cse26))) (or (and (= ~s_run_pc~0 0) .cse22) (and (<= 2 ~s_run_pc~0) .cse22))) (<= 1 ~c_req_type~0) .cse27 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse28 (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse12) .cse7 .cse8) .cse13) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse20 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse15 (and (<= 1 ~c_req_a~0) (and .cse18 .cse19 (and .cse16 .cse29 .cse30 .cse17)) .cse14 .cse31 .cse32 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) .cse21 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (and .cse5 .cse10 .cse29 .cse14 .cse31 .cse32 .cse30) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0))))) [2019-01-12 15:32:51,157 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 612) no Hoare annotation was computed. [2019-01-12 15:32:51,157 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 125) no Hoare annotation was computed. [2019-01-12 15:32:51,158 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 830) no Hoare annotation was computed. [2019-01-12 15:32:51,160 INFO L444 ceAbstractionStarter]: At program point L824-1(lines 824 830) the Hoare annotation is: (let ((.cse5 (<= 2 ~c_write_req_ev~0)) (.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)) (.cse3 (= ~s_run_pc~0 2))) (let ((.cse6 (<= 1 ~a_t~0)) (.cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse8 (and .cse5 (and (= ~c_empty_req~0 1) .cse1 .cse2 .cse4) .cse0 .cse3)) (.cse9 (= ~m_run_pc~0 6))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) (<= 3 ~m_run_pc~0) .cse4) (<= 2 ~s_run_pc~0)) (and (and (and (= ~m_run_pc~0 3) .cse1 .cse2 .cse4) .cse5 .cse0 .cse3) .cse6 .cse7) (and .cse6 .cse8 .cse7 .cse9) (and (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (and (= 0 ~c_req_a~0) .cse8 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse9) (= ~s_memory1~0 51) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) (<= ULTIMATE.start_s_memory_write_~v 51) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) (<= 51 ULTIMATE.start_s_memory_write_~v))))) [2019-01-12 15:32:51,160 INFO L444 ceAbstractionStarter]: At program point L758(lines 751 804) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse4 (and (<= 2 ~c_write_req_ev~0) (and (= ~c_empty_req~0 1) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) (<= 2 ~s_run_st~0) (= ~s_run_pc~0 2))) (.cse5 (= ~m_run_pc~0 6)) (.cse3 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (<= 1 ~a_t~0) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse5) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 (and (= 0 ~c_req_a~0) .cse4 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse7))) [2019-01-12 15:32:51,160 INFO L444 ceAbstractionStarter]: At program point L692(lines 685 720) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (and (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (and (= ~c_empty_req~0 1) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)))) (.cse1 (= ~m_run_pc~0 6))) (or (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and .cse0 (<= 1 ~a_t~0) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1) .cse2 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) (= ~req_tt_a~0 1) (<= ~c_req_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 1 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse2 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse7 (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1) (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-01-12 15:32:51,161 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-01-12 15:32:51,162 INFO L444 ceAbstractionStarter]: At program point L1089(lines 1082 1099) the Hoare annotation is: (let ((.cse17 (<= 2 ~c_write_req_ev~0)) (.cse16 (= ~c_empty_req~0 1)) (.cse18 (<= 1 ~c_m_lock~0))) (let ((.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (and .cse17 (let ((.cse19 (and .cse16 (= ~m_run_pc~0 3)))) (or (and (<= 2 ~s_run_pc~0) .cse19) (and (= ~s_run_pc~0 0) .cse19))) .cse18)) (.cse11 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse0 (= ~s_memory0~0 50)) (.cse12 (<= 1 ~a_t~0)) (.cse3 (and .cse16 .cse17 .cse18 (= ~s_run_pc~0 2))) (.cse15 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse1 (= ~s_memory1~0 51)) (.cse9 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (and (and (= 0 ~c_req_a~0) (and .cse3 .cse4) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5 .cse6) .cse7 .cse8) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~a_t~0 0) .cse9) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (and .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0)) (and (and (<= ~c_req_d~0 50) (and .cse4 (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse10) (<= 50 ~c_req_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse11 (= 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)) .cse5) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (and (<= 1 ~c_req_a~0) .cse0 (and (and .cse12 .cse3 .cse15 .cse6) .cse7 .cse8) .cse13 .cse14 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse9 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1))))) [2019-01-12 15:32:51,162 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:32:51,165 INFO L444 ceAbstractionStarter]: At program point L1156(lines 1108 1161) the Hoare annotation is: (let ((.cse23 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse55 (= ~s_run_pc~0 2))) (let ((.cse20 (= ~c_empty_req~0 1)) (.cse26 (<= 2 ~s_run_st~0)) (.cse24 (<= ~c_req_a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse61 (<= 1 ~c_req_type~0)) (.cse41 (= ~m_run_pc~0 3)) (.cse60 (not .cse55)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse54 (and .cse23 .cse19)) (.cse32 (<= 1 ~c_m_lock~0))) (let ((.cse1 (and .cse21 .cse54 .cse32 .cse55)) (.cse15 (= ~s_run_pc~0 0)) (.cse31 (and .cse24 .cse25 (and .cse61 .cse41 .cse23 .cse60 .cse19))) (.cse36 (and .cse20 .cse21 .cse26 .cse32 .cse55 .cse41 .cse23)) (.cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ~c_req_d~0 50)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ~a_t~0)) (.cse17 (<= ~m_run_pc~0 0)) (.cse18 (<= ~a_t~0 0)) (.cse22 (<= ~c_m_lock~0 0)) (.cse43 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse52 (= ~req_tt_a~0 1)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse34 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse35 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse40 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse47 (<= 1 ~a_t~0)) (.cse37 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse45 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse58 (and .cse61 .cse41 .cse23 .cse19)) (.cse50 (<= ~c_req_a~0 1)) (.cse49 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse38 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse56 (<= ~c_req_d~0 51)) (.cse57 (<= 51 ~c_req_d~0)) (.cse42 (<= 2 ~s_run_pc~0)) (.cse5 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse0 (= 0 ~c_req_a~0)) (.cse59 (and .cse21 .cse26 (and .cse20 .cse23) .cse32 .cse55)) (.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse2 (= ~m_run_pc~0 6)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse44 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse12 (= ~req_tt_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse51 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse22 .cse23) (and .cse15 .cse24 .cse25 .cse20 .cse17 .cse26 .cse22 .cse23 .cse19) (and (and .cse27 .cse28 (and .cse29 .cse16 .cse18 (and .cse15 .cse21 .cse30 .cse31 .cse32))) .cse33) (and .cse29 .cse16 (and .cse27 .cse28 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse4 .cse40 .cse18 .cse33) (and (and .cse20 .cse41 .cse23 .cse19) .cse42) (and .cse43 .cse44 (and .cse45 (and .cse46 .cse3 (and .cse47 .cse1 .cse48 .cse49 .cse2)) .cse5 .cse50) .cse7 .cse51 .cse52) (and .cse15 .cse26 .cse31) (and (let ((.cse53 (and (and .cse21 .cse26 .cse54 .cse55) .cse32))) (or (and .cse29 .cse16 .cse18 .cse53 .cse33) (and .cse47 .cse53 .cse49))) .cse2) (and (and (and (= ULTIMATE.start_s_memory_write_~i 1) .cse36) .cse47 .cse5 .cse8 .cse9 .cse49) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse56 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse14 .cse57) (and (and .cse27 .cse28 (and (and .cse29 (and .cse21 .cse30 .cse32 .cse55 (and .cse24 .cse25 .cse58)) .cse18) .cse16)) .cse33) (and .cse21 .cse26 (and .cse41 .cse23 .cse19) .cse55) (and .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse26 .cse55 .cse22 .cse23) (and .cse43 .cse44 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse51 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse52 (and .cse45 .cse5 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse50 (and (and .cse47 .cse59 .cse49 .cse2) .cse46 .cse3) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (and (and .cse20 .cse21 .cse26 .cse42 .cse23 .cse19) .cse47 .cse49) .cse2) (and (and .cse34 .cse35 .cse4 .cse40 .cse47 .cse37 (and .cse45 (and .cse21 .cse30 .cse32 .cse55 .cse58) .cse50) .cse49 .cse38 .cse39) .cse56 .cse57) (and .cse26 .cse42 (and .cse23 .cse60 .cse19)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse7 (and .cse46 .cse3 (and .cse0 .cse59 .cse48 .cse2)) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse44 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 50 ~c_rsp_d~0) .cse13 .cse51))))) [2019-01-12 15:32:51,166 INFO L448 ceAbstractionStarter]: For program point L1090(lines 1082 1099) no Hoare annotation was computed. [2019-01-12 15:32:51,169 INFO L448 ceAbstractionStarter]: For program point L760(lines 760 764) no Hoare annotation was computed. [2019-01-12 15:32:51,169 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 698) no Hoare annotation was computed. [2019-01-12 15:32:51,170 INFO L444 ceAbstractionStarter]: At program point L1289(lines 1282 1308) the Hoare annotation is: (let ((.cse23 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse55 (= ~s_run_pc~0 2))) (let ((.cse20 (= ~c_empty_req~0 1)) (.cse26 (<= 2 ~s_run_st~0)) (.cse24 (<= ~c_req_a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse61 (<= 1 ~c_req_type~0)) (.cse41 (= ~m_run_pc~0 3)) (.cse60 (not .cse55)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse54 (and .cse23 .cse19)) (.cse32 (<= 1 ~c_m_lock~0))) (let ((.cse1 (and .cse21 .cse54 .cse32 .cse55)) (.cse15 (= ~s_run_pc~0 0)) (.cse31 (and .cse24 .cse25 (and .cse61 .cse41 .cse23 .cse60 .cse19))) (.cse36 (and .cse20 .cse21 .cse26 .cse32 .cse55 .cse41 .cse23)) (.cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ~c_req_d~0 50)) (.cse28 (<= 50 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ~a_t~0)) (.cse17 (<= ~m_run_pc~0 0)) (.cse18 (<= ~a_t~0 0)) (.cse22 (<= ~c_m_lock~0 0)) (.cse43 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse52 (= ~req_tt_a~0 1)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse34 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse35 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse40 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse47 (<= 1 ~a_t~0)) (.cse37 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse45 (<= 1 ~c_req_a~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse58 (and .cse61 .cse41 .cse23 .cse19)) (.cse50 (<= ~c_req_a~0 1)) (.cse49 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse38 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse56 (<= ~c_req_d~0 51)) (.cse57 (<= 51 ~c_req_d~0)) (.cse42 (<= 2 ~s_run_pc~0)) (.cse5 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse46 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse0 (= 0 ~c_req_a~0)) (.cse59 (and .cse21 .cse26 (and .cse20 .cse23) .cse32 .cse55)) (.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse2 (= ~m_run_pc~0 6)) (.cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse44 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse12 (= ~req_tt_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse51 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse22 .cse23) (and .cse15 .cse24 .cse25 .cse20 .cse17 .cse26 .cse22 .cse23 .cse19) (and (and .cse27 .cse28 (and .cse29 .cse16 .cse18 (and .cse15 .cse21 .cse30 .cse31 .cse32))) .cse33) (and .cse29 .cse16 (and .cse27 .cse28 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse4 .cse40 .cse18 .cse33) (and (and .cse20 .cse41 .cse23 .cse19) .cse42) (and .cse43 .cse44 (and .cse45 (and .cse46 .cse3 (and .cse47 .cse1 .cse48 .cse49 .cse2)) .cse5 .cse50) .cse7 .cse51 .cse52) (and .cse15 .cse26 .cse31) (and (let ((.cse53 (and (and .cse21 .cse26 .cse54 .cse55) .cse32))) (or (and .cse29 .cse16 .cse18 .cse53 .cse33) (and .cse47 .cse53 .cse49))) .cse2) (and (and (and (= ULTIMATE.start_s_memory_write_~i 1) .cse36) .cse47 .cse5 .cse8 .cse9 .cse49) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse56 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse14 .cse57) (and (and .cse27 .cse28 (and (and .cse29 (and .cse21 .cse30 .cse32 .cse55 (and .cse24 .cse25 .cse58)) .cse18) .cse16)) .cse33) (and .cse21 .cse26 (and .cse41 .cse23 .cse19) .cse55) (and .cse16 .cse17 .cse3 .cse18 .cse19 .cse0 .cse20 .cse21 .cse26 .cse55 .cse22 .cse23) (and .cse43 .cse44 (= 51 ~c_rsp_d~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse51 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse52 (and .cse45 .cse5 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse50 (and (and .cse47 .cse59 .cse49 .cse2) .cse46 .cse3) (<= ULTIMATE.start_s_memory_read_~i 1)) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (and (and .cse20 .cse21 .cse26 .cse42 .cse23 .cse19) .cse47 .cse49) .cse2) (and (and .cse34 .cse35 .cse4 .cse40 .cse47 .cse37 (and .cse45 (and .cse21 .cse30 .cse32 .cse55 .cse58) .cse50) .cse49 .cse38 .cse39) .cse56 .cse57) (and .cse26 .cse42 (and .cse23 .cse60 .cse19)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse7 (and .cse46 .cse3 (and .cse0 .cse59 .cse48 .cse2)) .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse44 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 50 ~c_rsp_d~0) .cse13 .cse51))))) [2019-01-12 15:32:51,172 INFO L444 ceAbstractionStarter]: At program point L232(lines 225 260) the Hoare annotation is: (let ((.cse19 (= ~s_run_pc~0 2))) (let ((.cse0 (not .cse19)) (.cse12 (<= ~c_req_a~0 0)) (.cse13 (<= 0 ~c_req_a~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse21 (<= 1 ~c_req_type~0)) (.cse22 (<= ~m_run_pc~0 0)) (.cse23 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse24 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse15 (and .cse21 (or (and .cse22 .cse2 .cse1) (and .cse23 .cse1 .cse2)) .cse24)) (.cse3 (<= 2 ~s_run_st~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ~s_run_pc~0 0)) (.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (<= 0 ~a_t~0)) (.cse5 (and (and .cse21 (or (and .cse22 .cse2 .cse0 .cse1) (and .cse23 .cse0 .cse1 .cse2)) .cse24) .cse12 (<= ULTIMATE.start_m_run_~a~0 0) .cse13 .cse14 (<= 0 ULTIMATE.start_m_run_~a~0) .cse16)) (.cse11 (<= ~c_req_type~0 1)) (.cse10 (<= ~a_t~0 0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse3 .cse5) (and .cse6 .cse7 .cse8 (and .cse9 .cse10 (and .cse3 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19)) .cse20 (= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse10 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~a~0 1) (and .cse15 .cse3 .cse11 .cse17 .cse18 .cse19) (<= ~c_req_a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~c_req_d~0 51) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse6 .cse4 .cse7 .cse8 .cse9 .cse5 .cse11 .cse10 .cse17 .cse18 .cse20))))) [2019-01-12 15:32:51,174 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 124) no Hoare annotation was computed. [2019-01-12 15:32:51,175 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1095) no Hoare annotation was computed. [2019-01-12 15:32:51,175 INFO L444 ceAbstractionStarter]: At program point L101(lines 96 838) 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)) [2019-01-12 15:32:51,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:32:51 BoogieIcfgContainer [2019-01-12 15:32:51,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:32:51,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:32:51,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:32:51,436 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:32:51,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:29:29" (3/4) ... [2019-01-12 15:32:51,446 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:32:51,483 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:32:51,485 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 15:32:51,523 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) [2019-01-12 15:32:51,525 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,525 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && (((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) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((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)) || ((((((51 <= req_d && (((((((((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) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && (a <= 0 && 0 <= a_t) && (((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == 0) && a_t <= 0) && 0 <= a)) || (((((((((1 == req_a___0 && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && (req_type == 0 && ((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && 0 == c_req_type) && i <= 1) && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) [2019-01-12 15:32:51,526 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,526 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,526 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,526 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((((1 <= a_t && 1 <= c_m_lock && ((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= a) || ((0 <= a_t && (a <= 0 && a_t <= 0) && 1 <= c_m_lock && ((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a)) && m_run_pc == 6)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && (((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) && m_run_pc == 6) && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && ((1 <= 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) && 1 <= a) && m_run_pc == 6) && 0 == c_req_type) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) [2019-01-12 15:32:51,527 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,530 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,531 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((req_a == i && 1 <= a_t) && (2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) || (((((c_req_d <= 50 && 50 <= c_req_d) && a <= 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) && 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) && a_t <= 0) && 0 <= a)) || ((((2 <= c_write_req_ev && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && (((((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)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && ((a <= 0 && (2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && 0 <= a_t) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && (((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((50 == \result && s_memory0 == 50) && ((((0 == c_req_a && (((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) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,531 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && ((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) || (((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && ((((0 == c_req_a && ((((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 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && ((a <= 0 && 0 <= a_t) && (((((((s_run_pc == 0 && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) || (2 <= s_run_pc && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev)) && 1 <= c_req_type) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((((((1 == req_a___0 && v <= 51) && 51 == x) && s_memory1 == 51) && ((((((1 <= c_req_a && (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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && ((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && v == req_d) && 51 <= c_req_d) [2019-01-12 15:32:51,532 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((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) || ((1 <= a_t && 2 <= a) && (((((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)) || (((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && 0 == req_a___0) && 50 == rsp_d) && (((0 == c_req_a && 0 == req_a) && 1 <= a) && ((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) && m_run_pc == 6) && v <= 51) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || ((((((((((((((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) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a)) || (((1 <= 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) && 2 <= a) && m_run_pc == 6)) || (((((((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) [2019-01-12 15:32:51,533 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 <= c_req_a && ((1 <= a_t && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && v <= 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) && c_req_a <= 1) || ((1 <= 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 && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 6)) || ((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && ((0 == c_req_a && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 == req_a) && m_run_pc == 6) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || (((((((((((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 1 <= a_t) && m_run_pc == 6) && i <= 1)) || ((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)) || (((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 6) && 0 == c_req_a) && req_tt_a == 0) && v == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) [2019-01-12 15:32:51,538 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((req_a == i && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && ((2 <= c_write_req_ev && 2 <= s_run_st) && (((c_empty_req == 1 && m_run_pc == 3) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 0 == req_a___0) && 0 == req_type___0) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a) || (((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && 1 <= a) && 0 == req_type___0) && 50 == rsp_d) && v <= 51) && a <= 1) && 50 == c_rsp_d) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && ((c_empty_req == 1 && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == c_req_a) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v)) || ((((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) [2019-01-12 15:32:51,538 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(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)) || (((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && req_a___0 <= 1) && 1 <= a) && 0 == req_type___0) && 50 == rsp_d) && v <= 51) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || (((((((((((((req_a == i && s_memory0 == 50) && s_memory1 == 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) && s_run_pc == 2) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) && 0 == req_type___0) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a) [2019-01-12 15:32:51,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) [2019-01-12 15:32:51,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((req_a == i && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && (((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) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) && 0 == req_type___0) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a) || ((((((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)) || ((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 0 == req_type___0) && 50 == rsp_d) && v <= 51) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && ((0 == c_req_a && ((((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 0 == req_a) && m_run_pc == 6)) || ((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) [2019-01-12 15:32:51,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) [2019-01-12 15:32:51,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((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)) || ((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 0 == req_type___0) && 50 == rsp_d) && v <= 51) && ((0 == c_req_a && ((((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 0 == req_a) && m_run_pc == 6) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || (((((((((((((req_a == i && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a___0) && 0 == req_type___0) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a) [2019-01-12 15:32:51,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) [2019-01-12 15:32:51,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && (((((0 == c_req_a && (((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 0) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || ((((((51 <= req_d && (((((((2 <= c_write_req_ev && ((2 <= s_run_pc && c_empty_req == 1 && m_run_pc == 3) || (s_run_pc == 0 && c_empty_req == 1 && m_run_pc == 3))) && 1 <= c_m_lock) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((((((c_req_d <= 50 && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (2 <= c_write_req_ev && ((2 <= s_run_pc && c_empty_req == 1 && m_run_pc == 3) || (s_run_pc == 0 && c_empty_req == 1 && m_run_pc == 3))) && 1 <= c_m_lock) && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && s_memory0 == 50) && ((((1 <= a_t && ((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) [2019-01-12 15:32:51,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) [2019-01-12 15:32:51,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) [2019-01-12 15:32:51,544 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && (1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && (((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) && 1 <= a) && 0 == req_a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && req_tt_a == 1) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((1 == req_a___0 && v <= 51) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && (((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) && 1 <= a) && 0 == req_a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1)) || (((1 <= 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) && 1 <= a) && m_run_pc == 6)) || ((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && ((((((((a <= 0 && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 == c_req_a) && 0 == req_a) && m_run_pc == 6) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && 0 <= a)) || (((((((a <= 0 && (s_memory0 == 50 && (0 == c_req_a && (i == 1 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a_t) && 0 == c_req_type) && 0 == req_a___0) && 1 <= req_a) && req_a <= 1) && 0 <= a) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d)) || ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((((((((((1 == req_a___0 && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && i <= 1) [2019-01-12 15:32:51,544 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 0 == 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) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || ((((((((((((((((((1 == req_a___0 && ((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) [2019-01-12 15:32:51,545 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((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)) || (((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 1 <= a_t) && v == req_d) && 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_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && 50 == x) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,545 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == req_a___0 && v <= 51) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) || ((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && v <= 51) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && (((0 == c_req_a && 0 == i) && 0 == req_a) && a <= 0 && ((((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) && m_run_pc == 6) && 0 <= a) [2019-01-12 15:32:51,545 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((req_a == i && 0 == c_req_type) && ((2 <= s_run_st && (m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 1 <= a_t) && v == req_d) && 0 == a)) || (((((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,545 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && (((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))) && s_run_pc == 2) && v == req_d) && 0 == a)) || (((((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,546 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && (((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))) && s_run_pc == 2) && v == req_d) && 0 == a)) || (((((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,546 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && (((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))) && s_run_pc == 2) && v == req_d) && 0 == a)) || (((((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,547 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) [2019-01-12 15:32:51,547 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) [2019-01-12 15:32:51,547 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) [2019-01-12 15:32:51,547 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) [2019-01-12 15:32:51,555 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) [2019-01-12 15:32:51,555 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) [2019-01-12 15:32:51,555 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && (((((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == c_req_a) && 0 == req_a) && m_run_pc == 6) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((((((((((((1 == req_a___0 && ((1 <= a_t && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) [2019-01-12 15:32:51,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,560 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,560 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,560 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,563 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((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) || ((((((((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_t) && 1 <= a)) || (((1 <= 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)) || (((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) [2019-01-12 15:32:51,727 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:32:51,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:32:51,728 INFO L168 Benchmark]: Toolchain (without parser) took 205104.65 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 951.3 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 517.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:32:51,732 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-12 15:32:51,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 584.60 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:32:51,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 188.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:32:51,733 INFO L168 Benchmark]: Boogie Preprocessor took 82.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:32:51,738 INFO L168 Benchmark]: RCFGBuilder took 2049.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.5 MB). Peak memory consumption was 80.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:32:51,738 INFO L168 Benchmark]: TraceAbstraction took 201902.63 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-01-12 15:32:51,738 INFO L168 Benchmark]: Witness Printer took 291.56 ms. Allocated memory is still 3.4 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:32:51,746 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.16 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 584.60 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 924.5 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 188.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2049.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.5 MB). Peak memory consumption was 80.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 201902.63 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 291.56 ms. Allocated memory is still 3.4 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. 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: 669]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) - InvariantResult [Line: 914]: Loop Invariant Derived loop invariant: (((((((((c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && ((((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 && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && req_type <= 1) && 0 <= a_t) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((0 <= a_t && (((c_req_d <= 50 && 50 <= c_req_d) && (((((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) && a_t <= 0)) || ((((((((((((1 <= c_req_a && 1 == req_a) && ((((2 <= c_write_req_ev && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= 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) && req_type <= 1) && c_req_a <= 1) && 50 <= v) && v <= 50) && 1 <= a_t) && s_memory0 == 50) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d)) || (((((((v <= 51 && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((0 == c_req_a && ((a <= 0 && 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) && a_t <= 0) && 0 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 0 <= a)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) - InvariantResult [Line: 873]: Loop Invariant Derived loop invariant: ((((((((((((1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= v) && v <= 50) && 1 <= a_t) && s_memory0 == 50) && 1 <= a) && c_req_d <= 51) && 51 <= c_req_d) || ((a_t <= 0 && (c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && 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) && 0 <= a)) || (((((c_req_d <= 50 && 50 <= c_req_d) && a <= 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) && 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) && a_t <= 0) && 0 <= a)) || ((((((((v <= 51 && req_tt_a == 0) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && 0 == req_a___0) && 0 <= a)) || (((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) && ((1 <= c_req_a && 0 == c_req_type && ((1 <= a_t && 1 <= a) && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) - InvariantResult [Line: 1082]: Loop Invariant Derived loop invariant: (((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && (((((0 == c_req_a && (((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 0) && 0 == req_a) && 0 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || ((((((51 <= req_d && (((((((2 <= c_write_req_ev && ((2 <= s_run_pc && c_empty_req == 1 && m_run_pc == 3) || (s_run_pc == 0 && c_empty_req == 1 && m_run_pc == 3))) && 1 <= c_m_lock) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((((((c_req_d <= 50 && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (2 <= c_write_req_ev && ((2 <= s_run_pc && c_empty_req == 1 && m_run_pc == 3) || (s_run_pc == 0 && c_empty_req == 1 && m_run_pc == 3))) && 1 <= c_m_lock) && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && s_memory0 == 50) && ((((1 <= a_t && ((c_empty_req == 1 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) - InvariantResult [Line: 559]: 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)) || (((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 1 <= a_t) && v == req_d) && 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_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && 50 == x) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) - InvariantResult [Line: 567]: 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) || (((((((((((((req_a == i && 0 == c_req_type) && ((2 <= s_run_st && (m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 1 <= a_t) && v == req_d) && 0 == a)) || (((((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 522]: 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)) || ((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 0 == req_type___0) && 50 == rsp_d) && v <= 51) && ((0 == c_req_a && ((((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 0 == req_a) && m_run_pc == 6) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || (((((((((((((req_a == i && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a___0) && 0 == req_type___0) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a) - InvariantResult [Line: 489]: 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)) || (((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && ((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && req_a___0 <= 1) && 1 <= a) && 0 == req_type___0) && 50 == rsp_d) && v <= 51) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || (((((((((((((req_a == i && s_memory0 == 50) && s_memory1 == 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) && s_run_pc == 2) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) && 0 == req_type___0) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a) - InvariantResult [Line: 1258]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 742]: Loop Invariant Derived loop invariant: (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && (((((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == c_req_a) && 0 == req_a) && m_run_pc == 6) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((((((((((((1 == req_a___0 && ((1 <= a_t && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) - InvariantResult [Line: 1266]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 677]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: (((((((((c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && ((((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 && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && req_type <= 1) && 0 <= a_t) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((0 <= a_t && (((c_req_d <= 50 && 50 <= c_req_d) && (((((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) && a_t <= 0)) || ((((((((((((1 <= c_req_a && 1 == req_a) && ((((2 <= c_write_req_ev && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= 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) && req_type <= 1) && c_req_a <= 1) && 50 <= v) && v <= 50) && 1 <= a_t) && s_memory0 == 50) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d)) || (((((((v <= 51 && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((0 == c_req_a && ((a <= 0 && 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) && a_t <= 0) && 0 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 0 <= a)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: ((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((0 == c_req_a && 0 == 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) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || ((((((((((((((((((1 == req_a___0 && ((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((req_d <= 50 && 0 == c_req_a) && 0 == c_req_type) && (0 <= a_t && (((((((((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) && a_t <= 0) && 50 <= req_d) && 0 == a) || ((((((((((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)) || ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((req_d <= 50 && s_run_pc == 0) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || ((((((((((((50 <= v && v <= 50) && req_a == i) && s_memory0 == req_d) && ((((req_a <= 1 && (((((((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) && req_type <= 1) && s_run_pc == 2) && 1 <= req_type) && 0 <= a_t) && 1 <= req_a) && a_t <= 0) && 1 <= a) && 51 <= req_d) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a <= 1) && req_a == 0) && req_d <= 51) && req_d <= 50) - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: ((((((((((((1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= v) && v <= 50) && 1 <= a_t) && s_memory0 == 50) && 1 <= a) && c_req_d <= 51) && 51 <= c_req_d) || ((a_t <= 0 && (c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && 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) && 0 <= a)) || (2 <= s_run_pc && ((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((v <= 51 && req_tt_a == 0) && ((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && 0 == req_a___0) && 0 <= a)) || (((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) && ((1 <= c_req_a && 0 == c_req_type && ((1 <= a_t && 1 <= a) && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) - InvariantResult [Line: 685]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) - InvariantResult [Line: 930]: Loop Invariant Derived loop invariant: (((((((((c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && ((((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 && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && req_type <= 1) && 0 <= a_t) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((0 <= a_t && (((c_req_d <= 50 && 50 <= c_req_d) && (((((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) && a_t <= 0)) || ((((((((((((1 <= c_req_a && 1 == req_a) && ((((2 <= c_write_req_ev && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= 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) && req_type <= 1) && c_req_a <= 1) && 50 <= v) && v <= 50) && 1 <= a_t) && s_memory0 == 50) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d)) || (((((((v <= 51 && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((0 == c_req_a && ((a <= 0 && 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) && a_t <= 0) && 0 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 0 <= a)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) - InvariantResult [Line: 480]: 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) || ((1 <= a_t && 2 <= a) && (((((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)) || (((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && 0 == req_a___0) && 50 == rsp_d) && (((0 == c_req_a && 0 == req_a) && 1 <= a) && ((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) && m_run_pc == 6) && v <= 51) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || ((((((((((((((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) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a)) || (((1 <= 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) && 2 <= a) && m_run_pc == 6)) || (((((((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) - InvariantResult [Line: 392]: 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) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && (((((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) && 1 <= a_t) && c_req_d <= 51) && v == req_d)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((((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) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: (((((((((((((((((req_a == i && 1 <= a_t) && (2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) || (((((c_req_d <= 50 && 50 <= c_req_d) && a <= 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) && 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) && a_t <= 0) && 0 <= a)) || ((((2 <= c_write_req_ev && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && (((((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)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && ((a <= 0 && (2 <= c_write_req_ev && 1 <= c_m_lock) && (c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && 0 <= a_t) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && (((c_empty_req == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((50 == \result && s_memory0 == 50) && ((((0 == c_req_a && (((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) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && c_req_d <= 51) && v == req_d) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 575]: 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) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && (((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))) && s_run_pc == 2) && v == req_d) && 0 == a)) || (((((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((1 <= c_req_type && 50 <= v) && req_a == i) && 1 <= req_a) && c_req_type <= 1) && a_t <= 0) && 2 <= s_run_pc) && s_memory0 == req_d) && c_empty_rsp == 1) && 1 <= a) && 2 <= s_run_st) && a <= 1) && req_a == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && req_d <= 51) && v <= 50) && 0 <= a_t) && 51 <= c_req_d) && m_run_pc == 3) && 51 <= req_d) && c_req_a <= 1) && 50 <= req_d) && 1 <= c_req_a) && req_a <= 1) && c_req_d <= 51) && 2 <= c_write_rsp_ev) && req_d <= 50) || ((((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 && c_req_d <= 50) && 50 <= c_req_d) && 50 <= req_d) && ((((((((((((((1 <= c_req_type && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 == 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) && a_t <= 0) && 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: 1346]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && c_req_d <= 51) && v == req_d) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 583]: 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) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && (((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))) && s_run_pc == 2) && v == req_d) && 0 == a)) || (((((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && 1 <= a_t) && c_req_d <= 51) && v == req_d) || (((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && (((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 824]: 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) || ((((((((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_t) && 1 <= a)) || (((1 <= 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)) || (((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 1274]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 751]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 225]: 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 && c_req_d <= 50) && 50 <= c_req_d) && (0 <= a_t && a_t <= 0) && ((((2 <= s_run_st && c_req_type <= 1) && (((c_req_a <= 0 && 0 <= c_req_a) && req_a <= 0) && (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))) && 1 <= req_type) && 0 <= req_a) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= req_d) && 0 == a)) || (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && a_t <= 0) && s_memory0 == req_d) && 51 <= c_req_d) && 51 <= req_d) && 50 <= req_d) && (((((1 <= c_req_a && req_a <= 1) && 1 <= req_a) && a <= 1) && ((((((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))) && 1 <= req_type) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_a <= 1) && 1 <= a) && req_a == 0) && c_req_d <= 51) && req_d <= 51) && req_d <= 50)) || ((((((((((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) && a_t <= 0) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d) - InvariantResult [Line: 1282]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && (req_a <= 1 && ((((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && ((1 <= req_type && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 1 <= req_a) && a_t <= 0) && s_memory0 == req_d) && 51 <= req_d) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a <= 1) && req_a == 0) && req_d <= 51) && req_d <= 50) || (((((((((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)) || ((((((((((((((((req_d <= 50 && s_run_pc == 0) && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && a_t <= 0) && 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 == c_req_a) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 50 <= req_d) && ((((((((((a <= 0 && req_a <= 0) && m_run_pc <= 0) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 <= a)) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 759]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && (((1 <= c_req_a && req_a <= 1) && ((((((((1 <= c_req_type && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= req_a) && c_req_a <= 1) && v <= 50) && 0 <= a_t) && req_a == i) && a_t <= 0) && s_memory0 == req_d) && 51 <= c_req_d) && 51 <= req_d) && 1 <= a) && 50 <= req_d) && a <= 1) && req_a == 0) && c_req_d <= 51) && req_d <= 51) && req_d <= 50) || ((((((((((((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 && c_req_d <= 50) && 50 <= c_req_d) && 50 <= req_d) && ((((((((((((((1 <= c_req_type && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 == 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) && a_t <= 0) && 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: 960]: Loop Invariant Derived loop invariant: (((((((((c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && ((((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 && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && req_type <= 1) && 0 <= a_t) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((0 <= a_t && (((c_req_d <= 50 && 50 <= c_req_d) && (((((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) && a_t <= 0)) || ((((((((((((1 <= c_req_a && 1 == req_a) && ((((2 <= c_write_req_ev && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= 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) && req_type <= 1) && c_req_a <= 1) && 50 <= v) && v <= 50) && 1 <= a_t) && s_memory0 == 50) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d)) || (((((((v <= 51 && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((0 == c_req_a && ((a <= 0 && 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) && a_t <= 0) && 0 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 0 <= a)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) - InvariantResult [Line: 938]: Loop Invariant Derived loop invariant: (((((((((c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && ((((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 && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && req_type <= 1) && 0 <= a_t) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((0 <= a_t && (((c_req_d <= 50 && 50 <= c_req_d) && (((((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) && a_t <= 0)) || ((((((((((((1 <= c_req_a && 1 == req_a) && ((((2 <= c_write_req_ev && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= 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) && req_type <= 1) && c_req_a <= 1) && 50 <= v) && v <= 50) && 1 <= a_t) && s_memory0 == 50) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d)) || (((((((v <= 51 && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((0 == c_req_a && ((a <= 0 && 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) && a_t <= 0) && 0 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 0 <= a)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) - InvariantResult [Line: 233]: 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 && c_req_d <= 50) && 50 <= c_req_d) && (0 <= a_t && a_t <= 0) && ((((2 <= s_run_st && c_req_type <= 1) && (((c_req_a <= 0 && 0 <= c_req_a) && req_a <= 0) && (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))) && 1 <= req_type) && 0 <= req_a) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= req_d) && 0 == a)) || (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && a_t <= 0) && s_memory0 == req_d) && 51 <= c_req_d) && 51 <= req_d) && 50 <= req_d) && (((((1 <= c_req_a && req_a <= 1) && 1 <= req_a) && a <= 1) && ((((((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))) && 1 <= req_type) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_a <= 1) && 1 <= a) && req_a == 0) && c_req_d <= 51) && req_d <= 51) && req_d <= 50)) || ((((((((((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) && a_t <= 0) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d) - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: ((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && s_memory0 == req_d) && ((((((((a <= 0 && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && 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)) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 613]: 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: 335]: Loop Invariant Derived loop invariant: ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && c_req_d <= 51) && v == req_d) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 591]: 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) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && 0 <= a_t && ((2 <= s_run_st && 1 <= c_m_lock) && (((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))) && s_run_pc == 2) && v == req_d) && 0 == a)) || (((((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && req_a___0 <= 1) && 1 <= a) && c_req_a <= 1) && 0 == req_type___0) && 50 == rsp_d) && 1 <= c_req_a) && v <= 51) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= c_req_a && ((1 <= a_t && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && m_run_pc == 6) && v <= 51) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) && c_req_a <= 1) || ((1 <= 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 && 3 <= m_run_pc) && c_empty_rsp == 1) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 6)) || ((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && ((0 == c_req_a && ((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 == req_a) && m_run_pc == 6) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || (((((((((((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 1 <= a_t) && m_run_pc == 6) && i <= 1)) || ((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)) || (((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 6) && 0 == c_req_a) && req_tt_a == 0) && v == req_d) && (0 <= a_t && ((2 <= c_write_req_ev && (2 <= c_write_rsp_ev && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a_t <= 0) - InvariantResult [Line: 1114]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && c_req_d <= 51) && v == req_d) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (((((((1 == req_a___0 && v <= 51) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) || ((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && v <= 51) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && (req_type == 0 && 0 == c_req_type) && (((0 == c_req_a && 0 == i) && 0 == req_a) && a <= 0 && ((((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) && m_run_pc == 6) && 0 <= a) - InvariantResult [Line: 1312]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((((1 <= a_t && 1 <= c_m_lock && ((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 1 <= a) || ((0 <= a_t && (a <= 0 && a_t <= 0) && 1 <= c_m_lock && ((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a)) && m_run_pc == 6)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((((req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && (((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) && m_run_pc == 6) && 50 == \result) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || (((((((((1 == req_a___0 && v <= 51) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (req_type == 0 && ((1 <= 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) && 1 <= a) && m_run_pc == 6) && 0 == c_req_type) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) - InvariantResult [Line: 1290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 723]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && ((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || ((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 51 <= v) && ((0 == c_req_a && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == req_a) && m_run_pc == 6) && 0 <= a) - InvariantResult [Line: 775]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 96]: 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: 67]: Loop Invariant Derived loop invariant: (((((((51 <= req_d && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && (((((req_a == i && 1 <= a_t) && (((((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && v == req_d) && 51 <= c_req_d) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((0 <= a_t && req_a == i) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && (((((((2 <= s_run_pc && ((((c_empty_req == 1 && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || (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)) && 1 <= c_req_type) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 == a) && 50 <= req_d) && req_d <= 50) && req_a == 0) && a_t <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((0 == c_req_a && 0 == i) && ((((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) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 51 <= v) && 0 == req_a___0) || ((((((1 == req_a___0 && v <= 51) && 51 == x) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) && ((((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) - InvariantResult [Line: 409]: Loop Invariant Derived loop invariant: ((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && s_memory0 == req_d) && ((((((((a <= 0 && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && 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)) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 1177]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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: 523]: Loop Invariant Derived loop invariant: (((((((((((((((req_a == i && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && (((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) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 0 == req_a___0) && 0 == req_type___0) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a) || ((((((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)) || ((((((((((((((((req_type == 0 && 50 == \result) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && 0 == req_type___0) && 50 == rsp_d) && v <= 51) && 50 == x) && a <= 1) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && ((0 == c_req_a && ((((2 <= c_write_req_ev && 2 <= s_run_st) && (c_empty_req == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && 0 == req_a) && m_run_pc == 6)) || ((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: 417]: Loop Invariant Derived loop invariant: ((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && s_memory0 == req_d) && ((((((((a <= 0 && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && 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)) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((req_a == i && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && ((2 <= c_write_req_ev && 2 <= s_run_st) && (((c_empty_req == 1 && m_run_pc == 3) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && s_run_pc == 2) && 0 == req_a___0) && 0 == req_type___0) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 0 == a) || (((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && 1 <= a) && 0 == req_type___0) && 50 == rsp_d) && v <= 51) && a <= 1) && 50 == c_rsp_d) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && ((c_empty_req == 1 && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == c_req_a) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v)) || ((((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) - InvariantResult [Line: 1185]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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: 373]: Loop Invariant Derived loop invariant: ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && c_req_d <= 51) && v == req_d) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && c_req_d <= 51) && v == req_d) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && ((((((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) && 1 <= c_m_lock) && s_run_pc == 2) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 241]: 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 && c_req_d <= 50) && 50 <= c_req_d) && (0 <= a_t && a_t <= 0) && ((((2 <= s_run_st && c_req_type <= 1) && (((c_req_a <= 0 && 0 <= c_req_a) && req_a <= 0) && (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))) && 1 <= req_type) && 0 <= req_a) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= req_d) && 0 == a)) || (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && a_t <= 0) && s_memory0 == req_d) && 51 <= c_req_d) && 51 <= req_d) && 50 <= req_d) && (((((1 <= c_req_a && req_a <= 1) && 1 <= req_a) && a <= 1) && ((((((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))) && 1 <= req_type) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_a <= 1) && 1 <= a) && req_a == 0) && c_req_d <= 51) && req_d <= 51) && req_d <= 50)) || ((((((((((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) && a_t <= 0) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((((((((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) && a_t <= 0) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d) || ((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)) || ((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: 1108]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || ((((((a <= 0 && 0 <= a_t) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && (((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || ((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)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((i == 1 && (((((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) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || (((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)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && ((((1 <= a_t && (((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) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && i <= 1) && 51 == rsp_d)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: (((((((((((1 == req_a___0 && v <= 51) && s_memory1 == 51) && 51 <= v) && (1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && (((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) && 1 <= a) && 0 == req_a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && req_tt_a == 1) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((1 == req_a___0 && v <= 51) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v) && (1 <= c_req_a && ((req_type == 0 && 0 == c_req_type) && (((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) && 1 <= a) && 0 == req_a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1)) || (((1 <= 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) && 1 <= a) && m_run_pc == 6)) || ((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && v <= 51) && 50 == x) && ((((((((a <= 0 && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 == c_req_a) && 0 == req_a) && m_run_pc == 6) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) && 0 <= a)) || (((((((a <= 0 && (s_memory0 == 50 && (0 == c_req_a && (i == 1 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a_t) && 0 == c_req_type) && 0 == req_a___0) && 1 <= req_a) && req_a <= 1) && 0 <= a) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d)) || ((0 <= a_t && (((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && 0 <= a)) || ((((((((((((((((((1 == req_a___0 && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && i <= 1) - InvariantResult [Line: 805]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && req_type == 0) && rsp_d___0 == 51) && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && ((1 <= 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) && 51 == \result) && req_a <= 1) && 1 <= i) && req_tt_a == 1) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && v <= 51) && 51 == c_rsp_d) && 51 <= v) && i <= 1) || (((((((((((((((rsp_d___0 == 50 && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && a <= 0 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && ((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) || (((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && ((((0 == c_req_a && ((((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 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && ((a <= 0 && 0 <= a_t) && (((((((s_run_pc == 0 && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) || (2 <= s_run_pc && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev)) && 1 <= c_req_type) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || ((((((((1 == req_a___0 && v <= 51) && 51 == x) && s_memory1 == 51) && ((((((1 <= c_req_a && (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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && ((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && v == req_d) && 51 <= c_req_d) - InvariantResult [Line: 128]: 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) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 2 <= a) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && s_memory0 == req_d) && ((((((((a <= 0 && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && 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)) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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: 96]: 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: 455]: Loop Invariant Derived loop invariant: ((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && s_memory0 == req_d) && ((((((((a <= 0 && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && 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)) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && s_memory0 == req_d) && ((((((((a <= 0 && c_empty_req == 1) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 50 <= req_d) && 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)) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 1201]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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: 96]: 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: 96]: Loop Invariant Derived loop invariant: (((((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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) || ((((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 && 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)) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((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) || (((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || ((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_a == i) && a_t <= 0) && 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) && 2 <= s_run_st) && a <= 1) && req_a == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 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)) || ((((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || ((((((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)) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 2 <= a) && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && m_run_pc == 3) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && c_req_d <= 51) && v == req_d) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((req_d <= 50 && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) || (((((((((((((((((req_d <= 50 && s_run_pc == 0) && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((((((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)) || ((((((((((((((50 <= v && v <= 50) && req_a == i) && a_t <= 0) && s_memory0 == req_d) && 51 <= req_d) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((req_a <= 1 && 0 <= a_t) && 1 <= req_a) && (((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && s_run_pc == 2) && ((((c_empty_req == 1 && 1 <= req_type) && m_run_pc == 3) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && a <= 1) && req_a == 0) && req_d <= 51) && req_d <= 50)) || ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((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) || (((((((((((51 <= req_d && req_a == i) && 1 <= a_t) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 51 <= 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)) || ((c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && a_t <= 0) && (((((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_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((c_req_d <= 50 && ((((((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) && 0 <= a_t) && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50)) || ((((((((((((1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && 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 && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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)) || ((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: 173]: 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) || (((((((req_d <= 50 && 0 == c_req_a) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && ((((((((((m_run_pc <= 0 && req_a <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 50 <= req_d) && 0 == a)) || (((((((((((((((((req_d <= 50 && s_run_pc == 0) && m_run_pc <= 0) && req_a <= 0) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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)) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || (((((((((((((((((((((((50 <= v && req_a == i) && 1 <= req_a) && a_t <= 0) && s_memory0 == req_d) && 1 <= a) && req_a == 0) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && req_d <= 51) && v <= 50) && 0 <= a_t) && ((c_empty_req == 1 && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 51 <= req_d) && 50 <= req_d) && c_req_d <= 50) && req_a <= 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && req_d <= 50) - InvariantResult [Line: 1162]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((((c_req_d <= 50 && 50 <= c_req_d) && (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) && a_t <= 0) || ((2 <= s_run_st && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && 1 <= a_t) && c_req_d <= 51) && v == 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)) || (a_t <= 0 && (c_req_d <= 50 && 50 <= c_req_d) && (0 <= a_t && a <= 0 && (((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 && 50 <= c_req_d) && ((a <= 0 && (((((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) && 0 <= a_t) && a_t <= 0) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && req_d <= 50)) || ((((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)) || ((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)) || (((((((((50 <= v && v <= 50) && (0 <= a_t && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && (1 <= c_req_type && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_a <= 1) && 1 <= a) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d) - InvariantResult [Line: 96]: 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: 1052]: Loop Invariant Derived loop invariant: (((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (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 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v) || (((((((((1 == req_a___0 && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && ((1 <= a_t && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && req_tt_a == 1) && 51 == rsp_d)) || ((((((51 <= req_d && ((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((a <= 0 && 0 <= a_t) && req_a == i) && req_a == 0) && a_t <= 0) && ((((((c_req_d <= 50 && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((0 <= a_t && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && a <= 0 && (((((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) && 50 <= req_d) && req_d <= 50) && req_a == i) && req_a == 0) && a_t <= 0) && 0 <= a) - InvariantResult [Line: 1231]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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: 1209]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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: 906]: Loop Invariant Derived loop invariant: (((((((((c_req_d <= 50 && 50 <= c_req_d) && (a <= 0 && ((((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 && c_empty_req == 1) && 1 <= req_type) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && req_type <= 1) && 0 <= a_t) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((0 <= a_t && (((c_req_d <= 50 && 50 <= c_req_d) && (((((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) && a_t <= 0)) || ((((((((((((1 <= c_req_a && 1 == req_a) && ((((2 <= c_write_req_ev && ((((1 <= c_req_type && c_empty_req == 1) && 1 <= 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) && req_type <= 1) && c_req_a <= 1) && 50 <= v) && v <= 50) && 1 <= a_t) && s_memory0 == 50) && 1 <= a) && 51 <= req_d) && c_req_d <= 51) && req_d <= 51) && 51 <= c_req_d)) || (((((((v <= 51 && req_tt_a == 0) && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((0 == c_req_a && ((a <= 0 && 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) && a_t <= 0) && 0 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && 0 == req_a___0) && 0 <= a)) || (((((1 == req_a___0 && v <= 51) && ((((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1) - InvariantResult [Line: 1114]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && a == 0) && req_tt_a == 0) && a_t == 0) && v == req_d) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && (((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) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && a == 0) && v <= 51) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 51 <= v)) || ((((((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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) || ((1 <= 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) && 1 <= a)) && m_run_pc == 6)) || ((((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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)) || (((((((((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)) || ((((((51 <= req_d && (((((((((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) && req_a == i) && 1 <= a_t) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d)) || ((((((((((s_run_pc == 0 && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (((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)) || (((((1 == req_a___0 && v <= 51) && ((1 <= c_req_a && (req_type == 0 && 0 == c_req_type) && (((1 <= a_t && ((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && s_memory1 == 51) && 51 <= v) && req_tt_a == 1)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && (a <= 0 && 0 <= a_t) && (((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && req_a == 0) && a_t <= 0) && 0 <= a)) || (((((((((1 == req_a___0 && ((((((1 <= c_req_a && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && (req_type == 0 && ((((((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) && 1 <= a_t) && 1 <= a) && m_run_pc == 6) && 0 == c_req_type) && i <= 1) && v <= 51) && 51 == c_rsp_d) && 51 == x) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == 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)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && (((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) && a_t <= 0) && 0 <= a_t) && 0 <= a)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a_t) && 1 <= a) && m_run_pc == 6)) || (((((((((((50 <= v && v <= 50) && req_a == i) && req_a == 0) && 1 <= a_t) && s_memory0 == req_d) && (1 <= c_req_a && (((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && req_d <= 50) && c_req_d <= 51) && 51 <= c_req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 272 locations, 5 error locations. SAFE Result, 201.5s OverallTime, 27 OverallIterations, 8 TraceHistogramMax, 36.3s AutomataDifference, 0.0s DeadEndRemovalTime, 144.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 16325 SDtfs, 27303 SDslu, 48608 SDs, 0 SdLazy, 4246 SolverSat, 644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1659 GetRequests, 1379 SyntacticMatches, 9 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9409occurred 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: 10.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 64799 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 1290 NumberOfFragments, 25866 HoareAnnotationTreeSize, 98 FomulaSimplifications, 123769885 FormulaSimplificationTreeSizeReduction, 27.1s HoareSimplificationTime, 98 FomulaSimplificationsInter, 27756307 FormulaSimplificationTreeSizeReductionInter, 117.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 5087 NumberOfCodeBlocks, 5087 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 5056 ConstructedInterpolants, 0 QuantifiedInterpolants, 5008843 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3638 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 31 InterpolantComputations, 23 PerfectInterpolantSequences, 1780/3002 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...