./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/mem_slave_tlm.3_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.3_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 94ba032acbdf60cd08371ca325fec24fa00e036a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:38,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:29:38,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:29:38,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:29:38,285 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:29:38,286 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:29:38,289 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:29:38,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:29:38,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:29:38,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:29:38,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:29:38,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:29:38,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:29:38,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:29:38,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:29:38,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:29:38,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:29:38,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:29:38,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:29:38,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:29:38,325 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:29:38,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:29:38,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:29:38,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:29:38,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:29:38,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:29:38,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:29:38,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:29:38,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:29:38,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:29:38,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:29:38,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:29:38,345 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:29:38,345 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:29:38,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:29:38,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:29:38,349 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:38,371 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:29:38,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:29:38,375 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:29:38,375 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:29:38,375 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:29:38,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:29:38,376 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:29:38,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:29:38,376 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:29:38,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:29:38,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:29:38,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:29:38,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:29:38,378 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:29:38,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:29:38,380 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:29:38,380 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:29:38,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:29:38,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:29:38,381 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:29:38,381 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:29:38,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:29:38,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:29:38,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:29:38,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:29:38,384 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:29:38,384 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:29:38,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:29:38,385 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 -> 94ba032acbdf60cd08371ca325fec24fa00e036a [2019-01-12 15:29:38,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:29:38,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:29:38,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:29:38,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:29:38,474 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:29:38,475 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/mem_slave_tlm.3_true-unreach-call_false-termination.cil.c [2019-01-12 15:29:38,525 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a01c794/c4102866e1854ac08aab4d5d2230dc24/FLAG59b84317d [2019-01-12 15:29:39,013 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:29:39,014 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/mem_slave_tlm.3_true-unreach-call_false-termination.cil.c [2019-01-12 15:29:39,032 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a01c794/c4102866e1854ac08aab4d5d2230dc24/FLAG59b84317d [2019-01-12 15:29:39,306 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a01c794/c4102866e1854ac08aab4d5d2230dc24 [2019-01-12 15:29:39,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:29:39,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:29:39,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:29:39,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:29:39,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:29:39,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:29:39" (1/1) ... [2019-01-12 15:29:39,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d26f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:39, skipping insertion in model container [2019-01-12 15:29:39,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:29:39" (1/1) ... [2019-01-12 15:29:39,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:29:39,390 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:29:39,708 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:29:39,717 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:29:39,848 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:29:39,872 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:29:39,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:39 WrapperNode [2019-01-12 15:29:39,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:29:39,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:29:39,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:29:39,875 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:29:39,960 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:39" (1/1) ... [2019-01-12 15:29:39,974 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:39" (1/1) ... [2019-01-12 15:29:40,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:29:40,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:29:40,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:29:40,034 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:29:40,045 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:39" (1/1) ... [2019-01-12 15:29:40,045 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:39" (1/1) ... [2019-01-12 15:29:40,049 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:39" (1/1) ... [2019-01-12 15:29:40,049 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:39" (1/1) ... [2019-01-12 15:29:40,067 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:39" (1/1) ... [2019-01-12 15:29:40,095 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:39" (1/1) ... [2019-01-12 15:29:40,102 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:39" (1/1) ... [2019-01-12 15:29:40,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:29:40,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:29:40,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:29:40,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:29:40,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:39" (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:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:29:40,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:29:42,269 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:29:42,270 INFO L286 CfgBuilder]: Removed 39 assue(true) statements. [2019-01-12 15:29:42,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:29:42 BoogieIcfgContainer [2019-01-12 15:29:42,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:29:42,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:29:42,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:29:42,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:29:42,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:29:39" (1/3) ... [2019-01-12 15:29:42,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dac910e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:29:42, skipping insertion in model container [2019-01-12 15:29:42,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:39" (2/3) ... [2019-01-12 15:29:42,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dac910e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:29:42, skipping insertion in model container [2019-01-12 15:29:42,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:29:42" (3/3) ... [2019-01-12 15:29:42,280 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3_true-unreach-call_false-termination.cil.c [2019-01-12 15:29:42,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:29:42,295 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-12 15:29:42,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-12 15:29:42,343 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:29:42,344 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:29:42,344 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:29:42,344 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:29:42,345 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:29:42,345 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:29:42,345 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:29:42,346 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:29:42,346 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:29:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states. [2019-01-12 15:29:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 15:29:42,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:42,384 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:42,387 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2019-01-12 15:29:42,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:42,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:42,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:42,570 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:42,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:42,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:42,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:42,598 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 3 states. [2019-01-12 15:29:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:43,460 INFO L93 Difference]: Finished difference Result 731 states and 1328 transitions. [2019-01-12 15:29:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:43,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-12 15:29:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:43,480 INFO L225 Difference]: With dead ends: 731 [2019-01-12 15:29:43,481 INFO L226 Difference]: Without dead ends: 454 [2019-01-12 15:29:43,486 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:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-01-12 15:29:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 438. [2019-01-12 15:29:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-01-12 15:29:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 689 transitions. [2019-01-12 15:29:43,571 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 689 transitions. Word has length 28 [2019-01-12 15:29:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:43,572 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 689 transitions. [2019-01-12 15:29:43,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 689 transitions. [2019-01-12 15:29:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 15:29:43,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:43,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] [2019-01-12 15:29:43,577 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash -588620623, now seen corresponding path program 1 times [2019-01-12 15:29:43,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:43,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:43,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:43,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:43,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:43,668 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:43,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:43,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:43,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:43,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:43,672 INFO L87 Difference]: Start difference. First operand 438 states and 689 transitions. Second operand 3 states. [2019-01-12 15:29:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:44,412 INFO L93 Difference]: Finished difference Result 1147 states and 1829 transitions. [2019-01-12 15:29:44,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:44,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-01-12 15:29:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:44,418 INFO L225 Difference]: With dead ends: 1147 [2019-01-12 15:29:44,419 INFO L226 Difference]: Without dead ends: 723 [2019-01-12 15:29:44,422 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:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-01-12 15:29:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 707. [2019-01-12 15:29:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-01-12 15:29:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1144 transitions. [2019-01-12 15:29:44,476 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1144 transitions. Word has length 38 [2019-01-12 15:29:44,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:44,477 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 1144 transitions. [2019-01-12 15:29:44,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1144 transitions. [2019-01-12 15:29:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:29:44,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:44,482 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] [2019-01-12 15:29:44,482 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1580788038, now seen corresponding path program 1 times [2019-01-12 15:29:44,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:44,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:44,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:44,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:44,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:44,561 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:44,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:44,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:44,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:44,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:44,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:44,563 INFO L87 Difference]: Start difference. First operand 707 states and 1144 transitions. Second operand 3 states. [2019-01-12 15:29:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:44,730 INFO L93 Difference]: Finished difference Result 1781 states and 2881 transitions. [2019-01-12 15:29:44,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:44,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:29:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:44,739 INFO L225 Difference]: With dead ends: 1781 [2019-01-12 15:29:44,739 INFO L226 Difference]: Without dead ends: 1099 [2019-01-12 15:29:44,742 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:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-01-12 15:29:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1087. [2019-01-12 15:29:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-01-12 15:29:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1754 transitions. [2019-01-12 15:29:44,809 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1754 transitions. Word has length 39 [2019-01-12 15:29:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:44,810 INFO L480 AbstractCegarLoop]: Abstraction has 1087 states and 1754 transitions. [2019-01-12 15:29:44,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1754 transitions. [2019-01-12 15:29:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 15:29:44,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:44,823 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:44,824 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash -568355804, now seen corresponding path program 1 times [2019-01-12 15:29:44,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:44,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:44,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:44,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:44,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:44,933 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:44,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:44,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:44,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:44,935 INFO L87 Difference]: Start difference. First operand 1087 states and 1754 transitions. Second operand 3 states. [2019-01-12 15:29:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:45,282 INFO L93 Difference]: Finished difference Result 2909 states and 4694 transitions. [2019-01-12 15:29:45,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:45,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-12 15:29:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:45,294 INFO L225 Difference]: With dead ends: 2909 [2019-01-12 15:29:45,294 INFO L226 Difference]: Without dead ends: 1847 [2019-01-12 15:29:45,296 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:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-01-12 15:29:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1701. [2019-01-12 15:29:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2019-01-12 15:29:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2708 transitions. [2019-01-12 15:29:45,378 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2708 transitions. Word has length 46 [2019-01-12 15:29:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:45,379 INFO L480 AbstractCegarLoop]: Abstraction has 1701 states and 2708 transitions. [2019-01-12 15:29:45,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2708 transitions. [2019-01-12 15:29:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 15:29:45,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:45,382 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:45,383 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2019-01-12 15:29:45,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:45,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:45,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:45,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:45,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:45,457 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,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:45,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:45,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:45,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:45,460 INFO L87 Difference]: Start difference. First operand 1701 states and 2708 transitions. Second operand 3 states. [2019-01-12 15:29:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:46,827 INFO L93 Difference]: Finished difference Result 4749 states and 7540 transitions. [2019-01-12 15:29:46,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:46,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-12 15:29:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:46,847 INFO L225 Difference]: With dead ends: 4749 [2019-01-12 15:29:46,848 INFO L226 Difference]: Without dead ends: 3067 [2019-01-12 15:29:46,853 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:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2019-01-12 15:29:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3001. [2019-01-12 15:29:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3001 states. [2019-01-12 15:29:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 4703 transitions. [2019-01-12 15:29:46,994 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 4703 transitions. Word has length 52 [2019-01-12 15:29:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:46,995 INFO L480 AbstractCegarLoop]: Abstraction has 3001 states and 4703 transitions. [2019-01-12 15:29:46,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4703 transitions. [2019-01-12 15:29:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 15:29:46,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:46,996 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:46,998 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:46,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2019-01-12 15:29:46,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:46,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:47,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:47,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:47,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:47,078 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:47,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:47,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:47,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:47,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:47,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:47,080 INFO L87 Difference]: Start difference. First operand 3001 states and 4703 transitions. Second operand 3 states. [2019-01-12 15:29:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:47,455 INFO L93 Difference]: Finished difference Result 7063 states and 11022 transitions. [2019-01-12 15:29:47,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:47,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-12 15:29:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:47,485 INFO L225 Difference]: With dead ends: 7063 [2019-01-12 15:29:47,486 INFO L226 Difference]: Without dead ends: 4085 [2019-01-12 15:29:47,492 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:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-01-12 15:29:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3901. [2019-01-12 15:29:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2019-01-12 15:29:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 6033 transitions. [2019-01-12 15:29:47,745 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 6033 transitions. Word has length 52 [2019-01-12 15:29:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:47,747 INFO L480 AbstractCegarLoop]: Abstraction has 3901 states and 6033 transitions. [2019-01-12 15:29:47,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 6033 transitions. [2019-01-12 15:29:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 15:29:47,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:47,753 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] [2019-01-12 15:29:47,753 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:47,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1900061236, now seen corresponding path program 1 times [2019-01-12 15:29:47,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:47,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:47,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:47,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:47,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:47,880 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:47,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:47,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:47,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:47,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:47,890 INFO L87 Difference]: Start difference. First operand 3901 states and 6033 transitions. Second operand 3 states. [2019-01-12 15:29:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:50,232 INFO L93 Difference]: Finished difference Result 9389 states and 14610 transitions. [2019-01-12 15:29:50,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:50,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-01-12 15:29:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:50,261 INFO L225 Difference]: With dead ends: 9389 [2019-01-12 15:29:50,261 INFO L226 Difference]: Without dead ends: 5511 [2019-01-12 15:29:50,269 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,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2019-01-12 15:29:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 5421. [2019-01-12 15:29:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-01-12 15:29:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 8297 transitions. [2019-01-12 15:29:50,561 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 8297 transitions. Word has length 58 [2019-01-12 15:29:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:50,562 INFO L480 AbstractCegarLoop]: Abstraction has 5421 states and 8297 transitions. [2019-01-12 15:29:50,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 8297 transitions. [2019-01-12 15:29:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 15:29:50,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:50,568 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:50,569 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1776656032, now seen corresponding path program 1 times [2019-01-12 15:29:50,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:50,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:50,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:50,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:50,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:50,761 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:50,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:50,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:50,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:50,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:50,766 INFO L87 Difference]: Start difference. First operand 5421 states and 8297 transitions. Second operand 3 states. [2019-01-12 15:29:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:51,156 INFO L93 Difference]: Finished difference Result 10819 states and 16564 transitions. [2019-01-12 15:29:51,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:51,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-01-12 15:29:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:51,181 INFO L225 Difference]: With dead ends: 10819 [2019-01-12 15:29:51,182 INFO L226 Difference]: Without dead ends: 5421 [2019-01-12 15:29:51,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2019-01-12 15:29:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 5421. [2019-01-12 15:29:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-01-12 15:29:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 8161 transitions. [2019-01-12 15:29:51,398 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 8161 transitions. Word has length 60 [2019-01-12 15:29:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:51,399 INFO L480 AbstractCegarLoop]: Abstraction has 5421 states and 8161 transitions. [2019-01-12 15:29:51,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 8161 transitions. [2019-01-12 15:29:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 15:29:51,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:51,404 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] [2019-01-12 15:29:51,404 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:51,404 INFO L82 PathProgramCache]: Analyzing trace with hash 64035235, now seen corresponding path program 1 times [2019-01-12 15:29:51,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:51,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:51,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:51,503 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:51,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:51,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:51,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:51,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:51,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:51,505 INFO L87 Difference]: Start difference. First operand 5421 states and 8161 transitions. Second operand 3 states. [2019-01-12 15:29:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:52,706 INFO L93 Difference]: Finished difference Result 12227 states and 18448 transitions. [2019-01-12 15:29:52,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:52,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 15:29:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:52,735 INFO L225 Difference]: With dead ends: 12227 [2019-01-12 15:29:52,736 INFO L226 Difference]: Without dead ends: 6829 [2019-01-12 15:29:52,745 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:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2019-01-12 15:29:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 6075. [2019-01-12 15:29:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2019-01-12 15:29:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 8971 transitions. [2019-01-12 15:29:53,019 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 8971 transitions. Word has length 61 [2019-01-12 15:29:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:53,020 INFO L480 AbstractCegarLoop]: Abstraction has 6075 states and 8971 transitions. [2019-01-12 15:29:53,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 8971 transitions. [2019-01-12 15:29:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:29:53,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:53,024 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:53,025 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2137011, now seen corresponding path program 1 times [2019-01-12 15:29:53,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:53,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:53,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:53,206 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:53,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:53,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:29:53,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:29:53,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:29:53,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:29:53,208 INFO L87 Difference]: Start difference. First operand 6075 states and 8971 transitions. Second operand 5 states. [2019-01-12 15:29:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:54,798 INFO L93 Difference]: Finished difference Result 31527 states and 46500 transitions. [2019-01-12 15:29:54,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:29:54,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-01-12 15:29:54,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:54,862 INFO L225 Difference]: With dead ends: 31527 [2019-01-12 15:29:54,862 INFO L226 Difference]: Without dead ends: 25475 [2019-01-12 15:29:54,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:29:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25475 states. [2019-01-12 15:29:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25475 to 8423. [2019-01-12 15:29:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8423 states. [2019-01-12 15:29:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12424 transitions. [2019-01-12 15:29:55,714 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12424 transitions. Word has length 63 [2019-01-12 15:29:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:55,714 INFO L480 AbstractCegarLoop]: Abstraction has 8423 states and 12424 transitions. [2019-01-12 15:29:55,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:29:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12424 transitions. [2019-01-12 15:29:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:29:55,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:55,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:29:55,721 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash 803926384, now seen corresponding path program 1 times [2019-01-12 15:29:55,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:55,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:55,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:55,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:55,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:55,999 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:55,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:55,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 15:29:56,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:29:56,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:29:56,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:29:56,000 INFO L87 Difference]: Start difference. First operand 8423 states and 12424 transitions. Second operand 7 states. [2019-01-12 15:29:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:59,467 INFO L93 Difference]: Finished difference Result 41619 states and 61265 transitions. [2019-01-12 15:29:59,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 15:29:59,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-01-12 15:29:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:59,531 INFO L225 Difference]: With dead ends: 41619 [2019-01-12 15:29:59,531 INFO L226 Difference]: Without dead ends: 33219 [2019-01-12 15:29:59,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2019-01-12 15:29:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33219 states. [2019-01-12 15:30:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33219 to 5593. [2019-01-12 15:30:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5593 states. [2019-01-12 15:30:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 8137 transitions. [2019-01-12 15:30:00,166 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 8137 transitions. Word has length 64 [2019-01-12 15:30:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:00,167 INFO L480 AbstractCegarLoop]: Abstraction has 5593 states and 8137 transitions. [2019-01-12 15:30:00,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:30:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 8137 transitions. [2019-01-12 15:30:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 15:30:00,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:00,171 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:30:00,171 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:00,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:00,172 INFO L82 PathProgramCache]: Analyzing trace with hash -642302294, now seen corresponding path program 1 times [2019-01-12 15:30:00,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:00,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:00,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:00,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:00,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:00,243 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:30:00,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:00,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:00,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:00,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:00,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:00,244 INFO L87 Difference]: Start difference. First operand 5593 states and 8137 transitions. Second operand 3 states. [2019-01-12 15:30:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:00,860 INFO L93 Difference]: Finished difference Result 11802 states and 17131 transitions. [2019-01-12 15:30:00,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:00,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-01-12 15:30:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:00,874 INFO L225 Difference]: With dead ends: 11802 [2019-01-12 15:30:00,874 INFO L226 Difference]: Without dead ends: 6230 [2019-01-12 15:30:00,883 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:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2019-01-12 15:30:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 6138. [2019-01-12 15:30:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6138 states. [2019-01-12 15:30:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6138 states to 6138 states and 8897 transitions. [2019-01-12 15:30:01,994 INFO L78 Accepts]: Start accepts. Automaton has 6138 states and 8897 transitions. Word has length 77 [2019-01-12 15:30:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:01,994 INFO L480 AbstractCegarLoop]: Abstraction has 6138 states and 8897 transitions. [2019-01-12 15:30:01,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6138 states and 8897 transitions. [2019-01-12 15:30:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-12 15:30:01,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:01,998 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:30:01,998 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:01,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1395734083, now seen corresponding path program 1 times [2019-01-12 15:30:01,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:01,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:02,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:02,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:02,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:02,094 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:30:02,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:02,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:02,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:02,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:02,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:02,098 INFO L87 Difference]: Start difference. First operand 6138 states and 8897 transitions. Second operand 3 states. [2019-01-12 15:30:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:02,982 INFO L93 Difference]: Finished difference Result 15750 states and 22694 transitions. [2019-01-12 15:30:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:02,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-01-12 15:30:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:03,000 INFO L225 Difference]: With dead ends: 15750 [2019-01-12 15:30:03,000 INFO L226 Difference]: Without dead ends: 9501 [2019-01-12 15:30:03,011 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:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9501 states. [2019-01-12 15:30:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9501 to 9473. [2019-01-12 15:30:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9473 states. [2019-01-12 15:30:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9473 states to 9473 states and 13515 transitions. [2019-01-12 15:30:03,915 INFO L78 Accepts]: Start accepts. Automaton has 9473 states and 13515 transitions. Word has length 88 [2019-01-12 15:30:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:03,916 INFO L480 AbstractCegarLoop]: Abstraction has 9473 states and 13515 transitions. [2019-01-12 15:30:03,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 9473 states and 13515 transitions. [2019-01-12 15:30:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:30:03,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:03,919 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:30:03,919 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash 254242823, now seen corresponding path program 1 times [2019-01-12 15:30:03,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:03,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:03,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:03,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:03,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:04,191 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:30:04,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:04,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:04,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:04,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:04,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:04,194 INFO L87 Difference]: Start difference. First operand 9473 states and 13515 transitions. Second operand 3 states. [2019-01-12 15:30:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:05,053 INFO L93 Difference]: Finished difference Result 17390 states and 24716 transitions. [2019-01-12 15:30:05,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:05,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-12 15:30:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:05,062 INFO L225 Difference]: With dead ends: 17390 [2019-01-12 15:30:05,062 INFO L226 Difference]: Without dead ends: 6954 [2019-01-12 15:30:05,073 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:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6954 states. [2019-01-12 15:30:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6954 to 6541. [2019-01-12 15:30:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6541 states. [2019-01-12 15:30:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 8897 transitions. [2019-01-12 15:30:05,746 INFO L78 Accepts]: Start accepts. Automaton has 6541 states and 8897 transitions. Word has length 95 [2019-01-12 15:30:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:05,747 INFO L480 AbstractCegarLoop]: Abstraction has 6541 states and 8897 transitions. [2019-01-12 15:30:05,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6541 states and 8897 transitions. [2019-01-12 15:30:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 15:30:05,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:05,749 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:30:05,749 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1408787564, now seen corresponding path program 1 times [2019-01-12 15:30:05,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:05,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:05,822 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:30:05,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:05,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:05,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:05,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:05,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:05,824 INFO L87 Difference]: Start difference. First operand 6541 states and 8897 transitions. Second operand 3 states. [2019-01-12 15:30:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:06,308 INFO L93 Difference]: Finished difference Result 10570 states and 14444 transitions. [2019-01-12 15:30:06,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:06,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-12 15:30:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:06,314 INFO L225 Difference]: With dead ends: 10570 [2019-01-12 15:30:06,314 INFO L226 Difference]: Without dead ends: 4143 [2019-01-12 15:30:06,323 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:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2019-01-12 15:30:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4125. [2019-01-12 15:30:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2019-01-12 15:30:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5490 transitions. [2019-01-12 15:30:07,153 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5490 transitions. Word has length 98 [2019-01-12 15:30:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:07,154 INFO L480 AbstractCegarLoop]: Abstraction has 4125 states and 5490 transitions. [2019-01-12 15:30:07,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5490 transitions. [2019-01-12 15:30:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 15:30:07,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:07,158 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:30:07,159 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1416682179, now seen corresponding path program 1 times [2019-01-12 15:30:07,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:07,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:07,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:07,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:07,282 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:30:07,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:07,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:07,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:07,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:07,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:07,285 INFO L87 Difference]: Start difference. First operand 4125 states and 5490 transitions. Second operand 3 states. [2019-01-12 15:30:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:08,309 INFO L93 Difference]: Finished difference Result 7312 states and 9768 transitions. [2019-01-12 15:30:08,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:08,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-12 15:30:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:08,316 INFO L225 Difference]: With dead ends: 7312 [2019-01-12 15:30:08,317 INFO L226 Difference]: Without dead ends: 3262 [2019-01-12 15:30:08,322 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:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2019-01-12 15:30:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2960. [2019-01-12 15:30:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2019-01-12 15:30:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3855 transitions. [2019-01-12 15:30:08,787 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3855 transitions. Word has length 98 [2019-01-12 15:30:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:08,788 INFO L480 AbstractCegarLoop]: Abstraction has 2960 states and 3855 transitions. [2019-01-12 15:30:08,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3855 transitions. [2019-01-12 15:30:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:30:08,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:08,789 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:30:08,789 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash -965689605, now seen corresponding path program 1 times [2019-01-12 15:30:08,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:08,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:08,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:08,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:08,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:08,879 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:30:08,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:08,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:08,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:08,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:08,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:08,880 INFO L87 Difference]: Start difference. First operand 2960 states and 3855 transitions. Second operand 3 states. [2019-01-12 15:30:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:09,570 INFO L93 Difference]: Finished difference Result 3286 states and 4247 transitions. [2019-01-12 15:30:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:09,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-12 15:30:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:09,574 INFO L225 Difference]: With dead ends: 3286 [2019-01-12 15:30:09,574 INFO L226 Difference]: Without dead ends: 3282 [2019-01-12 15:30:09,575 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:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2019-01-12 15:30:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3257. [2019-01-12 15:30:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3257 states. [2019-01-12 15:30:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 4200 transitions. [2019-01-12 15:30:09,863 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 4200 transitions. Word has length 99 [2019-01-12 15:30:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:09,864 INFO L480 AbstractCegarLoop]: Abstraction has 3257 states and 4200 transitions. [2019-01-12 15:30:09,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 4200 transitions. [2019-01-12 15:30:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-12 15:30:09,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:09,866 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, 1] [2019-01-12 15:30:09,867 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash -488246995, now seen corresponding path program 1 times [2019-01-12 15:30:09,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:09,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:09,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:09,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:09,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:10,056 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:30:10,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:10,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:30:10,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:30:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:30:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:30:10,058 INFO L87 Difference]: Start difference. First operand 3257 states and 4200 transitions. Second operand 5 states. [2019-01-12 15:30:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:11,329 INFO L93 Difference]: Finished difference Result 12108 states and 15680 transitions. [2019-01-12 15:30:11,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:30:11,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-01-12 15:30:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:11,337 INFO L225 Difference]: With dead ends: 12108 [2019-01-12 15:30:11,337 INFO L226 Difference]: Without dead ends: 9043 [2019-01-12 15:30:11,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:30:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9043 states. [2019-01-12 15:30:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9043 to 3259. [2019-01-12 15:30:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3259 states. [2019-01-12 15:30:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 4194 transitions. [2019-01-12 15:30:11,716 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 4194 transitions. Word has length 158 [2019-01-12 15:30:11,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:11,717 INFO L480 AbstractCegarLoop]: Abstraction has 3259 states and 4194 transitions. [2019-01-12 15:30:11,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:30:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 4194 transitions. [2019-01-12 15:30:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-12 15:30:11,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:11,720 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, 1] [2019-01-12 15:30:11,720 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1660079688, now seen corresponding path program 1 times [2019-01-12 15:30:11,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:11,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:11,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:11,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:11,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:12,026 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:12,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:12,027 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:12,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:12,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:12,348 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:12,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:30:12,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:30:12,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:30:12,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:30:12,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:30:12,380 INFO L87 Difference]: Start difference. First operand 3259 states and 4194 transitions. Second operand 9 states. [2019-01-12 15:30:13,296 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 15:30:13,700 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 15:30:14,077 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 15:30:14,424 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 15:30:14,744 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 15:30:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:17,909 INFO L93 Difference]: Finished difference Result 17481 states and 22705 transitions. [2019-01-12 15:30:17,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 15:30:17,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2019-01-12 15:30:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:17,937 INFO L225 Difference]: With dead ends: 17481 [2019-01-12 15:30:17,937 INFO L226 Difference]: Without dead ends: 14436 [2019-01-12 15:30:17,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:30:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14436 states. [2019-01-12 15:30:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14436 to 4893. [2019-01-12 15:30:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4893 states. [2019-01-12 15:30:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4893 states to 4893 states and 6364 transitions. [2019-01-12 15:30:19,051 INFO L78 Accepts]: Start accepts. Automaton has 4893 states and 6364 transitions. Word has length 160 [2019-01-12 15:30:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:19,052 INFO L480 AbstractCegarLoop]: Abstraction has 4893 states and 6364 transitions. [2019-01-12 15:30:19,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:30:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4893 states and 6364 transitions. [2019-01-12 15:30:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-12 15:30:19,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:19,058 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, 1] [2019-01-12 15:30:19,060 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:19,060 INFO L82 PathProgramCache]: Analyzing trace with hash 975904749, now seen corresponding path program 1 times [2019-01-12 15:30:19,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:19,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:19,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:19,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:30:19,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:19,464 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:19,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:19,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:30:19,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:30:19,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 15:30:19,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:30:19,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:30:19,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:30:19,799 INFO L87 Difference]: Start difference. First operand 4893 states and 6364 transitions. Second operand 11 states. [2019-01-12 15:30:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:24,365 INFO L93 Difference]: Finished difference Result 22829 states and 29640 transitions. [2019-01-12 15:30:24,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-12 15:30:24,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 258 [2019-01-12 15:30:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:24,387 INFO L225 Difference]: With dead ends: 22829 [2019-01-12 15:30:24,387 INFO L226 Difference]: Without dead ends: 18150 [2019-01-12 15:30:24,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 15:30:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18150 states. [2019-01-12 15:30:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18150 to 6358. [2019-01-12 15:30:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6358 states. [2019-01-12 15:30:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6358 states to 6358 states and 8288 transitions. [2019-01-12 15:30:25,587 INFO L78 Accepts]: Start accepts. Automaton has 6358 states and 8288 transitions. Word has length 258 [2019-01-12 15:30:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:25,587 INFO L480 AbstractCegarLoop]: Abstraction has 6358 states and 8288 transitions. [2019-01-12 15:30:25,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:30:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6358 states and 8288 transitions. [2019-01-12 15:30:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-01-12 15:30:25,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:25,594 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 15:30:25,594 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1870192825, now seen corresponding path program 1 times [2019-01-12 15:30:25,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:25,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:25,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:25,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:25,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:26,189 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-01-12 15:30:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 348 proven. 4 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-01-12 15:30:26,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:26,356 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:26,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:26,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-12 15:30:26,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 15:30:26,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 15 [2019-01-12 15:30:26,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:30:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:30:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:30:26,893 INFO L87 Difference]: Start difference. First operand 6358 states and 8288 transitions. Second operand 15 states. [2019-01-12 15:30:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:35,683 INFO L93 Difference]: Finished difference Result 24856 states and 32111 transitions. [2019-01-12 15:30:35,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-12 15:30:35,684 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 357 [2019-01-12 15:30:35,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:35,704 INFO L225 Difference]: With dead ends: 24856 [2019-01-12 15:30:35,704 INFO L226 Difference]: Without dead ends: 18694 [2019-01-12 15:30:35,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3507 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2042, Invalid=8058, Unknown=0, NotChecked=0, Total=10100 [2019-01-12 15:30:35,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18694 states. [2019-01-12 15:30:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18694 to 6204. [2019-01-12 15:30:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2019-01-12 15:30:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 8082 transitions. [2019-01-12 15:30:37,206 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 8082 transitions. Word has length 357 [2019-01-12 15:30:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:37,207 INFO L480 AbstractCegarLoop]: Abstraction has 6204 states and 8082 transitions. [2019-01-12 15:30:37,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:30:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 8082 transitions. [2019-01-12 15:30:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-01-12 15:30:37,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:37,214 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 15:30:37,215 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash -228519270, now seen corresponding path program 1 times [2019-01-12 15:30:37,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:37,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:37,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:37,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:37,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-01-12 15:30:37,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:37,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:37,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:37,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:37,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:37,424 INFO L87 Difference]: Start difference. First operand 6204 states and 8082 transitions. Second operand 3 states. [2019-01-12 15:30:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:39,922 INFO L93 Difference]: Finished difference Result 13947 states and 18249 transitions. [2019-01-12 15:30:39,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:39,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-01-12 15:30:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:39,934 INFO L225 Difference]: With dead ends: 13947 [2019-01-12 15:30:39,934 INFO L226 Difference]: Without dead ends: 7957 [2019-01-12 15:30:39,940 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:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-01-12 15:30:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 7656. [2019-01-12 15:30:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7656 states. [2019-01-12 15:30:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 9757 transitions. [2019-01-12 15:30:41,395 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 9757 transitions. Word has length 357 [2019-01-12 15:30:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:41,395 INFO L480 AbstractCegarLoop]: Abstraction has 7656 states and 9757 transitions. [2019-01-12 15:30:41,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 9757 transitions. [2019-01-12 15:30:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-01-12 15:30:41,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:41,398 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,399 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:41,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1050472350, now seen corresponding path program 1 times [2019-01-12 15:30:41,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:41,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:41,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:41,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:41,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-01-12 15:30:41,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:41,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:41,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:41,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:41,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:41,555 INFO L87 Difference]: Start difference. First operand 7656 states and 9757 transitions. Second operand 3 states. [2019-01-12 15:30:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:42,116 INFO L93 Difference]: Finished difference Result 8987 states and 11270 transitions. [2019-01-12 15:30:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:42,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-01-12 15:30:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:42,119 INFO L225 Difference]: With dead ends: 8987 [2019-01-12 15:30:42,120 INFO L226 Difference]: Without dead ends: 1431 [2019-01-12 15:30:42,125 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:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-01-12 15:30:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1428. [2019-01-12 15:30:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-01-12 15:30:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1578 transitions. [2019-01-12 15:30:42,428 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1578 transitions. Word has length 358 [2019-01-12 15:30:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:42,430 INFO L480 AbstractCegarLoop]: Abstraction has 1428 states and 1578 transitions. [2019-01-12 15:30:42,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1578 transitions. [2019-01-12 15:30:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-01-12 15:30:42,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:42,433 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 15:30:42,434 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash -719470612, now seen corresponding path program 1 times [2019-01-12 15:30:42,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:42,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:42,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-01-12 15:30:42,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:42,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 15:30:42,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:30:42,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:30:42,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:30:42,899 INFO L87 Difference]: Start difference. First operand 1428 states and 1578 transitions. Second operand 7 states. [2019-01-12 15:30:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:43,684 INFO L93 Difference]: Finished difference Result 2901 states and 3211 transitions. [2019-01-12 15:30:43,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:30:43,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 359 [2019-01-12 15:30:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:43,687 INFO L225 Difference]: With dead ends: 2901 [2019-01-12 15:30:43,688 INFO L226 Difference]: Without dead ends: 2369 [2019-01-12 15:30:43,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:30:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-01-12 15:30:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1424. [2019-01-12 15:30:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2019-01-12 15:30:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1568 transitions. [2019-01-12 15:30:43,955 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1568 transitions. Word has length 359 [2019-01-12 15:30:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:43,956 INFO L480 AbstractCegarLoop]: Abstraction has 1424 states and 1568 transitions. [2019-01-12 15:30:43,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:30:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1568 transitions. [2019-01-12 15:30:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-12 15:30:43,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:43,961 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,961 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -91073449, now seen corresponding path program 1 times [2019-01-12 15:30:43,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:43,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:43,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:43,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:43,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-01-12 15:30:44,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:44,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:30:44,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:30:44,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:30:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:30:44,285 INFO L87 Difference]: Start difference. First operand 1424 states and 1568 transitions. Second operand 5 states. [2019-01-12 15:30:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:44,789 INFO L93 Difference]: Finished difference Result 2338 states and 2584 transitions. [2019-01-12 15:30:44,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:30:44,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 360 [2019-01-12 15:30:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:44,792 INFO L225 Difference]: With dead ends: 2338 [2019-01-12 15:30:44,792 INFO L226 Difference]: Without dead ends: 1804 [2019-01-12 15:30:44,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:30:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-01-12 15:30:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1392. [2019-01-12 15:30:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-01-12 15:30:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1507 transitions. [2019-01-12 15:30:45,057 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1507 transitions. Word has length 360 [2019-01-12 15:30:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:45,058 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 1507 transitions. [2019-01-12 15:30:45,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:30:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1507 transitions. [2019-01-12 15:30:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-01-12 15:30:45,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:45,061 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,061 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:45,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:45,062 INFO L82 PathProgramCache]: Analyzing trace with hash -527435852, now seen corresponding path program 1 times [2019-01-12 15:30:45,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:45,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:45,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:45,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:45,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-01-12 15:30:45,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:45,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:45,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:45,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:45,235 INFO L87 Difference]: Start difference. First operand 1392 states and 1507 transitions. Second operand 3 states. [2019-01-12 15:30:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:45,758 INFO L93 Difference]: Finished difference Result 2295 states and 2483 transitions. [2019-01-12 15:30:45,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:45,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-01-12 15:30:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:45,760 INFO L225 Difference]: With dead ends: 2295 [2019-01-12 15:30:45,760 INFO L226 Difference]: Without dead ends: 1217 [2019-01-12 15:30:45,761 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:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-01-12 15:30:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1001. [2019-01-12 15:30:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-01-12 15:30:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1090 transitions. [2019-01-12 15:30:45,963 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1090 transitions. Word has length 417 [2019-01-12 15:30:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:45,964 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1090 transitions. [2019-01-12 15:30:45,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1090 transitions. [2019-01-12 15:30:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-01-12 15:30:45,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:45,967 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,967 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash -46355594, now seen corresponding path program 1 times [2019-01-12 15:30:45,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:45,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:45,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:45,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 20 proven. 267 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-01-12 15:30:46,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:46,575 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:46,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:46,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-01-12 15:30:47,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:30:47,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-01-12 15:30:47,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 15:30:47,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 15:30:47,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-01-12 15:30:47,371 INFO L87 Difference]: Start difference. First operand 1001 states and 1090 transitions. Second operand 29 states. [2019-01-12 15:30:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:49,019 INFO L93 Difference]: Finished difference Result 1215 states and 1332 transitions. [2019-01-12 15:30:49,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 15:30:49,019 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 417 [2019-01-12 15:30:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:49,021 INFO L225 Difference]: With dead ends: 1215 [2019-01-12 15:30:49,021 INFO L226 Difference]: Without dead ends: 1213 [2019-01-12 15:30:49,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 414 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 15:30:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-01-12 15:30:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1001. [2019-01-12 15:30:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-01-12 15:30:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1089 transitions. [2019-01-12 15:30:49,237 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1089 transitions. Word has length 417 [2019-01-12 15:30:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:49,237 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1089 transitions. [2019-01-12 15:30:49,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 15:30:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1089 transitions. [2019-01-12 15:30:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-01-12 15:30:49,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:49,240 INFO L402 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,242 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:49,242 INFO L82 PathProgramCache]: Analyzing trace with hash 97766421, now seen corresponding path program 1 times [2019-01-12 15:30:49,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:49,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:49,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:49,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:49,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:49,568 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2019-01-12 15:30:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 187 proven. 100 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-01-12 15:30:49,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:49,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:30:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:49,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-01-12 15:30:50,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:30:50,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2019-01-12 15:30:50,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:30:50,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:30:50,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:30:50,173 INFO L87 Difference]: Start difference. First operand 1001 states and 1089 transitions. Second operand 11 states. [2019-01-12 15:30:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:51,230 INFO L93 Difference]: Finished difference Result 1430 states and 1552 transitions. [2019-01-12 15:30:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 15:30:51,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 464 [2019-01-12 15:30:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:51,232 INFO L225 Difference]: With dead ends: 1430 [2019-01-12 15:30:51,232 INFO L226 Difference]: Without dead ends: 1221 [2019-01-12 15:30:51,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 480 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2019-01-12 15:30:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-01-12 15:30:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1000. [2019-01-12 15:30:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-01-12 15:30:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1085 transitions. [2019-01-12 15:30:51,460 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1085 transitions. Word has length 464 [2019-01-12 15:30:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:51,460 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1085 transitions. [2019-01-12 15:30:51,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:30:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1085 transitions. [2019-01-12 15:30:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-01-12 15:30:51,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:51,464 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2019-01-12 15:30:51,464 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:51,465 INFO L82 PathProgramCache]: Analyzing trace with hash -577347883, now seen corresponding path program 1 times [2019-01-12 15:30:51,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:51,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:51,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:51,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:51,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 28 proven. 657 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 15:30:52,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:52,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:30:52,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:52,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:30:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 161 proven. 503 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-01-12 15:30:53,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:30:53,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 37 [2019-01-12 15:30:53,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-12 15:30:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-12 15:30:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 15:30:53,310 INFO L87 Difference]: Start difference. First operand 1000 states and 1085 transitions. Second operand 37 states. [2019-01-12 15:30:55,007 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 15:30:58,513 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 15:30:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:58,623 INFO L93 Difference]: Finished difference Result 1161 states and 1265 transitions. [2019-01-12 15:30:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-12 15:30:58,624 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 523 [2019-01-12 15:30:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:58,626 INFO L225 Difference]: With dead ends: 1161 [2019-01-12 15:30:58,626 INFO L226 Difference]: Without dead ends: 1159 [2019-01-12 15:30:58,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 525 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=489, Invalid=4203, Unknown=0, NotChecked=0, Total=4692 [2019-01-12 15:30:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-01-12 15:30:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1000. [2019-01-12 15:30:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-01-12 15:30:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1084 transitions. [2019-01-12 15:30:58,851 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1084 transitions. Word has length 523 [2019-01-12 15:30:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:58,851 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1084 transitions. [2019-01-12 15:30:58,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-12 15:30:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1084 transitions. [2019-01-12 15:30:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-01-12 15:30:58,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:58,856 INFO L402 BasicCegarLoop]: trace histogram [11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,857 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:58,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1917072682, now seen corresponding path program 1 times [2019-01-12 15:30:58,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:58,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:58,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:58,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:58,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:59,244 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2019-01-12 15:30:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 311 proven. 276 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-01-12 15:30:59,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:30:59,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:30:59,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:00,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:31:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-01-12 15:31:00,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:31:00,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 13 [2019-01-12 15:31:00,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:31:00,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:31:00,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:31:00,432 INFO L87 Difference]: Start difference. First operand 1000 states and 1084 transitions. Second operand 13 states. [2019-01-12 15:31:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:01,692 INFO L93 Difference]: Finished difference Result 1227 states and 1334 transitions. [2019-01-12 15:31:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 15:31:01,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 570 [2019-01-12 15:31:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:01,695 INFO L225 Difference]: With dead ends: 1227 [2019-01-12 15:31:01,696 INFO L226 Difference]: Without dead ends: 1162 [2019-01-12 15:31:01,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 588 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 15:31:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-01-12 15:31:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 998. [2019-01-12 15:31:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-01-12 15:31:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1080 transitions. [2019-01-12 15:31:01,923 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1080 transitions. Word has length 570 [2019-01-12 15:31:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:01,923 INFO L480 AbstractCegarLoop]: Abstraction has 998 states and 1080 transitions. [2019-01-12 15:31:01,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:31:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1080 transitions. [2019-01-12 15:31:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2019-01-12 15:31:01,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:01,928 INFO L402 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 15:31:01,929 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2024653189, now seen corresponding path program 1 times [2019-01-12 15:31:01,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:01,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 489 proven. 336 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-01-12 15:31:02,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:31:02,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:31:02,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:02,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:31:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 168 proven. 918 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-12 15:31:04,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:31:04,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 40 [2019-01-12 15:31:04,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-12 15:31:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-12 15:31:04,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 15:31:04,495 INFO L87 Difference]: Start difference. First operand 998 states and 1080 transitions. Second operand 40 states. [2019-01-12 15:31:08,706 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-12 15:31:09,589 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-12 15:31:10,148 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-01-12 15:31:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:11,082 INFO L93 Difference]: Finished difference Result 1366 states and 1497 transitions. [2019-01-12 15:31:11,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-12 15:31:11,083 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 630 [2019-01-12 15:31:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:11,084 INFO L225 Difference]: With dead ends: 1366 [2019-01-12 15:31:11,084 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:31:11,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3750 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1101, Invalid=12009, Unknown=0, NotChecked=0, Total=13110 [2019-01-12 15:31:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:31:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:31:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:31:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:31:11,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 630 [2019-01-12 15:31:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:11,090 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:31:11,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-12 15:31:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:31:11,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:31:11,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:31:11,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:11,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:11,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:12,127 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 337 DAG size of output: 297 [2019-01-12 15:31:12,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:12,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:12,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:13,057 WARN L181 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 297 [2019-01-12 15:31:13,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:13,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:13,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:13,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:13,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:13,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:13,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:14,213 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 463 DAG size of output: 433 [2019-01-12 15:31:15,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:15,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:16,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:17,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:17,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:17,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:17,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:17,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:17,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:17,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:17,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:18,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:19,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:20,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,848 WARN L181 SmtUtils]: Spent 7.63 s on a formula simplification. DAG size of input: 1585 DAG size of output: 1122 [2019-01-12 15:31:21,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:21,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,388 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 433 [2019-01-12 15:31:22,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,780 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 432 DAG size of output: 379 [2019-01-12 15:31:22,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:22,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,435 WARN L181 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 396 DAG size of output: 354 [2019-01-12 15:31:23,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,585 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 235 [2019-01-12 15:31:23,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:23,989 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 297 [2019-01-12 15:31:24,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,358 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 420 DAG size of output: 367 [2019-01-12 15:31:24,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,506 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 247 [2019-01-12 15:31:24,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,772 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 245 [2019-01-12 15:31:24,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,959 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 357 DAG size of output: 287 [2019-01-12 15:31:24,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:24,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,077 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 204 [2019-01-12 15:31:25,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:25,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,309 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 765 DAG size of output: 548 [2019-01-12 15:31:26,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:26,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:27,569 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 765 DAG size of output: 548 [2019-01-12 15:31:27,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,076 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 433 [2019-01-12 15:31:28,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,306 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 237 [2019-01-12 15:31:28,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,505 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 239 [2019-01-12 15:31:28,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:28,665 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 209 [2019-01-12 15:31:28,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,121 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 433 [2019-01-12 15:31:29,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,566 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 524 DAG size of output: 324 [2019-01-12 15:31:29,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:29,677 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 196 [2019-01-12 15:31:30,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,891 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 521 DAG size of output: 473 [2019-01-12 15:31:30,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:30,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,107 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 267 [2019-01-12 15:31:31,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,321 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 267 [2019-01-12 15:31:31,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,594 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 345 DAG size of output: 245 [2019-01-12 15:31:31,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:31,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,774 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 765 DAG size of output: 548 [2019-01-12 15:31:32,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:32,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,092 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 400 DAG size of output: 291 [2019-01-12 15:31:33,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:33,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,341 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 778 DAG size of output: 562 [2019-01-12 15:31:34,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,866 WARN L181 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 433 [2019-01-12 15:31:34,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:34,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:35,319 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 306 [2019-01-12 15:31:35,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:35,840 WARN L181 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 433 [2019-01-12 15:31:36,012 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 245 [2019-01-12 15:31:36,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,355 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 153 [2019-01-12 15:31:36,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,491 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 227 [2019-01-12 15:31:36,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,708 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 271 [2019-01-12 15:31:36,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:36,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:37,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:37,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:37,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:37,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:37,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:37,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:37,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:38,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:39,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:40,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,836 WARN L181 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 1607 DAG size of output: 1140 [2019-01-12 15:31:41,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:41,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:42,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:42,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:42,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,850 WARN L181 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 988 DAG size of output: 657 [2019-01-12 15:31:43,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:43,989 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 227 [2019-01-12 15:31:44,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:44,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:44,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:44,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:44,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:44,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:44,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:44,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:44,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,237 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 778 DAG size of output: 562 [2019-01-12 15:31:45,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,568 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 227 [2019-01-12 15:31:45,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,747 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 177 [2019-01-12 15:31:45,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,947 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 291 [2019-01-12 15:31:45,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:45,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,145 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 269 [2019-01-12 15:31:46,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,338 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 368 DAG size of output: 273 [2019-01-12 15:31:46,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:46,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,723 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 765 DAG size of output: 548 [2019-01-12 15:31:47,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:47,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:48,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:48,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:48,575 WARN L181 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 539 DAG size of output: 465 [2019-01-12 15:31:48,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:48,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:48,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:48,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:48,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:49,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:49,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:49,939 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 623 DAG size of output: 539 [2019-01-12 15:31:49,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:49,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:49,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,150 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 394 DAG size of output: 277 [2019-01-12 15:31:50,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,365 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 248 [2019-01-12 15:31:50,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,489 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 216 [2019-01-12 15:31:50,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:50,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:51,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:51,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:51,714 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 623 DAG size of output: 539 [2019-01-12 15:31:51,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:52,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:52,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:52,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,016 WARN L181 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 605 DAG size of output: 526 [2019-01-12 15:31:53,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,580 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 336 [2019-01-12 15:31:53,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,699 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 177 [2019-01-12 15:31:53,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:53,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:54,064 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 192 [2019-01-12 15:31:55,739 WARN L181 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 291 DAG size of output: 97 [2019-01-12 15:31:57,404 WARN L181 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 291 DAG size of output: 97 [2019-01-12 15:31:57,856 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2019-01-12 15:32:01,240 WARN L181 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 422 DAG size of output: 144 [2019-01-12 15:32:17,630 WARN L181 SmtUtils]: Spent 16.38 s on a formula simplification. DAG size of input: 1082 DAG size of output: 218 [2019-01-12 15:32:18,353 WARN L181 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 101 [2019-01-12 15:32:21,790 WARN L181 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 422 DAG size of output: 144 [2019-01-12 15:32:24,381 WARN L181 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 362 DAG size of output: 114 [2019-01-12 15:32:27,141 WARN L181 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 346 DAG size of output: 147 [2019-01-12 15:32:28,027 WARN L181 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 101 [2019-01-12 15:32:29,559 WARN L181 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 291 DAG size of output: 97 [2019-01-12 15:32:31,955 WARN L181 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 354 DAG size of output: 104 [2019-01-12 15:32:32,842 WARN L181 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 100 [2019-01-12 15:32:33,942 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 242 DAG size of output: 112 [2019-01-12 15:32:35,141 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 280 DAG size of output: 110 [2019-01-12 15:32:36,420 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 190 DAG size of output: 97 [2019-01-12 15:32:41,604 WARN L181 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 535 DAG size of output: 167 [2019-01-12 15:32:42,404 WARN L181 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 99 [2019-01-12 15:32:47,632 WARN L181 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 535 DAG size of output: 167 [2019-01-12 15:32:48,349 WARN L181 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 101 [2019-01-12 15:32:51,742 WARN L181 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 422 DAG size of output: 144 [2019-01-12 15:32:52,496 WARN L181 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 93 [2019-01-12 15:32:53,716 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 230 DAG size of output: 92 [2019-01-12 15:32:55,127 WARN L181 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 234 DAG size of output: 98 [2019-01-12 15:32:55,876 WARN L181 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 101 [2019-01-12 15:32:57,291 WARN L181 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 202 DAG size of output: 98 [2019-01-12 15:33:00,910 WARN L181 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 422 DAG size of output: 144 [2019-01-12 15:33:02,443 WARN L181 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 308 DAG size of output: 114 [2019-01-12 15:33:03,134 WARN L181 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 77 [2019-01-12 15:33:08,423 WARN L181 SmtUtils]: Spent 5.28 s on a formula simplification. DAG size of input: 456 DAG size of output: 164 [2019-01-12 15:33:08,923 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2019-01-12 15:33:10,049 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 264 DAG size of output: 103 [2019-01-12 15:33:10,571 WARN L181 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2019-01-12 15:33:11,711 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 264 DAG size of output: 103 [2019-01-12 15:33:12,213 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 76 [2019-01-12 15:33:13,446 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 238 DAG size of output: 99 [2019-01-12 15:33:18,884 WARN L181 SmtUtils]: Spent 5.43 s on a formula simplification. DAG size of input: 535 DAG size of output: 167 [2019-01-12 15:33:19,680 WARN L181 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 101 [2019-01-12 15:33:21,069 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 271 DAG size of output: 100 [2019-01-12 15:33:26,789 WARN L181 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 549 DAG size of output: 167 [2019-01-12 15:33:27,595 WARN L181 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 101 [2019-01-12 15:33:31,224 WARN L181 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 422 DAG size of output: 144 [2019-01-12 15:33:34,122 WARN L181 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 302 DAG size of output: 99 [2019-01-12 15:33:34,876 WARN L181 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 101 [2019-01-12 15:33:38,469 WARN L181 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 422 DAG size of output: 144 [2019-01-12 15:33:39,705 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 240 DAG size of output: 89 [2019-01-12 15:33:40,480 WARN L181 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 101 [2019-01-12 15:33:41,069 WARN L181 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 77 [2019-01-12 15:33:42,091 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 151 DAG size of output: 38 [2019-01-12 15:33:43,284 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 225 DAG size of output: 106 [2019-01-12 15:33:43,865 WARN L181 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2019-01-12 15:33:45,133 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 268 DAG size of output: 105 [2019-01-12 15:34:02,656 WARN L181 SmtUtils]: Spent 17.51 s on a formula simplification. DAG size of input: 1103 DAG size of output: 218 [2019-01-12 15:34:03,157 WARN L181 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2019-01-12 15:34:09,445 WARN L181 SmtUtils]: Spent 6.28 s on a formula simplification. DAG size of input: 636 DAG size of output: 169 [2019-01-12 15:34:10,627 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 225 DAG size of output: 106 [2019-01-12 15:34:16,283 WARN L181 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 549 DAG size of output: 167 [2019-01-12 15:34:17,070 WARN L181 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 101 [2019-01-12 15:34:17,347 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2019-01-12 15:34:18,112 WARN L181 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 101 [2019-01-12 15:34:19,311 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 225 DAG size of output: 106 [2019-01-12 15:34:20,183 WARN L181 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 101 [2019-01-12 15:34:20,858 WARN L181 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 77 [2019-01-12 15:34:23,384 WARN L181 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 280 DAG size of output: 117 [2019-01-12 15:34:24,469 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 259 DAG size of output: 114 [2019-01-12 15:34:24,612 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-01-12 15:34:25,871 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 266 DAG size of output: 113 [2019-01-12 15:34:26,446 WARN L181 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 77 [2019-01-12 15:34:26,948 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2019-01-12 15:34:27,456 WARN L181 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2019-01-12 15:34:32,966 WARN L181 SmtUtils]: Spent 5.45 s on a formula simplification. DAG size of input: 535 DAG size of output: 167 [2019-01-12 15:34:38,262 WARN L181 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 459 DAG size of output: 159 [2019-01-12 15:34:39,076 WARN L181 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 101 [2019-01-12 15:34:39,887 WARN L181 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 101 [2019-01-12 15:34:45,158 WARN L181 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 531 DAG size of output: 159 [2019-01-12 15:34:46,360 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 258 DAG size of output: 99 [2019-01-12 15:34:47,404 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 230 DAG size of output: 99 [2019-01-12 15:34:49,155 WARN L181 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 211 DAG size of output: 97 [2019-01-12 15:34:54,311 WARN L181 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 531 DAG size of output: 159 [2019-01-12 15:34:59,277 WARN L181 SmtUtils]: Spent 4.96 s on a formula simplification. DAG size of input: 514 DAG size of output: 153 [2019-01-12 15:34:59,537 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 55 [2019-01-12 15:35:02,918 WARN L181 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 331 DAG size of output: 135 [2019-01-12 15:35:03,492 WARN L181 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 77 [2019-01-12 15:35:04,063 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 77 [2019-01-12 15:35:04,740 WARN L181 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 77 [2019-01-12 15:35:05,573 WARN L181 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 90 [2019-01-12 15:35:05,577 INFO L448 ceAbstractionStarter]: For program point L564(lines 564 617) no Hoare annotation was computed. [2019-01-12 15:35:05,578 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 130) no Hoare annotation was computed. [2019-01-12 15:35:05,578 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 835) no Hoare annotation was computed. [2019-01-12 15:35:05,578 INFO L444 ceAbstractionStarter]: At program point L829-1(lines 829 835) the Hoare annotation is: (let ((.cse19 (<= 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)) (.cse9 (+ ~req_tt_a~0 52))) (let ((.cse8 (= 0 ~c_req_type~0)) (.cse15 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ~s_memory1~0 51)) (.cse12 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse9)) (.cse13 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse14 (= ~s_memory2~0 52)) (.cse16 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse9)) (.cse5 (and .cse19 (and (= ~c_empty_req~0 1) .cse1 .cse2 .cse4) .cse0 .cse3)) (.cse6 (= ~m_run_pc~0 6)) (.cse17 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= 2 ~a_t~0))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) (<= 3 ~m_run_pc~0) .cse4) (<= 2 ~s_run_pc~0)) (and (and .cse5 .cse6) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse8 (= (+ ~s_memory2~0 ~c_req_a~0) .cse9) .cse10 .cse11 .cse12 .cse13 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse15 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse16 (= ~a_t~0 0)) (and .cse8 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse15 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse6) .cse7 .cse10 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse12 .cse13 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse14 .cse16 (= ~a_t~0 1)) (and (and .cse5 .cse17 .cse18) .cse6) (and (and (and (= ~m_run_pc~0 3) .cse1 .cse2 .cse4) .cse19 .cse0 .cse3) .cse17 .cse18)))) [2019-01-12 15:35:05,579 INFO L444 ceAbstractionStarter]: At program point L763(lines 756 809) the Hoare annotation is: (let ((.cse4 (+ ~req_tt_a~0 52))) (let ((.cse3 (= 0 ~c_req_type~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (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))) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse4)) (.cse8 (= ~s_memory2~0 52)) (.cse10 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse4))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (and .cse0 .cse1) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 (= (+ ~s_memory2~0 ~c_req_a~0) .cse4) .cse5 .cse6 .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse10 (= ~a_t~0 0)) (and (= 52 ~c_rsp_d~0) .cse6 .cse7 (and .cse2 .cse3 .cse5 (and (and .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1)) .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse10 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse0) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse1) .cse2 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 .cse10 (= ~a_t~0 1))))) [2019-01-12 15:35:05,580 INFO L444 ceAbstractionStarter]: At program point L697(lines 690 725) the Hoare annotation is: (let ((.cse10 (+ ~req_tt_a~0 52))) (let ((.cse3 (= ~s_memory1~0 51)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse10)) (.cse4 (= ~s_memory2~0 52)) (.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (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)))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse10))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 .cse2 .cse3 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (and (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5 .cse6) (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse8 (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and (and (and .cse5 (<= ULTIMATE.start_m_run_~a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse6) .cse7 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse4 .cse8 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse3 .cse9 .cse4 (and .cse0 .cse1 .cse2 (and (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) .cse5 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse6)) (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse7 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse8 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2))))) [2019-01-12 15:35:05,580 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 569) no Hoare annotation was computed. [2019-01-12 15:35:05,581 INFO L444 ceAbstractionStarter]: At program point L1094(lines 1087 1104) the Hoare annotation is: (let ((.cse29 (+ ~c_req_a~0 50)) (.cse27 (= ~c_empty_req~0 1)) (.cse28 (= ~m_run_st~0 0)) (.cse24 (<= 2 ~c_write_req_ev~0)) (.cse25 (<= 1 ~c_m_lock~0)) (.cse30 (+ ~req_tt_a~0 52))) (let ((.cse18 (= ~s_memory2~0 52)) (.cse19 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse30)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= 0 ~c_req_type~0)) (.cse15 (and (and .cse27 .cse28) .cse24 .cse25 (= ~s_run_pc~0 2))) (.cse7 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= 2 ~a_t~0)) (.cse16 (= ~m_run_pc~0 6)) (.cse4 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse10 (= ~s_memory1~0 51)) (.cse11 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse20 (= (+ ~s_memory2~0 ~c_req_a~0) (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse17 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse30)) (.cse0 (<= .cse29 ~c_req_d~0)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse29)) (.cse21 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse6 (and .cse24 .cse25 (let ((.cse26 (and .cse27 (= ~m_run_pc~0 3) .cse28))) (or (and (= ~s_run_pc~0 0) .cse26) (and (<= 2 ~s_run_pc~0) .cse26))))) (.cse9 (= ~s_memory0~0 50)) (.cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse12 (= ~c_write_rsp_ev~0 1)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse23 (= ~a_t~0 1))) (or (and .cse0 (= 52 ~c_req_d~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (and .cse4 .cse5 (and .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12)) (and .cse0 .cse1 (= ULTIMATE.start_s_run_~req_a~1 0) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse6) .cse5 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse12 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 (and (= 0 ~c_req_a~0) .cse13 .cse14 .cse15 .cse16) .cse10 .cse17 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse18 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse2 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse19 (= ~a_t~0 0)) (and .cse20 (= 51 ULTIMATE.start_s_memory_read_~x~0) (and (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (and (and (and (and .cse15 .cse21) .cse22) .cse16) .cse13 .cse14) (<= ~c_req_a~0 1) .cse12) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse17 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse18 .cse2 (= 51 ~c_rsp_d~0) .cse19 .cse23) (and (and (and (and .cse13 .cse14 (and (and .cse15 .cse7 .cse8) .cse16)) .cse9 .cse12) (<= 2 ~c_req_a~0) .cse4 .cse10 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse11 (<= ~c_req_a~0 2)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse20 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse17) (and .cse0 .cse5 .cse1 .cse21 (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse12) .cse22 .cse23)))) [2019-01-12 15:35:05,583 INFO L444 ceAbstractionStarter]: At program point L1161(lines 1113 1166) the Hoare annotation is: (let ((.cse37 (= ~s_run_pc~0 2)) (.cse46 (<= 1 ~c_req_type~0)) (.cse27 (= ~m_run_pc~0 3)) (.cse24 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~c_empty_rsp~0 1))) (let ((.cse45 (+ ~c_req_a~0 50)) (.cse35 (<= ~c_req_type~0 1)) (.cse38 (and .cse46 .cse27 .cse24 .cse25)) (.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse44 (not .cse37)) (.cse34 (<= 2 ~c_write_req_ev~0)) (.cse43 (and .cse24 .cse25)) (.cse36 (<= 1 ~c_m_lock~0)) (.cse47 (+ ~s_memory2~0 ~c_req_a~0))) (let ((.cse10 (<= ~c_req_a~0 2)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (= .cse47 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse12 (= .cse47 (+ ~req_tt_a~0 52))) (.cse13 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (= ~s_memory1~0 51)) (.cse6 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (and .cse34 .cse43 .cse36 .cse37)) (.cse32 (<= 50 ~c_req_d~0)) (.cse40 (and .cse18 .cse19 (and .cse46 .cse27 .cse24 .cse44 .cse25))) (.cse29 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse39 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 2 ~a_t~0)) (.cse3 (= ~m_run_pc~0 6)) (.cse22 (<= 2 ~s_run_st~0)) (.cse28 (<= 2 ~s_run_pc~0)) (.cse17 (= ~s_run_pc~0 0)) (.cse21 (<= ~m_run_pc~0 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse41 (= 0 ~c_req_a~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse26 (= ~a_t~0 0)) (.cse23 (<= ~c_m_lock~0 0)) (.cse15 (and .cse34 .cse35 .cse36 .cse37 .cse38)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (<= ~c_req_d~0 .cse45)) (.cse31 (= ~a_t~0 1))) (or (and (and (<= 2 ~c_req_a~0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (and (and .cse15 .cse10) .cse1 .cse2) .cse6 (= ~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) .cse8 .cse9) (= 52 ~c_req_d~0) .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (and (and .cse0 .cse3) .cse5) .cse14 .cse12 .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ~req_tt_a~0 0) .cse13 (= ULTIMATE.start_s_run_~req_a~1 2) .cse26) (and (and .cse20 .cse27 .cse24 .cse25) .cse28) (and .cse11 .cse12 .cse13 .cse7 (and (<= 1 ~c_req_a~0) .cse6 (and .cse4 .cse5 (and (and .cse0 .cse29) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3)) (<= ~c_req_a~0 1)) (= ~req_tt_a~0 1) .cse30 .cse31) (and (and (<= ~c_req_d~0 50) .cse32 (and .cse33 (and .cse34 .cse35 .cse36 .cse37 (and .cse18 .cse19 .cse38)))) .cse26 .cse39) (and (and .cse32 (and .cse33 (and .cse17 .cse34 .cse35 .cse40 .cse36))) .cse16 .cse26 .cse39) (and .cse17 .cse22 .cse40) (and .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse22 .cse26 .cse37 .cse23 .cse24) (and (let ((.cse42 (and (and .cse34 .cse22 .cse43 .cse37) .cse36))) (or (and (and (<= ~a_t~0 1) .cse29 .cse42) (<= 1 ~a_t~0) .cse30) (and (<= 0 ~a_t~0) (and .cse33 (<= ~a_t~0 0) .cse42) .cse39) (and .cse1 .cse42 .cse2))) .cse3) (and .cse34 .cse22 (and .cse27 .cse24 .cse25) .cse37) (and (and .cse1 .cse2 (and .cse20 .cse34 .cse22 .cse28 .cse24 .cse25)) .cse3) (and .cse22 .cse28 (and .cse24 .cse44 .cse25)) (and .cse17 .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse26 .cse23 .cse24) (and (and .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (<= .cse45 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) .cse16 (= ULTIMATE.start_s_run_~req_a~1 0) .cse31))))) [2019-01-12 15:35:05,583 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2019-01-12 15:35:05,583 INFO L448 ceAbstractionStarter]: For program point L765(lines 765 769) no Hoare annotation was computed. [2019-01-12 15:35:05,583 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,583 INFO L448 ceAbstractionStarter]: For program point L699(lines 699 703) no Hoare annotation was computed. [2019-01-12 15:35:05,584 INFO L444 ceAbstractionStarter]: At program point L1294(lines 1287 1313) the Hoare annotation is: (let ((.cse37 (= ~s_run_pc~0 2)) (.cse46 (<= 1 ~c_req_type~0)) (.cse27 (= ~m_run_pc~0 3)) (.cse24 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~c_empty_rsp~0 1))) (let ((.cse45 (+ ~c_req_a~0 50)) (.cse35 (<= ~c_req_type~0 1)) (.cse38 (and .cse46 .cse27 .cse24 .cse25)) (.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse44 (not .cse37)) (.cse34 (<= 2 ~c_write_req_ev~0)) (.cse43 (and .cse24 .cse25)) (.cse36 (<= 1 ~c_m_lock~0)) (.cse47 (+ ~s_memory2~0 ~c_req_a~0))) (let ((.cse10 (<= ~c_req_a~0 2)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (= .cse47 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse12 (= .cse47 (+ ~req_tt_a~0 52))) (.cse13 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (= ~s_memory1~0 51)) (.cse6 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (and .cse34 .cse43 .cse36 .cse37)) (.cse32 (<= 50 ~c_req_d~0)) (.cse40 (and .cse18 .cse19 (and .cse46 .cse27 .cse24 .cse44 .cse25))) (.cse29 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse39 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 2 ~a_t~0)) (.cse3 (= ~m_run_pc~0 6)) (.cse22 (<= 2 ~s_run_st~0)) (.cse28 (<= 2 ~s_run_pc~0)) (.cse17 (= ~s_run_pc~0 0)) (.cse21 (<= ~m_run_pc~0 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse41 (= 0 ~c_req_a~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse26 (= ~a_t~0 0)) (.cse23 (<= ~c_m_lock~0 0)) (.cse15 (and .cse34 .cse35 .cse36 .cse37 .cse38)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (<= ~c_req_d~0 .cse45)) (.cse31 (= ~a_t~0 1))) (or (and (and (<= 2 ~c_req_a~0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (and (and .cse15 .cse10) .cse1 .cse2) .cse6 (= ~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) .cse8 .cse9) (= 52 ~c_req_d~0) .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (and (and .cse0 .cse3) .cse5) .cse14 .cse12 .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ~req_tt_a~0 0) .cse13 (= ULTIMATE.start_s_run_~req_a~1 2) .cse26) (and (and .cse20 .cse27 .cse24 .cse25) .cse28) (and .cse11 .cse12 .cse13 .cse7 (and (<= 1 ~c_req_a~0) .cse6 (and .cse4 .cse5 (and (and .cse0 .cse29) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3)) (<= ~c_req_a~0 1)) (= ~req_tt_a~0 1) .cse30 .cse31) (and (and (<= ~c_req_d~0 50) .cse32 (and .cse33 (and .cse34 .cse35 .cse36 .cse37 (and .cse18 .cse19 .cse38)))) .cse26 .cse39) (and (and .cse32 (and .cse33 (and .cse17 .cse34 .cse35 .cse40 .cse36))) .cse16 .cse26 .cse39) (and .cse17 .cse22 .cse40) (and .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse22 .cse26 .cse37 .cse23 .cse24) (and (let ((.cse42 (and (and .cse34 .cse22 .cse43 .cse37) .cse36))) (or (and (and (<= ~a_t~0 1) .cse29 (<= 1 ~a_t~0) .cse42) .cse30) (and (<= 0 ~a_t~0) (and .cse33 (<= ~a_t~0 0) .cse42) .cse39) (and .cse1 .cse2 .cse42))) .cse3) (and .cse34 .cse22 (and .cse27 .cse24 .cse25) .cse37) (and (and .cse1 .cse2 (and .cse20 .cse34 .cse22 .cse28 .cse24 .cse25)) .cse3) (and .cse22 .cse28 (and .cse24 .cse44 .cse25)) (and .cse17 .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse26 .cse23 .cse24) (and (and .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (<= .cse45 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) .cse16 (= ULTIMATE.start_s_run_~req_a~1 0) .cse31))))) [2019-01-12 15:35:05,584 INFO L444 ceAbstractionStarter]: At program point L237(lines 230 265) the Hoare annotation is: (let ((.cse22 (= ~s_run_pc~0 2)) (.cse24 (<= 1 ~c_req_type~0)) (.cse25 (<= ~m_run_pc~0 0)) (.cse26 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse27 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse23 (+ ~c_req_a~0 50)) (.cse21 (and .cse24 (or (and .cse25 .cse2 .cse1) (and .cse26 .cse1 .cse2)) .cse27)) (.cse3 (<= 2 ~s_run_st~0)) (.cse11 (<= ~c_req_type~0 1)) (.cse14 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse0 (not .cse22)) (.cse19 (<= 0 ~c_req_a~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a~0 0))) (let ((.cse4 (= ~s_run_pc~0 0)) (.cse5 (and (and .cse24 (or (and .cse25 .cse2 .cse0 .cse1) (and .cse26 .cse0 .cse1 .cse2)) .cse27) (<= ~c_req_a~0 0) (<= ULTIMATE.start_m_run_~a~0 0) .cse19 .cse20 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ULTIMATE.start_m_run_~req_a~0))) (.cse12 (<= ~c_req_d~0 50)) (.cse13 (<= 50 ~c_req_d~0)) (.cse9 (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (and .cse21 .cse3 .cse11 .cse14 .cse15 .cse22)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 (+ ULTIMATE.start_m_run_~req_a~0 50))) (.cse7 (<= ~c_req_d~0 .cse23)) (.cse10 (<= .cse23 ~c_req_d~0)) (.cse16 (= ~a_t~0 0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse3 .cse5) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse7 (= ~s_memory0~0 50) (= ULTIMATE.start_m_run_~req_d~0 52) (= ~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) (and (and (<= 2 ~c_req_a~0) (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse8 (<= ULTIMATE.start_m_run_~req_a~0 2)) .cse9) .cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_m_run_~a~0 2) (= ~a_t~0 1)) (and .cse4 .cse11 .cse12 .cse13 .cse5 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse12 .cse13 (and (and .cse3 .cse11 (and .cse19 .cse20 .cse21) .cse14 .cse15 .cse22) .cse9) .cse16 .cse17 .cse18 (= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse6 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse7 (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 (<= ~c_req_d~0 51) .cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)))))) [2019-01-12 15:35:05,584 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 129) no Hoare annotation was computed. [2019-01-12 15:35:05,585 INFO L448 ceAbstractionStarter]: For program point L1096(lines 1096 1100) no Hoare annotation was computed. [2019-01-12 15:35:05,585 INFO L444 ceAbstractionStarter]: At program point L106(lines 101 843) 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:35:05,585 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,585 INFO L444 ceAbstractionStarter]: At program point L437(lines 430 456) the Hoare annotation is: (let ((.cse10 (<= 2 ~s_run_st~0)) (.cse8 (= ~s_run_pc~0 2)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse11 (+ ~c_req_a~0 50))) (let ((.cse2 (= ~s_memory0~0 50)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse11)) (.cse3 (and (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse10 .cse8 (= ~m_run_pc~0 3) .cse6 .cse7 .cse9)) (.cse4 (<= .cse11 ~c_req_d~0))) (or (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse3) .cse4 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5) (and (and .cse6 .cse7 (not .cse8) .cse9) .cse10 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (= ~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) .cse4 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse3 (<= ~c_req_d~0 50) .cse4 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-01-12 15:35:05,585 INFO L448 ceAbstractionStarter]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2019-01-12 15:35:05,585 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 243) no Hoare annotation was computed. [2019-01-12 15:35:05,585 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 970) no Hoare annotation was computed. [2019-01-12 15:35:05,586 INFO L444 ceAbstractionStarter]: At program point L174(lines 144 175) the Hoare annotation is: (let ((.cse14 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse1 (= ~c_empty_req~0 1)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse15 (= ~s_run_pc~0 2)) (.cse5 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse22 (+ ~c_req_a~0 50))) (let ((.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse13 (= 0 ~c_req_type~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse0 (= ~s_run_pc~0 0)) (.cse17 (= 0 ~c_req_a~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse21 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse10 (<= ~c_req_d~0 .cse22)) (.cse11 (and .cse14 .cse4 (and .cse1 (= ~m_run_pc~0 3) .cse7 .cse6) .cse16 .cse15 .cse5)) (.cse12 (<= .cse22 ~c_req_d~0)) (.cse18 (= ~a_t~0 0)) (.cse19 (<= ULTIMATE.start_m_run_~req_d~0 (+ ULTIMATE.start_m_run_~req_a~0 50)))) (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 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse9 .cse10 (= ~s_memory0~0 50) (= ULTIMATE.start_m_run_~req_d~0 52) (= ~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) (and .cse11 (<= 2 ULTIMATE.start_m_run_~req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 2)) .cse12 (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_m_run_~a~0 2) (= ~a_t~0 1)) (and .cse13 (and (and .cse1 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7) .cse16 .cse5) .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse3 .cse13 .cse7 .cse1 .cse16 .cse5 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 50) .cse0 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0) .cse17 .cse14 .cse18 .cse20 .cse6 .cse21) (and .cse4 (<= 2 ~s_run_pc~0) (and (not .cse15) .cse7 .cse6)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 .cse10 (and (and (<= ULTIMATE.start_m_run_~a~0 1) (and (<= ULTIMATE.start_m_run_~req_a~0 1) .cse11)) (<= 1 ULTIMATE.start_m_run_~a~0)) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse12 (<= 50 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse18 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-01-12 15:35:05,586 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 128) no Hoare annotation was computed. [2019-01-12 15:35:05,586 INFO L448 ceAbstractionStarter]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2019-01-12 15:35:05,586 INFO L444 ceAbstractionStarter]: At program point L571(lines 564 617) the Hoare annotation is: (let ((.cse18 (+ ~req_tt_a~0 52)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse17 (= ~s_run_pc~0 2))) (let ((.cse4 (<= 2 ~s_run_pc~0)) (.cse1 (not .cse17)) (.cse5 (= 0 ~c_req_type~0)) (.cse8 (and .cse0 (and .cse2 .cse3) .cse16 .cse17)) (.cse13 (= ~m_run_pc~0 6)) (.cse6 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse9 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ~s_memory1~0 51)) (.cse12 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse18)) (.cse14 (= ~s_memory2~0 52)) (.cse15 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse18))) (or (and .cse0 (and .cse1 .cse2 .cse3 (<= 3 ~m_run_pc~0)) .cse4) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse4 .cse1 .cse2 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse5 .cse6 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) .cse7 (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) .cse8 .cse9 .cse10 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse12 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse13 .cse14 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse15 (= ~a_t~0 1) (<= ~c_req_a~0 2)) (and (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) (and .cse0 .cse16 .cse17 (and (= ~m_run_pc~0 3) .cse2 .cse3))) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse5 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= 0 ~c_req_a~0) .cse14 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 (and (and .cse8 (<= 1 ULTIMATE.start_m_run_~a~0)) .cse13) .cse6 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= ULTIMATE.start_m_run_~a~0 1) .cse7 (= 50 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 .cse12 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse15 (= ~a_t~0 0))))) [2019-01-12 15:35:05,587 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-01-12 15:35:05,587 INFO L444 ceAbstractionStarter]: At program point L109(lines 101 843) 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:35:05,587 INFO L448 ceAbstractionStarter]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2019-01-12 15:35:05,587 INFO L444 ceAbstractionStarter]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse19 (= ~c_empty_rsp~0 1)) (.cse17 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse22 (<= 2 ~c_write_req_ev~0)) (.cse23 (<= 1 ~c_m_lock~0)) (.cse18 (= ~s_run_pc~0 2)) (.cse50 (and .cse19 .cse17))) (let ((.cse41 (<= 2 ~c_req_a~0)) (.cse2 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse31 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse32 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse43 (<= ~c_req_a~0 2)) (.cse37 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse28 (= ~a_t~0 0)) (.cse30 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse6 (= ~s_memory1~0 51)) (.cse34 (<= 1 ~c_req_a~0)) (.cse8 (= ~s_memory0~0 50)) (.cse20 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse39 (<= ~a_t~0 1)) (.cse1 (<= 1 ~a_t~0)) (.cse11 (<= 0 ~a_t~0)) (.cse38 (<= ~a_t~0 0)) (.cse12 (and .cse22 .cse23 .cse18 .cse50)) (.cse25 (= ~m_run_pc~0 6)) (.cse9 (= 0 ~c_req_type~0)) (.cse33 (<= ~c_req_a~0 1)) (.cse40 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse48 (+ ~s_memory2~0 ~c_req_a~0)) (.cse47 (+ ~req_tt_a~0 52)) (.cse21 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~s_run_st~0))) (let ((.cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse10 (= 0 ~c_req_a~0)) (.cse7 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse0 (and (and .cse22 .cse16 .cse18 .cse50) .cse23)) (.cse26 (= ~s_memory2~0 52)) (.cse5 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse29 (and .cse21 .cse22 .cse16 .cse23 .cse18 .cse17)) (.cse36 (<= 2 ~a_t~0)) (.cse14 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse45 (= .cse48 .cse47)) (.cse46 (and .cse37 (let ((.cse49 (and .cse34 (and .cse8 (and .cse20 (and (or (and .cse39 .cse1 .cse12) (and .cse11 .cse38 .cse12)) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse25) .cse9)) .cse33))) (or (and .cse30 .cse6 .cse28 .cse49) (and .cse30 .cse6 .cse49 (= ~req_tt_a~0 1)))) .cse40)) (.cse27 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse47)) (.cse44 (and .cse41 (and .cse8 (and (and (and .cse1 .cse12 .cse2) .cse25) .cse20 .cse9) .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) .cse31 .cse32 (<= ULTIMATE.start_s_memory_read_~i 1)) .cse43)) (.cse42 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse3 (= .cse48 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse4 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse24 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse47)) (.cse35 (= ~a_t~0 1))) (or (and .cse0 .cse1 .cse2) (and (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse3 .cse4 (and .cse5 (and .cse6 (and .cse7 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (and .cse8 (and .cse9 (and .cse10 (and .cse11 .cse12))) .cse13))) .cse14 .cse15)) (and .cse16 (<= 2 ~s_run_pc~0) (and .cse17 (not .cse18) .cse19)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 (= 50 ~c_rsp_d~0) .cse15 .cse20 (and .cse7 .cse21 .cse22 .cse16 .cse23 .cse18 .cse17) .cse8 .cse6 .cse24 .cse25 .cse13 .cse10 .cse26 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse27 .cse28) (and (and .cse7 .cse0) .cse11 .cse15) (and (and .cse29 .cse25) (= ULTIMATE.start_m_run_~a~0 1) .cse9 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse4 (= 51 ~c_rsp_d~0) .cse30 .cse20 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse31 .cse24 .cse32 .cse33 .cse34 .cse26 .cse27 .cse35) (and (and (and .cse22 (and .cse21 .cse17 .cse19) .cse16 .cse18) .cse2 .cse36) .cse25) (and (or (and .cse11 .cse0 .cse37 .cse38) (and .cse0 .cse39 .cse1)) .cse40) (and (= 52 ~c_rsp_d~0) .cse6 .cse24 .cse26 .cse41 .cse42 .cse5 (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse4 .cse27 (and .cse20 .cse9 .cse8 (and (and .cse29 .cse2 .cse36) .cse25)) .cse14 .cse43) (and .cse44 .cse42 .cse3 .cse45 .cse4) (and .cse45 .cse4 .cse46 .cse35) (and .cse3 .cse4 .cse46 .cse27 .cse24) (and .cse44 .cse42 .cse3 .cse4 .cse24 (= ULTIMATE.start_m_run_~a~0 2) .cse35)))))) [2019-01-12 15:35:05,588 INFO L444 ceAbstractionStarter]: At program point L771(lines 764 808) the Hoare annotation is: (let ((.cse4 (+ ~req_tt_a~0 52))) (let ((.cse3 (= 0 ~c_req_type~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (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))) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse4)) (.cse8 (= ~s_memory2~0 52)) (.cse10 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse4))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (and .cse0 .cse1) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 (= (+ ~s_memory2~0 ~c_req_a~0) .cse4) .cse5 .cse6 .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse10 (= ~a_t~0 0)) (and (= 52 ~c_rsp_d~0) .cse6 .cse7 (and .cse2 .cse3 .cse5 (and (and .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1)) .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse10 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse0) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse1) .cse2 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 .cse10 (= ~a_t~0 1))))) [2019-01-12 15:35:05,588 INFO L444 ceAbstractionStarter]: At program point L705(lines 698 724) the Hoare annotation is: (let ((.cse10 (+ ~req_tt_a~0 52))) (let ((.cse3 (= ~s_memory1~0 51)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse10)) (.cse4 (= ~s_memory2~0 52)) (.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (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)))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse10))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 .cse2 .cse3 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (and (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5 .cse6) (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse8 (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and (and (and .cse5 (<= ULTIMATE.start_m_run_~a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse6) .cse7 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse4 .cse8 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse3 .cse9 .cse4 (and .cse0 .cse1 .cse2 (and (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) .cse5 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse6)) (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse7 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse8 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2))))) [2019-01-12 15:35:05,588 INFO L448 ceAbstractionStarter]: For program point L639(lines 638 666) no Hoare annotation was computed. [2019-01-12 15:35:05,588 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-01-12 15:35:05,589 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 127) no Hoare annotation was computed. [2019-01-12 15:35:05,589 INFO L444 ceAbstractionStarter]: At program point L904(lines 878 905) the Hoare annotation is: (let ((.cse29 (<= 1 ~c_req_type~0)) (.cse30 (= ~m_run_pc~0 3)) (.cse31 (<= 2 ~c_write_rsp_ev~0)) (.cse32 (= ~c_empty_rsp~0 1))) (let ((.cse33 (+ ~s_memory2~0 ~c_req_a~0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= ~c_req_type~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse2 (and .cse29 .cse30 .cse31 .cse32))) (let ((.cse13 (and .cse3 .cse4 .cse5 .cse6 .cse2)) (.cse22 (<= ~c_req_a~0 1)) (.cse8 (<= ~c_req_d~0 (+ ~c_req_a~0 50))) (.cse24 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse26 (= ~a_t~0 1)) (.cse23 (= ~s_memory2~0 52)) (.cse7 (= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (= .cse33 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse27 (= .cse33 (+ ~req_tt_a~0 52))) (.cse25 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (<= 2 ~c_req_a~0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ~s_memory1~0 51)) (.cse19 (= 0 ~c_req_type~0)) (.cse20 (and .cse3 (and .cse31 .cse32) .cse5 .cse6)) (.cse15 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 2 ~a_t~0)) (.cse21 (= ~m_run_pc~0 6)) (.cse14 (<= ~c_req_a~0 2)) (.cse9 (= ~a_t~0 0)) (.cse0 (<= 50 ~c_req_d~0)) (.cse1 (<= ~c_req_a~0 0))) (or (and (and .cse0 (and (and .cse1 .cse2) .cse3 .cse4 .cse5 .cse6)) .cse7 .cse8 .cse9) (and (= 52 ~c_req_d~0) (and (<= ULTIMATE.start_s_memory_write_~v 51) .cse10 .cse11 (<= 51 ULTIMATE.start_s_memory_write_~v) (and (and .cse12 .cse13 .cse14) .cse15 .cse16))) (and .cse17 .cse11 (= ~req_tt_a~0 1) .cse18 (and (<= 1 ~c_req_a~0) .cse10 (and .cse19 (and .cse20 .cse21)) .cse22) .cse23 .cse24 .cse25 .cse26) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (and .cse13 .cse22) (<= 51 ~c_req_d~0)) .cse8 .cse24 .cse18 .cse26) (and (and .cse20 .cse19 .cse21) .cse27 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse23 .cse7 (= ~req_tt_a~0 0) .cse25 .cse9) (and (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse17 .cse27 .cse25 (and .cse12 .cse10 .cse11 (and .cse19 (and (and .cse20 .cse15 .cse16) .cse21)) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse14 (<= ULTIMATE.start_s_memory_read_~i 1))) (and .cse9 (and (<= ~c_req_d~0 50) .cse0 (and (<= ULTIMATE.start_m_run_~a~0 0) (and .cse3 .cse4 .cse5 (let ((.cse28 (and .cse1 (<= 0 ~c_req_a~0) .cse29 .cse30 .cse31 (not .cse6) .cse32))) (or (and .cse28 (<= 2 ~s_run_pc~0)) (and (= ~s_run_pc~0 0) .cse28)))))) (<= 0 ULTIMATE.start_m_run_~a~0)))))) [2019-01-12 15:35:05,589 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 644) no Hoare annotation was computed. [2019-01-12 15:35:05,590 INFO L444 ceAbstractionStarter]: At program point L112(lines 101 843) the Hoare annotation is: (let ((.cse38 (<= 1 ~c_req_type~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse10 (= ~s_run_pc~0 2))) (let ((.cse8 (<= ~c_req_a~0 0)) (.cse14 (not .cse10)) (.cse39 (+ ~c_req_a~0 50)) (.cse37 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~s_run_st~0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= ~c_req_type~0 1)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse9 (and .cse38 .cse12 .cse13 .cse15))) (let ((.cse18 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse21 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse24 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse25 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse3 (<= ~c_req_d~0 50)) (.cse4 (<= 50 ~c_req_d~0)) (.cse7 (= ~a_t~0 0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse31 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse32 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse33 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse34 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (and .cse5 .cse1 .cse6 .cse10 .cse9)) (.cse35 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse29 (<= ~c_req_d~0 51)) (.cse36 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse30 (= ~a_t~0 1)) (.cse28 (and .cse37 .cse5 .cse16 .cse6 .cse10 .cse12 .cse13)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse11 (<= ~c_req_d~0 .cse39)) (.cse20 (= ~s_memory0~0 50)) (.cse26 (<= .cse39 ~c_req_d~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= ~s_run_pc~0 0)) (.cse2 (and .cse8 (<= 0 ~c_req_a~0) .cse38 .cse12 .cse13 .cse14 .cse15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse4 (and (and .cse8 .cse9) .cse5 .cse1 .cse6 .cse10) .cse11 .cse7) (and (and .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (and .cse18 .cse19 .cse11 .cse20 .cse21 (and .cse22 (<= 2 ~c_req_a~0) (<= ~c_req_a~0 2)) .cse23 .cse24 .cse25 .cse26 .cse27 (<= 2 ~a_t~0)) (and .cse18 .cse19 .cse11 .cse20 .cse21 .cse23 .cse24 .cse25 (<= 51 ~c_req_d~0) .cse28 .cse26 .cse29 .cse27 .cse30) (and .cse31 .cse32 .cse19 .cse11 .cse33 .cse28 .cse34 .cse3 .cse26 .cse4 .cse35 .cse7 .cse36) (and .cse37 .cse17 .cse12 .cse13 .cse15) (and .cse31 .cse32 .cse19 .cse33 .cse34 (and (<= 1 ~c_req_a~0) .cse22) .cse26 .cse35 .cse29 .cse36 .cse30) (and .cse5 .cse16 (and .cse12 .cse13 .cse15) .cse10) (and (and .cse28 (<= ~c_req_a~0 ~a_t~0)) (= 52 ~c_req_d~0) .cse19 .cse11 .cse20 (= ~s_memory1~0 51) .cse26 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse27) (and .cse0 .cse16 .cse2))))) [2019-01-12 15:35:05,590 INFO L444 ceAbstractionStarter]: At program point L178-2(lines 178 206) the Hoare annotation is: (let ((.cse14 (+ ULTIMATE.start_m_run_~req_a~0 50)) (.cse24 (+ ~c_req_a~0 50)) (.cse20 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse23 (= ~s_run_pc~0 2)) (.cse1 (= ~c_empty_req~0 1)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse11 (and .cse20 .cse4 .cse17 .cse18 .cse23 (and .cse1 (= ~m_run_pc~0 3) .cse7 .cse6) .cse5)) (.cse9 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse10 (<= ~c_req_d~0 .cse24)) (.cse12 (<= .cse24 ~c_req_d~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse0 (= ~s_run_pc~0 0)) (.cse16 (= 0 ~c_req_type~0)) (.cse19 (= 0 ~c_req_a~0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse3 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse15 (<= ULTIMATE.start_m_run_~req_d~0 .cse14)) (.cse21 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse22 (= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (<= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ULTIMATE.start_m_run_~a~0) .cse8) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 .cse10 (= ~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) (and (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse11) (<= ~c_req_d~0 50) .cse12 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse13 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse9 .cse10 (<= .cse14 ULTIMATE.start_m_run_~req_d~0) (= ~s_memory0~0 50) (= ULTIMATE.start_m_run_~req_d~0 52) (= ~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) .cse12 (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse15 (= ULTIMATE.start_m_run_~a~0 2) (= ~a_t~0 1)) (and .cse2 .cse16 .cse7 .cse1 .cse17 .cse18 .cse5 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 50) .cse0 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0) .cse19 .cse20 .cse13 .cse21 .cse6 .cse22) (and (and (not .cse23) .cse7 .cse6) .cse4 (<= 2 ~s_run_pc~0)) (and .cse16 .cse19 (and .cse2 .cse3 .cse7 .cse1 .cse20 .cse4 .cse17 .cse18 .cse23 .cse5 .cse6) .cse13 .cse15 .cse21 .cse22)))) [2019-01-12 15:35:05,592 INFO L448 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2019-01-12 15:35:05,592 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 711) no Hoare annotation was computed. [2019-01-12 15:35:05,593 INFO L444 ceAbstractionStarter]: At program point L1302(lines 1295 1312) the Hoare annotation is: (let ((.cse37 (= ~s_run_pc~0 2)) (.cse46 (<= 1 ~c_req_type~0)) (.cse27 (= ~m_run_pc~0 3)) (.cse24 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~c_empty_rsp~0 1))) (let ((.cse45 (+ ~c_req_a~0 50)) (.cse35 (<= ~c_req_type~0 1)) (.cse38 (and .cse46 .cse27 .cse24 .cse25)) (.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse44 (not .cse37)) (.cse34 (<= 2 ~c_write_req_ev~0)) (.cse43 (and .cse24 .cse25)) (.cse36 (<= 1 ~c_m_lock~0)) (.cse47 (+ ~s_memory2~0 ~c_req_a~0))) (let ((.cse10 (<= ~c_req_a~0 2)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (= .cse47 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse12 (= .cse47 (+ ~req_tt_a~0 52))) (.cse13 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (= ~s_memory1~0 51)) (.cse6 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (and .cse34 .cse43 .cse36 .cse37)) (.cse32 (<= 50 ~c_req_d~0)) (.cse40 (and .cse18 .cse19 (and .cse46 .cse27 .cse24 .cse44 .cse25))) (.cse29 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse39 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 2 ~a_t~0)) (.cse3 (= ~m_run_pc~0 6)) (.cse22 (<= 2 ~s_run_st~0)) (.cse28 (<= 2 ~s_run_pc~0)) (.cse17 (= ~s_run_pc~0 0)) (.cse21 (<= ~m_run_pc~0 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse41 (= 0 ~c_req_a~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse26 (= ~a_t~0 0)) (.cse23 (<= ~c_m_lock~0 0)) (.cse15 (and .cse34 .cse35 .cse36 .cse37 .cse38)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (<= ~c_req_d~0 .cse45)) (.cse31 (= ~a_t~0 1))) (or (and (and (<= 2 ~c_req_a~0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (and (and .cse15 .cse10) .cse1 .cse2) .cse6 (= ~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) .cse8 .cse9) (= 52 ~c_req_d~0) .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (and (and .cse0 .cse3) .cse5) .cse14 .cse12 .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ~req_tt_a~0 0) .cse13 (= ULTIMATE.start_s_run_~req_a~1 2) .cse26) (and (and .cse20 .cse27 .cse24 .cse25) .cse28) (and .cse11 .cse12 .cse13 .cse7 (and (<= 1 ~c_req_a~0) .cse6 (and .cse4 .cse5 (and (and .cse0 .cse29) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3)) (<= ~c_req_a~0 1)) (= ~req_tt_a~0 1) .cse30 .cse31) (and (and (<= ~c_req_d~0 50) .cse32 (and .cse33 (and .cse34 .cse35 .cse36 .cse37 (and .cse18 .cse19 .cse38)))) .cse26 .cse39) (and (and .cse32 (and .cse33 (and .cse17 .cse34 .cse35 .cse40 .cse36))) .cse16 .cse26 .cse39) (and .cse17 .cse22 .cse40) (and .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse22 .cse26 .cse37 .cse23 .cse24) (and (let ((.cse42 (and (and .cse34 .cse22 .cse43 .cse37) .cse36))) (or (and (and (<= ~a_t~0 1) .cse29 (<= 1 ~a_t~0) .cse42) .cse30) (and (<= 0 ~a_t~0) (and .cse33 (<= ~a_t~0 0) .cse42) .cse39) (and .cse1 .cse2 .cse42))) .cse3) (and .cse34 .cse22 (and .cse27 .cse24 .cse25) .cse37) (and (and .cse1 .cse2 (and .cse20 .cse34 .cse22 .cse28 .cse24 .cse25)) .cse3) (and .cse22 .cse28 (and .cse24 .cse44 .cse25)) (and .cse17 .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse26 .cse23 .cse24) (and (and .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (<= .cse45 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) .cse16 (= ULTIMATE.start_s_run_~req_a~1 0) .cse31))))) [2019-01-12 15:35:05,594 INFO L444 ceAbstractionStarter]: At program point L245(lines 238 264) the Hoare annotation is: (let ((.cse22 (= ~s_run_pc~0 2)) (.cse24 (<= 1 ~c_req_type~0)) (.cse25 (<= ~m_run_pc~0 0)) (.cse26 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse27 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse23 (+ ~c_req_a~0 50)) (.cse21 (and .cse24 (or (and .cse25 .cse2 .cse1) (and .cse26 .cse1 .cse2)) .cse27)) (.cse3 (<= 2 ~s_run_st~0)) (.cse11 (<= ~c_req_type~0 1)) (.cse14 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse0 (not .cse22)) (.cse19 (<= 0 ~c_req_a~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a~0 0))) (let ((.cse4 (= ~s_run_pc~0 0)) (.cse5 (and (and .cse24 (or (and .cse25 .cse2 .cse0 .cse1) (and .cse26 .cse0 .cse1 .cse2)) .cse27) (<= ~c_req_a~0 0) (<= ULTIMATE.start_m_run_~a~0 0) .cse19 .cse20 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ULTIMATE.start_m_run_~req_a~0))) (.cse12 (<= ~c_req_d~0 50)) (.cse13 (<= 50 ~c_req_d~0)) (.cse9 (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (and .cse21 .cse3 .cse11 .cse14 .cse15 .cse22)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 (+ ULTIMATE.start_m_run_~req_a~0 50))) (.cse7 (<= ~c_req_d~0 .cse23)) (.cse10 (<= .cse23 ~c_req_d~0)) (.cse16 (= ~a_t~0 0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse3 .cse5) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse7 (= ~s_memory0~0 50) (= ULTIMATE.start_m_run_~req_d~0 52) (= ~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) (and (and (<= 2 ~c_req_a~0) (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse8 (<= ULTIMATE.start_m_run_~req_a~0 2)) .cse9) .cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_m_run_~a~0 2) (= ~a_t~0 1)) (and .cse4 .cse11 .cse12 .cse13 .cse5 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse12 .cse13 (and (and .cse3 .cse11 (and .cse19 .cse20 .cse21) .cse14 .cse15 .cse22) .cse9) .cse16 .cse17 .cse18 (= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse6 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse7 (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 (<= ~c_req_d~0 51) .cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)))))) [2019-01-12 15:35:05,600 INFO L448 ceAbstractionStarter]: For program point L179(lines 178 206) no Hoare annotation was computed. [2019-01-12 15:35:05,600 INFO L444 ceAbstractionStarter]: At program point L972(lines 965 982) the Hoare annotation is: (let ((.cse27 (<= 1 ~c_req_type~0)) (.cse28 (= ~c_empty_req~0 1)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse29 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_rsp_ev~0)) (.cse32 (= ~c_empty_rsp~0 1))) (let ((.cse37 (and .cse27 .cse28 .cse22 .cse29 .cse30 .cse32)) (.cse23 (<= ~c_req_type~0 1)) (.cse34 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse38 (+ ~req_tt_a~0 52)) (.cse39 (+ ~s_memory2~0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse33 (<= 1 ~c_m_lock~0)) (.cse31 (= ~s_run_pc~0 2))) (let ((.cse5 (and (and .cse28 .cse30 .cse32) .cse21 .cse33 .cse31)) (.cse7 (= ~m_run_pc~0 6)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse13 (= .cse39 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse17 (= ULTIMATE.start_m_run_~a~0 1)) (.cse14 (= .cse39 .cse38)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse38)) (.cse18 (= ~a_t~0 1)) (.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse16 (and .cse21 .cse37 .cse23 .cse33 .cse31 .cse34)) (.cse12 (<= ~c_req_a~0 2)) (.cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 2 ~a_t~0)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse6 (<= ~a_t~0 0)) (.cse35 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse36 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) .cse2 (= ~req_tt_a~0 0) (and .cse3 (and (= 0 ~c_req_a~0) (and .cse4 (<= 0 ~a_t~0) .cse5 .cse6) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) .cse8) .cse9) (and (and .cse0 .cse1 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and (and (and .cse5 .cse10 .cse11) .cse7) .cse3 .cse8) .cse12 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse14 .cse2 .cse15) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (and (and (= 1 ULTIMATE.start_s_run_~req_a~1) .cse16) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) .cse17 (<= ~c_req_d~0 (+ ~c_req_a~0 50)) .cse18) (and (and .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (and .cse5 .cse7) .cse3 .cse8) (<= ~c_req_a~0 1)) .cse13 .cse17 .cse14 .cse2 .cse1 .cse15 (= ~req_tt_a~0 1) .cse18) (and (and .cse19 .cse20 (and .cse4 (and .cse21 .cse22 .cse23 (let ((.cse24 (and (<= ~c_req_a~0 0) .cse25 .cse26 (and .cse27 .cse28 .cse29 .cse30 (not .cse31) .cse32)))) (or (and (= ~s_run_pc~0 0) .cse24) (and (<= 2 ~s_run_pc~0) .cse24))) .cse33 .cse34)) .cse35 .cse36) (= ~a_t~0 0) .cse9) (and (= 52 ~c_req_d~0) (and (<= ULTIMATE.start_s_memory_write_~v 51) .cse0 .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (and (and (<= 2 ~c_req_a~0) .cse16 (= ULTIMATE.start_s_run_~req_a~1 2) .cse12) .cse10 .cse11)) (= 52 ULTIMATE.start_s_run_~req_d~1)) (and (and .cse19 .cse20 (and (<= ~c_req_a~0 ~a_t~0) (and (and .cse4 (and .cse21 .cse23 .cse33 .cse31 (and .cse25 .cse37 .cse26) .cse34)) .cse6)) .cse35 .cse36) .cse9))))) [2019-01-12 15:35:05,606 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2019-01-12 15:35:05,606 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2019-01-12 15:35:05,606 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 184) no Hoare annotation was computed. [2019-01-12 15:35:05,606 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 126) no Hoare annotation was computed. [2019-01-12 15:35:05,606 INFO L448 ceAbstractionStarter]: For program point L973(lines 965 982) no Hoare annotation was computed. [2019-01-12 15:35:05,606 INFO L444 ceAbstractionStarter]: At program point L445(lines 438 455) the Hoare annotation is: (let ((.cse10 (<= 2 ~s_run_st~0)) (.cse8 (= ~s_run_pc~0 2)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse11 (+ ~c_req_a~0 50))) (let ((.cse2 (= ~s_memory0~0 50)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse11)) (.cse3 (and (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse10 .cse8 (= ~m_run_pc~0 3) .cse6 .cse7 .cse9)) (.cse4 (<= .cse11 ~c_req_d~0))) (or (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse3) .cse4 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5) (and (and .cse6 .cse7 (not .cse8) .cse9) .cse10 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (= ~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) .cse4 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse3 (<= ~c_req_d~0 50) .cse4 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-01-12 15:35:05,607 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 383) no Hoare annotation was computed. [2019-01-12 15:35:05,607 INFO L448 ceAbstractionStarter]: For program point L1304(lines 1304 1308) no Hoare annotation was computed. [2019-01-12 15:35:05,607 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 251) no Hoare annotation was computed. [2019-01-12 15:35:05,607 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1176) no Hoare annotation was computed. [2019-01-12 15:35:05,607 INFO L444 ceAbstractionStarter]: At program point L115(lines 101 843) 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:35:05,607 INFO L448 ceAbstractionStarter]: For program point L1172-2(lines 1170 1349) no Hoare annotation was computed. [2019-01-12 15:35:05,608 INFO L444 ceAbstractionStarter]: At program point L1040(lines 1033 1086) the Hoare annotation is: (let ((.cse27 (= ~m_run_pc~0 3)) (.cse40 (+ ~c_req_a~0 50)) (.cse29 (<= 2 ~c_write_req_ev~0)) (.cse26 (= ~c_empty_req~0 1)) (.cse30 (<= 1 ~c_m_lock~0)) (.cse28 (= ~s_run_pc~0 2)) (.cse42 (+ ~s_memory2~0 ~c_req_a~0)) (.cse41 (+ ~req_tt_a~0 52))) (let ((.cse2 (<= 50 ~c_req_d~0)) (.cse3 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse9 (= ~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)) (.cse21 (= ULTIMATE.start_m_run_~a~0 0)) (.cse24 (= ~a_t~0 0)) (.cse16 (= .cse42 .cse41)) (.cse20 (= ~s_memory2~0 52)) (.cse23 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse41)) (.cse36 (= .cse42 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse22 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse31 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse32 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse12 (and .cse29 .cse26 .cse30 .cse28)) (.cse33 (<= 2 ~a_t~0)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse15 (= 0 ~c_req_type~0)) (.cse18 (= ~s_memory1~0 51)) (.cse34 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse41)) (.cse0 (<= .cse40 ~c_req_d~0)) (.cse1 (<= ~c_req_d~0 .cse40)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~s_memory0~0 50)) (.cse35 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (and .cse29 .cse30 .cse28 (and .cse26 .cse27))) (.cse37 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse8 (= ~c_write_rsp_ev~0 1)) (.cse39 (= ~a_t~0 1))) (or (and .cse0 .cse1 (and (<= ~c_req_d~0 50) .cse2 .cse3 .cse4 .cse5 .cse6 (and (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse7) .cse8) .cse9 .cse10 .cse11) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (and (and (and .cse12 .cse13) .cse14 .cse15) .cse8) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse16 .cse17 .cse18 .cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse23 .cse24) (and (and .cse2 .cse3 .cse4 .cse6 .cse9 (and (and (and (<= 1 ~c_req_type~0) (let ((.cse25 (and .cse26 .cse27 (not .cse28)))) (or (and (= ~s_run_pc~0 0) .cse25) (and .cse25 (<= 2 ~s_run_pc~0)))) .cse29 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse30 (<= ULTIMATE.start_s_run_~req_type~1 1)) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0) .cse5) .cse8) .cse10 .cse11) .cse21 .cse1 .cse24) (and .cse0 (= 52 ~c_req_d~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse22 (and .cse31 .cse5 (and (and .cse7 .cse32 .cse33) .cse8) .cse17 .cse18 .cse34) .cse35) (and (and .cse17 (and (and .cse14 .cse15 .cse12 .cse13) .cse8)) .cse36 .cse16 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse19 (= ~req_tt_a~0 1) .cse37 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse38 .cse22 (= 51 ~c_rsp_d~0) .cse23 .cse39) (and (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse36 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse22 (and (<= 2 ~c_req_a~0) .cse31 (and (and (and (and (and .cse32 .cse12 .cse33) .cse13) .cse14 .cse15) .cse8) .cse17) .cse18 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse34 (<= ~c_req_a~0 2)) .cse19) (and .cse0 .cse1 .cse38 (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse17 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse35 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_a~1 1) (and (and .cse7 .cse37) .cse8)) .cse39)))) [2019-01-12 15:35:05,611 INFO L448 ceAbstractionStarter]: For program point L974(lines 974 978) no Hoare annotation was computed. [2019-01-12 15:35:05,612 INFO L448 ceAbstractionStarter]: For program point L446(lines 134 480) no Hoare annotation was computed. [2019-01-12 15:35:05,612 INFO L444 ceAbstractionStarter]: At program point L579(lines 572 616) the Hoare annotation is: (let ((.cse15 (+ ~req_tt_a~0 52)) (.cse10 (<= 2 ~s_run_st~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse11 (= ~s_run_pc~0 2))) (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse6 (and .cse10 (and .cse12 .cse13) .cse14 .cse11)) (.cse7 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse8 (= ~s_memory2~0 52)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse15))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 50 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse3 .cse4 .cse5 (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse6) (<= 1 ULTIMATE.start_m_run_~a~0)) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse9 (= ~a_t~0 0)) (and .cse10 (<= 2 ~s_run_pc~0) (and (not .cse11) .cse12 .cse13)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse0 (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) (and .cse10 (and (= ~m_run_pc~0 3) .cse12 .cse13) .cse14 .cse11)) .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (= 0 ~c_req_a~0) .cse8 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0)) (and .cse0 .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (and .cse6 .cse7) .cse2 (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse15) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse8 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ~a_t~0 1) (<= ~c_req_a~0 2))))) [2019-01-12 15:35:05,613 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-01-12 15:35:05,613 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 125) no Hoare annotation was computed. [2019-01-12 15:35:05,613 INFO L448 ceAbstractionStarter]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2019-01-12 15:35:05,613 INFO L444 ceAbstractionStarter]: At program point L118(lines 101 843) 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:35:05,613 INFO L448 ceAbstractionStarter]: For program point L911(lines 911 964) no Hoare annotation was computed. [2019-01-12 15:35:05,613 INFO L444 ceAbstractionStarter]: At program point L779(lines 772 807) the Hoare annotation is: (let ((.cse4 (+ ~req_tt_a~0 52))) (let ((.cse3 (= 0 ~c_req_type~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (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))) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse4)) (.cse8 (= ~s_memory2~0 52)) (.cse10 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse4))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (and .cse0 .cse1) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 (= (+ ~s_memory2~0 ~c_req_a~0) .cse4) .cse5 .cse6 .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse10 (= ~a_t~0 0)) (and (= 52 ~c_rsp_d~0) .cse6 .cse7 (and .cse2 .cse3 .cse5 (and (and .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1)) .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse10 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse0) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse1) .cse2 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 .cse10 (= ~a_t~0 1))))) [2019-01-12 15:35:05,616 INFO L444 ceAbstractionStarter]: At program point L713(lines 706 723) the Hoare annotation is: (let ((.cse10 (+ ~req_tt_a~0 52))) (let ((.cse3 (= ~s_memory1~0 51)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse10)) (.cse4 (= ~s_memory2~0 52)) (.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (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)))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse10))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 .cse2 .cse3 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (and (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5 .cse6) (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse8 (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and (and (and .cse5 (<= ULTIMATE.start_m_run_~a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse6) .cse7 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse4 .cse8 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse3 .cse9 .cse4 (and .cse0 .cse1 .cse2 (and (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) .cse5 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse6)) (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse7 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse8 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2))))) [2019-01-12 15:35:05,619 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 585) no Hoare annotation was computed. [2019-01-12 15:35:05,619 INFO L451 ceAbstractionStarter]: At program point L1374(lines 1351 1376) the Hoare annotation is: true [2019-01-12 15:35:05,619 INFO L444 ceAbstractionStarter]: At program point L317(lines 287 318) the Hoare annotation is: (let ((.cse6 (+ ~c_req_a~0 50))) (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse6)) (.cse2 (= ~s_memory0~0 50)) (.cse4 (<= .cse6 ~c_req_d~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse3 (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 (= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (= ~s_memory1~0 51) (and .cse3 (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0)) .cse4 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse4 (<= 50 ~c_req_d~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse3) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (= ~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) .cse4 (<= ~c_req_d~0 51) .cse5 (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse3) (<= 1 ULTIMATE.start_m_run_~a~0)) (= ~a_t~0 1))))) [2019-01-12 15:35:05,619 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 916) no Hoare annotation was computed. [2019-01-12 15:35:05,622 INFO L448 ceAbstractionStarter]: For program point L714(lines 485 837) no Hoare annotation was computed. [2019-01-12 15:35:05,622 INFO L444 ceAbstractionStarter]: At program point L1243(lines 1236 1253) 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 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 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:35:05,622 INFO L448 ceAbstractionStarter]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2019-01-12 15:35:05,622 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 124) no Hoare annotation was computed. [2019-01-12 15:35:05,622 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2019-01-12 15:35:05,622 INFO L448 ceAbstractionStarter]: For program point L715(lines 715 719) no Hoare annotation was computed. [2019-01-12 15:35:05,622 INFO L444 ceAbstractionStarter]: At program point L385(lines 378 395) the Hoare annotation is: (let ((.cse6 (+ ~c_req_a~0 50))) (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse6)) (.cse4 (= ~s_memory0~0 50)) (.cse2 (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))) (.cse3 (<= .cse6 ~c_req_d~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse3 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse2 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse4 (= ~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) .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse4 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse2) .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5)))) [2019-01-12 15:35:05,623 INFO L444 ceAbstractionStarter]: At program point L253(lines 246 263) the Hoare annotation is: (let ((.cse22 (= ~s_run_pc~0 2)) (.cse24 (<= 1 ~c_req_type~0)) (.cse25 (<= ~m_run_pc~0 0)) (.cse26 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse27 (<= 1 ULTIMATE.start_m_run_~req_type~0))) (let ((.cse23 (+ ~c_req_a~0 50)) (.cse21 (and .cse24 (or (and .cse25 .cse2 .cse1) (and .cse26 .cse1 .cse2)) .cse27)) (.cse3 (<= 2 ~s_run_st~0)) (.cse11 (<= ~c_req_type~0 1)) (.cse14 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse0 (not .cse22)) (.cse19 (<= 0 ~c_req_a~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a~0 0))) (let ((.cse4 (= ~s_run_pc~0 0)) (.cse5 (and (and .cse24 (or (and .cse25 .cse2 .cse0 .cse1) (and .cse26 .cse0 .cse1 .cse2)) .cse27) (<= ~c_req_a~0 0) (<= ULTIMATE.start_m_run_~a~0 0) .cse19 .cse20 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ULTIMATE.start_m_run_~req_a~0))) (.cse12 (<= ~c_req_d~0 50)) (.cse13 (<= 50 ~c_req_d~0)) (.cse9 (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (and .cse21 .cse3 .cse11 .cse14 .cse15 .cse22)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 (+ ULTIMATE.start_m_run_~req_a~0 50))) (.cse7 (<= ~c_req_d~0 .cse23)) (.cse10 (<= .cse23 ~c_req_d~0)) (.cse16 (= ~a_t~0 0))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse3 .cse5) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse7 (= ~s_memory0~0 50) (= ULTIMATE.start_m_run_~req_d~0 52) (= ~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) (and (and (<= 2 ~c_req_a~0) (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse8 (<= ULTIMATE.start_m_run_~req_a~0 2)) .cse9) .cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_m_run_~a~0 2) (= ~a_t~0 1)) (and .cse4 .cse11 .cse12 .cse13 .cse5 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse12 .cse13 (and (and .cse3 .cse11 (and .cse19 .cse20 .cse21) .cse14 .cse15 .cse22) .cse9) .cse16 .cse17 .cse18 (= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse6 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse7 (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse10 (<= ~c_req_d~0 51) .cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)))))) [2019-01-12 15:35:05,625 INFO L444 ceAbstractionStarter]: At program point L121(lines 101 843) the Hoare annotation is: (let ((.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse31 (<= 3 ~m_run_pc~0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse30 (and .cse14 .cse31 .cse15)) (.cse13 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 2 ~s_run_st~0)) (.cse29 (<= 1 ~c_m_lock~0)) (.cse17 (= ~s_run_pc~0 2)) (.cse32 (+ ~req_tt_a~0 52))) (let ((.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse20 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse32)) (.cse7 (<= ~c_req_a~0 1)) (.cse8 (<= 1 ~c_req_a~0)) (.cse19 (and .cse13 .cse12 .cse16 .cse29 .cse17 .cse14)) (.cse22 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse32)) (.cse11 (= ~a_t~0 1)) (.cse24 (= 0 ~c_req_a~0)) (.cse25 (= ~req_tt_a~0 0)) (.cse26 (= ~a_t~0 0)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse4 (= 0 ~c_req_type~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse0 (and .cse12 .cse30 .cse29 .cse17)) (.cse18 (<= 2 ~a_t~0)) (.cse2 (= ~m_run_pc~0 6)) (.cse27 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse9 (= ~s_memory2~0 52)) (.cse21 (<= 2 ~c_req_a~0)) (.cse10 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse23 (<= ~c_req_a~0 2)) (.cse28 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 (= ~req_tt_a~0 1) .cse7 .cse8 .cse9 .cse10 .cse11) (and (and (and .cse12 (and .cse13 .cse14 .cse15) .cse16 .cse17) .cse18) .cse2) (and (= 52 ~c_rsp_d~0) (and .cse3 .cse4 .cse5 (and (and .cse19 .cse18) .cse2)) .cse6 .cse20 .cse9 .cse21 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse22 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse23) (and .cse19 .cse3 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse4 .cse5 .cse6 .cse1 .cse2 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse24 .cse9 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse25 .cse10 (= 50 ~c_rsp_d~0) .cse22 .cse26) (and .cse3 .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse20 .cse27 .cse7 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse8 .cse9 .cse10 (= 51 ~c_rsp_d~0) (and .cse19 .cse2) .cse22 .cse28 .cse11) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse4 .cse5 .cse6 .cse2 .cse24 .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse25 .cse10 (= ULTIMATE.start_s_run_~req_a~1 2) .cse26) (and (and (<= 0 ~a_t~0) (and .cse29 (and .cse12 .cse30 .cse16 .cse17))) .cse2) (and .cse16 (<= 2 ~s_run_pc~0) (and .cse14 (not .cse17) .cse31 .cse15)) (and .cse3 (= (+ ~s_memory2~0 ~c_req_a~0) .cse32) .cse4 .cse5 .cse6 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (and (and .cse0 .cse18) .cse2) .cse27 .cse9 .cse21 .cse10 .cse23 .cse28))))) [2019-01-12 15:35:05,626 INFO L448 ceAbstractionStarter]: For program point L386(lines 378 395) no Hoare annotation was computed. [2019-01-12 15:35:05,626 INFO L448 ceAbstractionStarter]: For program point L254(lines 134 480) no Hoare annotation was computed. [2019-01-12 15:35:05,626 INFO L448 ceAbstractionStarter]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2019-01-12 15:35:05,626 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-01-12 15:35:05,627 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 259) no Hoare annotation was computed. [2019-01-12 15:35:05,627 INFO L444 ceAbstractionStarter]: At program point L1048(lines 1041 1085) the Hoare annotation is: (let ((.cse27 (= ~m_run_pc~0 3)) (.cse40 (+ ~c_req_a~0 50)) (.cse29 (<= 2 ~c_write_req_ev~0)) (.cse26 (= ~c_empty_req~0 1)) (.cse30 (<= 1 ~c_m_lock~0)) (.cse28 (= ~s_run_pc~0 2)) (.cse42 (+ ~s_memory2~0 ~c_req_a~0)) (.cse41 (+ ~req_tt_a~0 52))) (let ((.cse2 (<= 50 ~c_req_d~0)) (.cse3 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse6 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse9 (= ~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)) (.cse21 (= ULTIMATE.start_m_run_~a~0 0)) (.cse24 (= ~a_t~0 0)) (.cse16 (= .cse42 .cse41)) (.cse20 (= ~s_memory2~0 52)) (.cse23 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse41)) (.cse36 (= .cse42 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse22 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse31 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse32 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse12 (and .cse29 .cse26 .cse30 .cse28)) (.cse33 (<= 2 ~a_t~0)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse15 (= 0 ~c_req_type~0)) (.cse18 (= ~s_memory1~0 51)) (.cse34 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse41)) (.cse0 (<= .cse40 ~c_req_d~0)) (.cse1 (<= ~c_req_d~0 .cse40)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse17 (= ~s_memory0~0 50)) (.cse35 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (and .cse29 .cse30 .cse28 (and .cse26 .cse27))) (.cse37 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse8 (= ~c_write_rsp_ev~0 1)) (.cse39 (= ~a_t~0 1))) (or (and .cse0 .cse1 (and (<= ~c_req_d~0 50) .cse2 .cse3 .cse4 .cse5 .cse6 (and (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse7) .cse8) .cse9 .cse10 .cse11) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (and (and (and .cse12 .cse13) .cse14 .cse15) .cse8) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse16 .cse17 .cse18 .cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse23 .cse24) (and (and .cse2 .cse3 .cse4 .cse6 .cse9 (and (and (and (<= 1 ~c_req_type~0) (let ((.cse25 (and .cse26 .cse27 (not .cse28)))) (or (and (= ~s_run_pc~0 0) .cse25) (and .cse25 (<= 2 ~s_run_pc~0)))) .cse29 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse30 (<= ULTIMATE.start_s_run_~req_type~1 1)) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0) .cse5) .cse8) .cse10 .cse11) .cse21 .cse1 .cse24) (and .cse0 (= 52 ~c_req_d~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse22 (and .cse31 .cse5 (and (and .cse7 .cse32 .cse33) .cse8) .cse17 .cse18 .cse34) .cse35) (and (and .cse17 (and (and .cse14 .cse15 .cse12 .cse13) .cse8)) .cse36 .cse16 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse19 (= ~req_tt_a~0 1) .cse37 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse38 .cse22 (= 51 ~c_rsp_d~0) .cse23 .cse39) (and (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse36 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse22 (and (<= 2 ~c_req_a~0) .cse31 (and (and (and (and (and .cse32 .cse12 .cse33) .cse13) .cse14 .cse15) .cse8) .cse17) .cse18 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse34 (<= ~c_req_a~0 2)) .cse19) (and .cse0 .cse1 .cse38 (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse17 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse35 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_a~1 1) (and (and .cse7 .cse37) .cse8)) .cse39)))) [2019-01-12 15:35:05,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:35:05,630 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 65) no Hoare annotation was computed. [2019-01-12 15:35:05,631 INFO L444 ceAbstractionStarter]: At program point L587(lines 580 615) the Hoare annotation is: (let ((.cse14 (+ ~req_tt_a~0 52)) (.cse10 (<= 2 ~s_run_st~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse11 (= ~s_run_pc~0 2))) (let ((.cse6 (and .cse10 (and .cse12 .cse13) .cse15 .cse11)) (.cse7 (= ~m_run_pc~0 6)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse14)) (.cse0 (= 0 ~c_req_type~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse1 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse8 (= ~s_memory2~0 52)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 50 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse3 .cse4 .cse5 (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse6) (<= 1 ULTIMATE.start_m_run_~a~0)) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse9 (= ~a_t~0 0)) (and .cse10 (<= 2 ~s_run_pc~0) (and (not .cse11) .cse12 .cse13)) (and .cse0 .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (and .cse6 .cse7) .cse2 (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse14) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse8 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ~a_t~0 1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse0 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (= 0 ~c_req_a~0) .cse8 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (and (and .cse10 .cse15 (or (and (<= ~m_run_pc~0 0) .cse13 .cse12) (and (= ~m_run_pc~0 3) .cse12 .cse13)) .cse11) (<= 0 ~a_t~0)) .cse2 (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0))))) [2019-01-12 15:35:05,631 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2019-01-12 15:35:05,631 INFO L444 ceAbstractionStarter]: At program point L918(lines 911 964) the Hoare annotation is: (let ((.cse27 (<= 1 ~c_req_type~0)) (.cse28 (= ~c_empty_req~0 1)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse29 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_rsp_ev~0)) (.cse32 (= ~c_empty_rsp~0 1))) (let ((.cse37 (and .cse27 .cse28 .cse22 .cse29 .cse30 .cse32)) (.cse23 (<= ~c_req_type~0 1)) (.cse34 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse38 (+ ~req_tt_a~0 52)) (.cse39 (+ ~s_memory2~0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse33 (<= 1 ~c_m_lock~0)) (.cse31 (= ~s_run_pc~0 2))) (let ((.cse5 (and (and .cse28 .cse30 .cse32) .cse21 .cse33 .cse31)) (.cse7 (= ~m_run_pc~0 6)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse13 (= .cse39 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse17 (= ULTIMATE.start_m_run_~a~0 1)) (.cse14 (= .cse39 .cse38)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse38)) (.cse18 (= ~a_t~0 1)) (.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse16 (and .cse21 .cse37 .cse23 .cse33 .cse31 .cse34)) (.cse12 (<= ~c_req_a~0 2)) (.cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 2 ~a_t~0)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse6 (<= ~a_t~0 0)) (.cse35 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse36 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) .cse2 (= ~req_tt_a~0 0) (and .cse3 (and (= 0 ~c_req_a~0) (and .cse4 (<= 0 ~a_t~0) .cse5 .cse6) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) .cse8) .cse9) (and (and .cse0 .cse1 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and (and (and .cse5 .cse10 .cse11) .cse7) .cse3 .cse8) .cse12 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse14 .cse2 .cse15) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (and (and (= 1 ULTIMATE.start_s_run_~req_a~1) .cse16) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) .cse17 (<= ~c_req_d~0 (+ ~c_req_a~0 50)) .cse18) (and (and .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (and .cse5 .cse7) .cse3 .cse8) (<= ~c_req_a~0 1)) .cse13 .cse17 .cse14 .cse2 .cse1 .cse15 (= ~req_tt_a~0 1) .cse18) (and (and .cse19 .cse20 (and .cse4 (and .cse21 .cse22 .cse23 (let ((.cse24 (and (<= ~c_req_a~0 0) .cse25 .cse26 (and .cse27 .cse28 .cse29 .cse30 (not .cse31) .cse32)))) (or (and (= ~s_run_pc~0 0) .cse24) (and (<= 2 ~s_run_pc~0) .cse24))) .cse33 .cse34)) .cse35 .cse36) (= ~a_t~0 0) .cse9) (and (= 52 ~c_req_d~0) (and (<= ULTIMATE.start_s_memory_write_~v 51) .cse0 .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (and (and (<= 2 ~c_req_a~0) .cse16 (= ULTIMATE.start_s_run_~req_a~1 2) .cse12) .cse10 .cse11)) (= 52 ULTIMATE.start_s_run_~req_d~1)) (and (and .cse19 .cse20 (and (<= ~c_req_a~0 ~a_t~0) (and (and .cse4 (and .cse21 .cse23 .cse33 .cse31 (and .cse25 .cse37 .cse26) .cse34)) .cse6)) .cse35 .cse36) .cse9))))) [2019-01-12 15:35:05,632 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 377) no Hoare annotation was computed. [2019-01-12 15:35:05,632 INFO L448 ceAbstractionStarter]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2019-01-12 15:35:05,632 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 65) no Hoare annotation was computed. [2019-01-12 15:35:05,632 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 999) no Hoare annotation was computed. [2019-01-12 15:35:05,633 INFO L444 ceAbstractionStarter]: At program point L787(lines 780 806) the Hoare annotation is: (let ((.cse4 (+ ~req_tt_a~0 52))) (let ((.cse3 (= 0 ~c_req_type~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (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))) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse4)) (.cse8 (= ~s_memory2~0 52)) (.cse10 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse4))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (and .cse0 .cse1) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 (= (+ ~s_memory2~0 ~c_req_a~0) .cse4) .cse5 .cse6 .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse10 (= ~a_t~0 0)) (and (= 52 ~c_rsp_d~0) .cse6 .cse7 (and .cse2 .cse3 .cse5 (and (and .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1)) .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse10 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse0) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse1) .cse2 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 .cse10 (= ~a_t~0 1))))) [2019-01-12 15:35:05,634 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2019-01-12 15:35:05,634 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-01-12 15:35:05,634 INFO L448 ceAbstractionStarter]: For program point L920(lines 920 924) no Hoare annotation was computed. [2019-01-12 15:35:05,634 INFO L444 ceAbstractionStarter]: At program point L524(lines 494 525) the Hoare annotation is: (let ((.cse19 (+ ~req_tt_a~0 52)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~s_run_pc~0 2))) (let ((.cse4 (<= 2 ~s_run_pc~0)) (.cse0 (not .cse13)) (.cse16 (and .cse11 .cse3 (and .cse12 .cse1 .cse2) .cse13)) (.cse17 (= ~m_run_pc~0 6)) (.cse15 (= 0 ~c_req_type~0)) (.cse8 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse10 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse9 (= ~s_memory2~0 52)) (.cse18 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse19))) (or (and (and .cse0 .cse1 .cse2 (<= 3 ~m_run_pc~0)) .cse3 .cse4) (let ((.cse5 (+ ~c_req_a~0 50))) (and (= 52 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (<= ~c_req_d~0 .cse5) .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (<= .cse5 ~c_req_d~0) .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse10 (and (and .cse11 .cse3 (and .cse12 (= ~m_run_pc~0 3) .cse1 .cse2) .cse13) (<= 2 ~a_t~0)) (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0))) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse14 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse15 .cse6 .cse7 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (and (= 0 ~c_req_a~0) (and (and .cse16 (<= ULTIMATE.start_m_run_~a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse17) .cse8 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse18 (= ~a_t~0 0)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse0 .cse1 .cse2 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (and .cse16 .cse17) .cse15 .cse8 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse10 (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) .cse14 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse19) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse18 (= ~a_t~0 1))))) [2019-01-12 15:35:05,636 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 65) no Hoare annotation was computed. [2019-01-12 15:35:05,637 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 793) no Hoare annotation was computed. [2019-01-12 15:35:05,637 INFO L448 ceAbstractionStarter]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2019-01-12 15:35:05,637 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2019-01-12 15:35:05,637 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 465) no Hoare annotation was computed. [2019-01-12 15:35:05,637 INFO L444 ceAbstractionStarter]: At program point L131(lines 101 843) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse11 (= ~s_run_pc~0 0)) (.cse4 (<= ~m_run_pc~0 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse6 (= 0 ~c_req_a~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~a_t~0 0)) (.cse10 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 (not (= ~s_run_pc~0 2)) .cse3) (and .cse4 .cse5 .cse1 .cse3 .cse6 .cse7 .cse8 .cse0 .cse9 .cse10 .cse2) (and .cse11 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse7 .cse4 .cse0 .cse10 .cse2 .cse3) (and .cse11 .cse4 .cse5 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2))) [2019-01-12 15:35:05,637 INFO L444 ceAbstractionStarter]: At program point L1056(lines 1049 1084) the Hoare annotation is: (let ((.cse14 (+ ~s_memory2~0 ~c_req_a~0)) (.cse13 (+ ~req_tt_a~0 52))) (let ((.cse5 (= .cse14 .cse13)) (.cse9 (= ~s_memory2~0 52)) (.cse11 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse13)) (.cse12 (= .cse14 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse10 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (and (<= 2 ~c_write_req_ev~0) (= ~c_empty_req~0 1) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= ~c_write_rsp_ev~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse13))) (or (and (and (and (and .cse0 .cse1) .cse2 .cse3) .cse4) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse11 (= ~a_t~0 0)) (and (and .cse6 (and (and .cse2 .cse3 .cse0 .cse1) .cse4)) .cse12 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (<= ULTIMATE.start_m_run_~a~0 1) .cse10 (= 51 ~c_rsp_d~0) .cse11 (= ~a_t~0 1)) (and (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (and (<= 2 ~c_req_a~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (and (and (and (and (and (<= 2 ULTIMATE.start_m_run_~a~0) .cse0 (<= 2 ~a_t~0)) .cse1) .cse2 .cse3) .cse4) .cse6) .cse7 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) .cse8)))) [2019-01-12 15:35:05,638 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 15:35:05,638 INFO L444 ceAbstractionStarter]: At program point L528-2(lines 528 556) the Hoare annotation is: (let ((.cse20 (+ ~req_tt_a~0 52)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse17 (= ~c_empty_req~0 1)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse19 (= ~s_run_pc~0 2))) (let ((.cse6 (= 0 ~c_req_type~0)) (.cse9 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse13 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (and .cse16 .cse0 (and .cse17 .cse3 .cse4) .cse18 .cse19)) (.cse12 (= ~m_run_pc~0 6)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse10 (= ~s_memory2~0 52)) (.cse14 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse20)) (.cse2 (not .cse19)) (.cse1 (<= 2 ~s_run_pc~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse9 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (= 0 ~c_req_a~0) (and (<= 1 ULTIMATE.start_m_run_~a~0) (and .cse11 (<= ULTIMATE.start_m_run_~a~0 1))) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse12) .cse13 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse14 (= ~a_t~0 0)) (let ((.cse15 (+ ~c_req_a~0 50))) (and (= 52 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (<= ~c_req_d~0 .cse15) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (<= .cse15 ~c_req_d~0) .cse10 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (and (<= ~c_req_a~0 ~a_t~0) (and .cse16 .cse0 (and .cse17 (= ~m_run_pc~0 3) .cse3 .cse4) .cse18 .cse19)) .cse13 (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0))) (and .cse6 .cse9 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (= 51 ~c_rsp_d~0) (and (and .cse11 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse12) .cse5 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse20) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_m_run_~a~0 2) .cse14 (= ~a_t~0 1)) (and .cse0 (and .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) .cse1)))) [2019-01-12 15:35:05,640 INFO L444 ceAbstractionStarter]: At program point L1189(lines 1182 1235) 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 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 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:35:05,640 INFO L448 ceAbstractionStarter]: For program point L991(lines 991 998) no Hoare annotation was computed. [2019-01-12 15:35:05,641 INFO L444 ceAbstractionStarter]: At program point L595(lines 588 614) the Hoare annotation is: (let ((.cse14 (+ ~req_tt_a~0 52)) (.cse10 (<= 2 ~s_run_st~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse11 (= ~s_run_pc~0 2))) (let ((.cse6 (and .cse10 (and .cse12 .cse13) .cse15 .cse11)) (.cse7 (= ~m_run_pc~0 6)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse14)) (.cse0 (= 0 ~c_req_type~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse1 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse8 (= ~s_memory2~0 52)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 50 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse3 .cse4 .cse5 (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse6) (<= 1 ULTIMATE.start_m_run_~a~0)) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse9 (= ~a_t~0 0)) (and .cse10 (<= 2 ~s_run_pc~0) (and (not .cse11) .cse12 .cse13)) (and .cse0 .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) (and .cse6 .cse7) .cse2 (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse14) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse8 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ~a_t~0 1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse0 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (= 0 ~c_req_a~0) .cse8 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (and (and .cse10 .cse15 (or (and (<= ~m_run_pc~0 0) .cse13 .cse12) (and (= ~m_run_pc~0 3) .cse12 .cse13)) .cse11) (<= 0 ~a_t~0)) .cse2 (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0))))) [2019-01-12 15:35:05,645 INFO L448 ceAbstractionStarter]: For program point L529(lines 528 556) no Hoare annotation was computed. [2019-01-12 15:35:05,645 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 403) no Hoare annotation was computed. [2019-01-12 15:35:05,645 INFO L444 ceAbstractionStarter]: At program point L397-1(lines 397 403) the Hoare annotation is: (let ((.cse10 (+ ~c_req_a~0 50)) (.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)) (.cse7 (and (and (= ~c_empty_req~0 1) (= ~m_run_pc~0 3) .cse0 .cse2) (<= 2 ~c_write_req_ev~0) .cse3 .cse1)) (.cse5 (<= ~c_req_d~0 .cse10)) (.cse6 (= ~s_memory0~0 50)) (.cse8 (<= .cse10 ~c_req_d~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (and .cse0 (not .cse1) .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse4 .cse5 .cse6 (= ~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) (and .cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) .cse8 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse9 (= ~a_t~0 1)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse4 .cse5 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse7 .cse8 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (= 52 ~c_req_d~0) .cse4 (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) .cse7 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse5 .cse6 (= ~s_memory1~0 51) .cse8 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse9)))) [2019-01-12 15:35:05,645 INFO L444 ceAbstractionStarter]: At program point L331(lines 324 377) the Hoare annotation is: (let ((.cse6 (+ ~c_req_a~0 50))) (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse6)) (.cse4 (= ~s_memory0~0 50)) (.cse2 (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))) (.cse3 (<= .cse6 ~c_req_d~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse3 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse2 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse4 (= ~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) .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse4 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse2) .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5)))) [2019-01-12 15:35:05,650 INFO L448 ceAbstractionStarter]: For program point L1256(line 1256) no Hoare annotation was computed. [2019-01-12 15:35:05,650 INFO L448 ceAbstractionStarter]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2019-01-12 15:35:05,650 INFO L448 ceAbstractionStarter]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2019-01-12 15:35:05,650 INFO L444 ceAbstractionStarter]: At program point L67(lines 54 68) the Hoare annotation is: (let ((.cse8 (+ ~req_tt_a~0 52)) (.cse7 (+ ~s_memory2~0 ~c_req_a~0))) (let ((.cse6 (= .cse7 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse1 (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))) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse4 (= 0 ~c_req_type~0)) (.cse2 (= ~m_run_pc~0 6)) (.cse0 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse11 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse8)) (.cse9 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse10 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse8))) (or (and (and (and .cse0 (and (and (and .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse2) .cse3 .cse4)) .cse5 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= .cse7 .cse8) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 .cse11) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and (= 0 ~c_req_a~0) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1) (= 0 ULTIMATE.start_s_memory_read_~i) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse2) .cse3 .cse4) (= ~req_tt_a~0 0) .cse9 .cse10 (= ~a_t~0 0) (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse6 (and (<= 1 ~c_req_a~0) (and .cse1 .cse3 .cse4 .cse2) .cse0 (<= ~c_req_a~0 1)) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (= ~s_memory2~0 52) (<= ULTIMATE.start_m_run_~a~0 1) .cse9 .cse10 (= ~a_t~0 1))))) [2019-01-12 15:35:05,650 INFO L448 ceAbstractionStarter]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2019-01-12 15:35:05,651 INFO L444 ceAbstractionStarter]: At program point L926(lines 919 963) the Hoare annotation is: (let ((.cse27 (<= 1 ~c_req_type~0)) (.cse28 (= ~c_empty_req~0 1)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse29 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_rsp_ev~0)) (.cse32 (= ~c_empty_rsp~0 1))) (let ((.cse37 (and .cse27 .cse28 .cse22 .cse29 .cse30 .cse32)) (.cse23 (<= ~c_req_type~0 1)) (.cse34 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse38 (+ ~req_tt_a~0 52)) (.cse39 (+ ~s_memory2~0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse33 (<= 1 ~c_m_lock~0)) (.cse31 (= ~s_run_pc~0 2))) (let ((.cse5 (and (and .cse28 .cse30 .cse32) .cse21 .cse33 .cse31)) (.cse7 (= ~m_run_pc~0 6)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse13 (= .cse39 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse17 (= ULTIMATE.start_m_run_~a~0 1)) (.cse14 (= .cse39 .cse38)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse38)) (.cse18 (= ~a_t~0 1)) (.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse16 (and .cse21 .cse37 .cse23 .cse33 .cse31 .cse34)) (.cse12 (<= ~c_req_a~0 2)) (.cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 2 ~a_t~0)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse6 (<= ~a_t~0 0)) (.cse35 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse36 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) .cse2 (= ~req_tt_a~0 0) (and .cse3 (and (= 0 ~c_req_a~0) (and .cse4 (<= 0 ~a_t~0) .cse5 .cse6) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) .cse8) .cse9) (and (and .cse0 .cse1 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and (and (and .cse5 .cse10 .cse11) .cse7) .cse3 .cse8) .cse12 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse14 .cse2 .cse15) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (and (and (= 1 ULTIMATE.start_s_run_~req_a~1) .cse16) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) .cse17 (<= ~c_req_d~0 (+ ~c_req_a~0 50)) .cse18) (and (and .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (and .cse5 .cse7) .cse3 .cse8) (<= ~c_req_a~0 1)) .cse13 .cse17 .cse14 .cse2 .cse1 .cse15 (= ~req_tt_a~0 1) .cse18) (and (and .cse19 .cse20 (and .cse4 (and .cse21 .cse22 .cse23 (let ((.cse24 (and (<= ~c_req_a~0 0) .cse25 .cse26 (and .cse27 .cse28 .cse29 .cse30 (not .cse31) .cse32)))) (or (and (= ~s_run_pc~0 0) .cse24) (and (<= 2 ~s_run_pc~0) .cse24))) .cse33 .cse34)) .cse35 .cse36) (= ~a_t~0 0) .cse9) (and (= 52 ~c_req_d~0) (and (<= ULTIMATE.start_s_memory_write_~v 51) .cse0 .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (and (and (<= 2 ~c_req_a~0) .cse16 (= ULTIMATE.start_s_run_~req_a~1 2) .cse12) .cse10 .cse11)) (= 52 ULTIMATE.start_s_run_~req_d~1)) (and (and .cse19 .cse20 (and (<= ~c_req_a~0 ~a_t~0) (and (and .cse4 (and .cse21 .cse23 .cse33 .cse31 (and .cse25 .cse37 .cse26) .cse34)) .cse6)) .cse35 .cse36) .cse9))))) [2019-01-12 15:35:05,651 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-01-12 15:35:05,652 INFO L448 ceAbstractionStarter]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2019-01-12 15:35:05,652 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse22 (+ ~c_req_a~0 50)) (.cse8 (= ~c_empty_req~0 1)) (.cse19 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 2 ~s_run_st~0)) (.cse16 (<= 2 ~s_run_pc~0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse12 (<= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1))) (let ((.cse3 (= ~s_memory0~0 50)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= ~s_run_pc~0 0)) (.cse9 (<= ~m_run_pc~0 0)) (.cse17 (= 0 ~c_req_type~0)) (.cse18 (= 0 ~c_req_a~0)) (.cse21 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (and .cse8 .cse19 .cse10 .cse16 (= ~m_run_pc~0 3) .cse11 .cse12 .cse13)) (.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse22)) (.cse4 (<= .cse22 ~c_req_d~0)) (.cse20 (= ~a_t~0 0)) (.cse7 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (not (= ~s_run_pc~0 2))) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 .cse3 (= ~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) .cse4 (<= ~c_req_d~0 51) .cse5 (= ULTIMATE.start_m_run_~a~0 2) (= ~a_t~0 1)) (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse3 (= ~s_memory1~0 51) (and .cse2 (<= 3 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse4 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5) (and .cse6 (<= ~c_req_a~0 0) .cse7 (<= 0 ~c_req_a~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse11 .cse12 .cse15 .cse13) .cse10 .cse16) (and .cse9 .cse17 .cse16 .cse13 .cse18 .cse8 .cse19 .cse10 .cse20 .cse11 .cse12 .cse21) (and .cse6 .cse9 .cse17 .cse13 .cse18 .cse8 .cse19 .cse20 .cse11 .cse12 .cse21) (and .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_m_run_~a~0 1) .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse4 (<= 50 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse7 .cse10 .cse16 .cse12 .cse15 .cse13 .cse14)))) [2019-01-12 15:35:05,656 INFO L448 ceAbstractionStarter]: For program point L861(lines 861 873) no Hoare annotation was computed. [2019-01-12 15:35:05,657 INFO L444 ceAbstractionStarter]: At program point L795(lines 788 805) the Hoare annotation is: (let ((.cse4 (+ ~req_tt_a~0 52))) (let ((.cse3 (= 0 ~c_req_type~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (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))) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse4)) (.cse8 (= ~s_memory2~0 52)) (.cse10 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse4))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (and .cse0 .cse1) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 (= (+ ~s_memory2~0 ~c_req_a~0) .cse4) .cse5 .cse6 .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse10 (= ~a_t~0 0)) (and (= 52 ~c_rsp_d~0) .cse6 .cse7 (and .cse2 .cse3 .cse5 (and (and .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1)) .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse10 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse0) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse1) .cse2 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 .cse10 (= ~a_t~0 1))))) [2019-01-12 15:35:05,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,658 INFO L448 ceAbstractionStarter]: For program point L729(lines 729 733) no Hoare annotation was computed. [2019-01-12 15:35:05,658 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 601) no Hoare annotation was computed. [2019-01-12 15:35:05,658 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 337) no Hoare annotation was computed. [2019-01-12 15:35:05,658 INFO L444 ceAbstractionStarter]: At program point L1324(lines 1317 1334) the Hoare annotation is: (let ((.cse37 (= ~s_run_pc~0 2)) (.cse46 (<= 1 ~c_req_type~0)) (.cse27 (= ~m_run_pc~0 3)) (.cse24 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~c_empty_rsp~0 1))) (let ((.cse45 (+ ~c_req_a~0 50)) (.cse35 (<= ~c_req_type~0 1)) (.cse38 (and .cse46 .cse27 .cse24 .cse25)) (.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse44 (not .cse37)) (.cse34 (<= 2 ~c_write_req_ev~0)) (.cse43 (and .cse24 .cse25)) (.cse36 (<= 1 ~c_m_lock~0)) (.cse47 (+ ~s_memory2~0 ~c_req_a~0))) (let ((.cse10 (<= ~c_req_a~0 2)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (= .cse47 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse12 (= .cse47 (+ ~req_tt_a~0 52))) (.cse13 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (= ~s_memory1~0 51)) (.cse6 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (and .cse34 .cse43 .cse36 .cse37)) (.cse32 (<= 50 ~c_req_d~0)) (.cse40 (and .cse18 .cse19 (and .cse46 .cse27 .cse24 .cse44 .cse25))) (.cse29 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse39 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 2 ~s_run_pc~0)) (.cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 2 ~a_t~0)) (.cse22 (<= 2 ~s_run_st~0)) (.cse3 (= ~m_run_pc~0 6)) (.cse17 (= ~s_run_pc~0 0)) (.cse21 (<= ~m_run_pc~0 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse41 (= 0 ~c_req_a~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse26 (= ~a_t~0 0)) (.cse23 (<= ~c_m_lock~0 0)) (.cse15 (and .cse34 .cse35 .cse36 .cse37 .cse38)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (<= ~c_req_d~0 .cse45)) (.cse31 (= ~a_t~0 1))) (or (and (and (<= 2 ~c_req_a~0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (and (and .cse15 .cse10) .cse1 .cse2) .cse6 (= ~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) .cse8 .cse9) (= 52 ~c_req_d~0) .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (and (and .cse0 .cse3) .cse5) .cse14 .cse12 .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ~req_tt_a~0 0) .cse13 (= ULTIMATE.start_s_run_~req_a~1 2) .cse26) (and (and .cse20 .cse27 .cse24 .cse25) .cse28) (and .cse11 .cse12 .cse13 .cse7 (and (<= 1 ~c_req_a~0) .cse6 (and .cse4 .cse5 (and (and .cse0 .cse29) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3)) (<= ~c_req_a~0 1)) (= ~req_tt_a~0 1) .cse30 .cse31) (and (and (<= ~c_req_d~0 50) .cse32 (and .cse33 (and .cse34 .cse35 .cse36 .cse37 (and .cse18 .cse19 .cse38)))) .cse26 .cse39) (and (and .cse32 (and .cse33 (and .cse17 .cse34 .cse35 .cse40 .cse36))) .cse16 .cse26 .cse39) (and .cse17 .cse22 .cse40) (and .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse22 .cse26 .cse37 .cse23 .cse24) (and (let ((.cse42 (and .cse36 (and .cse34 .cse22 .cse43 .cse37)))) (or (and (and .cse42 (<= ~a_t~0 1) .cse29 (<= 1 ~a_t~0)) .cse30) (and (and (<= 0 ~a_t~0) (<= ~a_t~0 0) (and .cse33 .cse42)) .cse39) (and .cse42 .cse1 .cse2))) .cse3) (and .cse34 .cse22 (and .cse27 .cse24 .cse25) .cse37) (and .cse22 .cse28 (and .cse24 .cse44 .cse25)) (and (and .cse1 .cse2 (and .cse34 (and .cse20 .cse22 .cse24 .cse25) .cse37)) .cse3) (and .cse17 .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse26 .cse23 .cse24) (and (and .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (<= .cse45 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) .cse16 (= ULTIMATE.start_s_run_~req_a~1 0) .cse31))))) [2019-01-12 15:35:05,661 INFO L448 ceAbstractionStarter]: For program point L135(lines 134 480) no Hoare annotation was computed. [2019-01-12 15:35:05,665 INFO L448 ceAbstractionStarter]: For program point L928(lines 928 932) no Hoare annotation was computed. [2019-01-12 15:35:05,666 INFO L448 ceAbstractionStarter]: For program point L796(lines 485 837) no Hoare annotation was computed. [2019-01-12 15:35:05,666 INFO L448 ceAbstractionStarter]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2019-01-12 15:35:05,666 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2019-01-12 15:35:05,666 INFO L448 ceAbstractionStarter]: For program point L797(lines 797 801) no Hoare annotation was computed. [2019-01-12 15:35:05,666 INFO L444 ceAbstractionStarter]: At program point L467(lines 460 477) the Hoare annotation is: (let ((.cse10 (<= 2 ~s_run_st~0)) (.cse8 (= ~s_run_pc~0 2)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse11 (+ ~c_req_a~0 50))) (let ((.cse2 (= ~s_memory0~0 50)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse11)) (.cse3 (and (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse10 .cse8 (= ~m_run_pc~0 3) .cse6 .cse7 .cse9)) (.cse4 (<= .cse11 ~c_req_d~0))) (or (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse3) .cse4 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5) (and (and .cse6 .cse7 (not .cse8) .cse9) .cse10 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (= ~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) .cse4 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse3 (<= ~c_req_d~0 50) .cse4 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-01-12 15:35:05,666 INFO L448 ceAbstractionStarter]: For program point L1326(lines 1326 1330) no Hoare annotation was computed. [2019-01-12 15:35:05,666 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-01-12 15:35:05,666 INFO L448 ceAbstractionStarter]: For program point L864(lines 864 872) no Hoare annotation was computed. [2019-01-12 15:35:05,666 INFO L448 ceAbstractionStarter]: For program point L468(lines 460 477) no Hoare annotation was computed. [2019-01-12 15:35:05,666 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 79) no Hoare annotation was computed. [2019-01-12 15:35:05,667 INFO L444 ceAbstractionStarter]: At program point L865(lines 860 1111) the Hoare annotation is: false [2019-01-12 15:35:05,667 INFO L444 ceAbstractionStarter]: At program point L667(lines 637 668) the Hoare annotation is: (let ((.cse10 (+ ~req_tt_a~0 52))) (let ((.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (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))) (.cse6 (= ~m_run_pc~0 6)) (.cse3 (= ~s_memory1~0 51)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse10)) (.cse4 (= ~s_memory2~0 52)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse10))) (or (and .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) .cse4 (and .cse5 (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6) (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse7 (= 50 ~c_rsp_d~0) .cse8 (= ~a_t~0 0)) (and .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and (<= ULTIMATE.start_m_run_~a~0 1) .cse5 (<= 1 ULTIMATE.start_m_run_~a~0)) .cse7 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) .cse6 (<= 1 ~c_req_a~0) .cse4 .cse8 (= ~a_t~0 1)) (and (and .cse0 .cse1 .cse2 (and (and .cse5 (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0)) .cse6)) (= 52 ~c_rsp_d~0) .cse3 .cse9 .cse4 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse8 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2))))) [2019-01-12 15:35:05,667 INFO L448 ceAbstractionStarter]: For program point L469(lines 469 473) no Hoare annotation was computed. [2019-01-12 15:35:05,668 INFO L444 ceAbstractionStarter]: At program point L1130(lines 1119 1160) the Hoare annotation is: (let ((.cse81 (<= 1 ~c_req_type~0)) (.cse35 (= ~m_run_pc~0 3)) (.cse36 (<= 2 ~c_write_rsp_ev~0)) (.cse37 (= ~c_empty_rsp~0 1)) (.cse59 (= ~s_run_pc~0 2))) (let ((.cse47 (<= ~c_req_a~0 0)) (.cse48 (<= 0 ~c_req_a~0)) (.cse78 (not .cse59)) (.cse77 (and .cse36 .cse37)) (.cse80 (+ ~s_memory2~0 ~c_req_a~0)) (.cse50 (<= 2 ~s_run_st~0)) (.cse34 (= ~c_empty_req~0 1)) (.cse52 (= ~m_run_st~0 0)) (.cse82 (+ ~c_req_a~0 50)) (.cse58 (<= 2 ~c_write_req_ev~0)) (.cse72 (<= ~c_req_type~0 1)) (.cse73 (<= 1 ~c_m_lock~0)) (.cse74 (and .cse81 .cse35 .cse36 .cse37)) (.cse79 (+ ~req_tt_a~0 52))) (let ((.cse11 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse13 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse32 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse79)) (.cse18 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse21 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse10 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse24 (= 52 ~c_req_d~0)) (.cse23 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse20 (and .cse58 .cse72 .cse73 .cse59 .cse74)) (.cse54 (<= ~c_req_d~0 51)) (.cse56 (<= 51 ~c_req_d~0)) (.cse57 (= ULTIMATE.start_m_run_~a~0 1)) (.cse49 (<= ~m_run_pc~0 0)) (.cse40 (= 0 ~c_req_a~0)) (.cse51 (<= ~c_m_lock~0 0)) (.cse53 (<= .cse82 ~c_req_d~0)) (.cse67 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse62 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse63 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse55 (and .cse58 .cse50 (and .cse34 .cse35 .cse52 .cse36) .cse73 .cse59)) (.cse64 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse65 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse66 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse39 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse27 (= ~s_memory2~0 52)) (.cse60 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1)) (.cse43 (= ~req_tt_a~0 0)) (.cse61 (= ULTIMATE.start_s_run_~req_a~1 2)) (.cse16 (= .cse80 .cse79)) (.cse31 (<= 1 ~c_req_a~0)) (.cse1 (and .cse58 .cse77 .cse73 .cse59)) (.cse42 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse30 (<= ~c_req_a~0 1)) (.cse33 (= ~a_t~0 1)) (.cse68 (<= ~c_req_d~0 50)) (.cse69 (<= 50 ~c_req_d~0)) (.cse25 (<= ~c_req_d~0 .cse82)) (.cse44 (= ~a_t~0 0)) (.cse46 (= ~s_run_pc~0 0)) (.cse75 (and .cse47 .cse48 (and .cse81 .cse35 .cse36 .cse78 .cse37))) (.cse28 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse26 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse70 (<= 0 ~a_t~0)) (.cse41 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse71 (<= ~a_t~0 0)) (.cse45 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse38 (<= 2 ~s_run_pc~0)) (.cse14 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse15 (= .cse80 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse17 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (<= 2 ~c_req_a~0)) (.cse8 (= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse29 (and .cse58 .cse50 .cse73 .cse59 (and .cse34 .cse52 .cse36))) (.cse2 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse3 (<= 2 ~a_t~0)) (.cse4 (= ~m_run_pc~0 6)) (.cse6 (= 0 ~c_req_type~0)) (.cse7 (= ~s_memory0~0 50)) (.cse12 (<= ~c_req_a~0 2))) (or (and (and .cse0 (and (and (and .cse1 .cse2 .cse3) .cse4) .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17) (and (and .cse18 .cse19 (and (and .cse20 .cse12) .cse2 .cse3) .cse7 .cse21 .cse22 .cse23 .cse9 .cse10) .cse24 .cse25) (and .cse15 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse26 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse27 .cse28 .cse17 (= 51 ~c_rsp_d~0) (and .cse5 .cse6 .cse7 .cse9 .cse10 .cse29 .cse11 .cse30 .cse4 .cse31 .cse13) .cse32 .cse33) (and (and .cse34 .cse35 .cse36 .cse37) .cse38) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse8 .cse39 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse27 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and .cse5 .cse6 (and .cse40 (and .cse41 .cse29) .cse42 .cse4)) .cse17 .cse43 (= 50 ~c_rsp_d~0) .cse32 .cse44 .cse45) (and .cse46 .cse47 .cse48 .cse34 .cse49 .cse50 .cse51 .cse52 .cse36 .cse37) (and .cse53 (and .cse18 .cse19 .cse7 .cse54 .cse21 .cse22 .cse9 .cse23 .cse55 .cse10 .cse56) .cse57 .cse25 .cse33) (and .cse58 .cse50 (and .cse35 .cse36 .cse37) .cse59) (and (and .cse2 .cse3 (and .cse34 .cse58 .cse50 .cse38 .cse36 .cse37)) .cse4) (and .cse53 .cse24 (and (and .cse55 .cse2 .cse3) .cse19 .cse7 .cse8) .cse60 .cse25 .cse17 .cse61 .cse23) (and .cse46 .cse49 .cse6 .cse37 .cse40 .cse34 .cse58 .cse44 .cse51 .cse36) (and (and .cse20 .cse62 .cse63 .cse19 .cse54 .cse64 .cse56 .cse65 .cse66) .cse53 .cse57 .cse25 .cse67 .cse33) (and .cse49 .cse6 .cse38 .cse37 .cse40 .cse34 .cse58 .cse50 .cse44 .cse51 .cse52 .cse36) (and .cse53 .cse25 .cse67 (and .cse68 .cse69 .cse62 .cse63 .cse19 (and .cse70 (and .cse41 .cse71 .cse55)) .cse64 .cse65 .cse66) .cse45) (and (and (and .cse1 .cse4) .cse6) .cse19 .cse16 .cse7 .cse8 .cse39 .cse27 (= ULTIMATE.start_m_run_~a~0 0) .cse60 .cse43 .cse17 .cse61 .cse44) (and .cse15 .cse16 .cse17 .cse8 (and .cse31 .cse7 (and .cse5 .cse6 (and (and .cse1 .cse28) .cse42 .cse4)) .cse30) (= ~req_tt_a~0 1) .cse26 .cse33) (and (and .cse68 .cse69 (and .cse41 (and .cse58 .cse72 .cse73 .cse59 (and .cse47 .cse48 .cse74)))) .cse44 .cse45) (and (and .cse69 (and .cse41 (and .cse46 .cse58 .cse72 .cse75 .cse73))) .cse25 .cse44 .cse45) (and .cse46 .cse50 .cse75) (and (let ((.cse76 (and (and .cse58 .cse50 .cse77 .cse59) .cse73))) (or (and (and (<= ~a_t~0 1) .cse28 .cse76) (<= 1 ~a_t~0) .cse26) (and .cse70 (and .cse41 .cse71 .cse76) .cse45) (and .cse2 .cse76 .cse3))) .cse4) (and .cse50 .cse38 (and .cse36 .cse78 .cse37)) (and .cse14 (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse15 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse17 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse79) (and .cse0 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse8 (and (and .cse5 (and (and .cse29 .cse2 .cse3) .cse4) .cse6) .cse7) (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse12)))))) [2019-01-12 15:35:05,673 INFO L444 ceAbstractionStarter]: At program point L1064(lines 1057 1083) the Hoare annotation is: (let ((.cse14 (+ ~s_memory2~0 ~c_req_a~0)) (.cse13 (+ ~req_tt_a~0 52))) (let ((.cse5 (= .cse14 .cse13)) (.cse9 (= ~s_memory2~0 52)) (.cse11 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse13)) (.cse12 (= .cse14 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse10 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (and (<= 2 ~c_write_req_ev~0) (= ~c_empty_req~0 1) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= ~c_write_rsp_ev~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse13))) (or (and (and (and (and .cse0 .cse1) .cse2 .cse3) .cse4) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse11 (= ~a_t~0 0)) (and (and .cse6 (and (and .cse2 .cse3 .cse0 .cse1) .cse4)) .cse12 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (<= ULTIMATE.start_m_run_~a~0 1) .cse10 (= 51 ~c_rsp_d~0) .cse11 (= ~a_t~0 1)) (and (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (and (<= 2 ~c_req_a~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (and (and (and (and (and (<= 2 ULTIMATE.start_m_run_~a~0) .cse0 (<= 2 ~a_t~0)) .cse1) .cse2 .cse3) .cse4) .cse6) .cse7 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) .cse8)))) [2019-01-12 15:35:05,676 INFO L448 ceAbstractionStarter]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2019-01-12 15:35:05,676 INFO L444 ceAbstractionStarter]: At program point L1197(lines 1190 1234) 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 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 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:35:05,676 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-01-12 15:35:05,676 INFO L448 ceAbstractionStarter]: For program point L867(lines 867 871) no Hoare annotation was computed. [2019-01-12 15:35:05,677 INFO L444 ceAbstractionStarter]: At program point L735(lines 728 745) the Hoare annotation is: (let ((.cse10 (+ ~req_tt_a~0 52))) (let ((.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) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)))) (.cse2 (= ~m_run_pc~0 6)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse10)) (.cse8 (= ~s_memory2~0 52)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse10))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (and (and (and .cse1 (<= ULTIMATE.start_m_run_~a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse2) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 .cse9 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse6 .cse7 .cse8 (and .cse4 .cse0 .cse5 (and (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) .cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse2)) (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse3 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse9 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (and .cse1 .cse2) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse4 .cse0 (= (+ ~s_memory2~0 ~c_req_a~0) .cse10) .cse5 .cse6 .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse9 (= ~a_t~0 0))))) [2019-01-12 15:35:05,681 INFO L444 ceAbstractionStarter]: At program point L603(lines 596 613) the Hoare annotation is: (let ((.cse8 (+ ~req_tt_a~0 52)) (.cse11 (<= 2 ~s_run_st~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse12 (= ~s_run_pc~0 2))) (let ((.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (and .cse11 (and .cse13 .cse14) .cse15 .cse12)) (.cse7 (= ~m_run_pc~0 6)) (.cse10 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse8)) (.cse0 (= 0 ~c_req_type~0)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= ~s_memory1~0 51)) (.cse1 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse9 (= ~s_memory2~0 52)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52))) (or (and .cse0 .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) .cse2 (= 51 ~c_rsp_d~0) .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (and (and .cse6 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse7) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse8) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_m_run_~a~0 2) .cse10 (= ~a_t~0 1) (<= ~c_req_a~0 2)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 50 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse3 .cse4 .cse5 (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse9 (and (= 0 ULTIMATE.start_s_run_~req_a~1) (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse6) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse7) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse10 (= ~a_t~0 0)) (and .cse11 (<= 2 ~s_run_pc~0) (and (not .cse12) .cse13 .cse14)) (and (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) .cse0 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (= 0 ~c_req_a~0) .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (and (and .cse11 .cse15 (or (and (<= ~m_run_pc~0 0) .cse14 .cse13) (and (= ~m_run_pc~0 3) .cse13 .cse14)) .cse12) (<= 0 ~a_t~0)) .cse2 (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0))))) [2019-01-12 15:35:05,683 INFO L444 ceAbstractionStarter]: At program point L339(lines 332 376) the Hoare annotation is: (let ((.cse6 (+ ~c_req_a~0 50))) (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse6)) (.cse4 (= ~s_memory0~0 50)) (.cse2 (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))) (.cse3 (<= .cse6 ~c_req_d~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse3 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse2 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse4 (= ~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) .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse4 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse2) .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5)))) [2019-01-12 15:35:05,684 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2019-01-12 15:35:05,684 INFO L444 ceAbstractionStarter]: At program point L207(lines 177 208) the Hoare annotation is: (let ((.cse18 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse21 (= ~s_run_pc~0 2)) (.cse4 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse22 (+ ~c_req_a~0 50))) (let ((.cse7 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse0 (= ~s_run_pc~0 0)) (.cse10 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0)) (.cse14 (= 0 ~c_req_type~0)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse1 (<= ~m_run_pc~0 0)) (.cse17 (= 0 ~c_req_a~0)) (.cse13 (= ~a_t~0 0)) (.cse19 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse20 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse9 (<= ~c_req_d~0 .cse22)) (.cse12 (<= .cse22 ~c_req_d~0)) (.cse11 (and .cse18 .cse3 .cse15 .cse16 .cse21 (and .cse4 (= ~m_run_pc~0 3) .cse6 .cse5)))) (or (and .cse0 (<= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 ULTIMATE.start_m_run_~a~0) .cse7) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse8 .cse9 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (and .cse10 (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse11)) (<= ~c_req_d~0 50) .cse12 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse13 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 .cse14 .cse6 .cse15 .cse16 .cse4 .cse7 (<= ULTIMATE.start_m_run_~req_d~0 50) .cse0 .cse10 .cse17 .cse18 .cse13 .cse19 .cse5 .cse20) (and .cse14 (and .cse18 .cse2 .cse1 .cse3 .cse15 .cse16 .cse21 .cse4 .cse5 .cse6) .cse17 .cse13 (<= ULTIMATE.start_m_run_~req_d~0 (+ ULTIMATE.start_m_run_~req_a~0 50)) .cse19 .cse20) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 (= ~s_memory0~0 50) (= ULTIMATE.start_m_run_~req_d~0 52) (= ~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) .cse12 (and (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse11 (<= ULTIMATE.start_m_run_~req_a~0 2)) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_m_run_~a~0 2) (= ~a_t~0 1)) (and (and (not .cse21) .cse6 .cse5) .cse3 (<= 2 ~s_run_pc~0))))) [2019-01-12 15:35:05,689 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2019-01-12 15:35:05,690 INFO L444 ceAbstractionStarter]: At program point L934(lines 927 962) the Hoare annotation is: (let ((.cse27 (<= 1 ~c_req_type~0)) (.cse28 (= ~c_empty_req~0 1)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse29 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_rsp_ev~0)) (.cse32 (= ~c_empty_rsp~0 1))) (let ((.cse37 (and .cse27 .cse28 .cse22 .cse29 .cse30 .cse32)) (.cse23 (<= ~c_req_type~0 1)) (.cse34 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse38 (+ ~req_tt_a~0 52)) (.cse39 (+ ~s_memory2~0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse33 (<= 1 ~c_m_lock~0)) (.cse31 (= ~s_run_pc~0 2))) (let ((.cse5 (and (and .cse28 .cse30 .cse32) .cse21 .cse33 .cse31)) (.cse7 (= ~m_run_pc~0 6)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse13 (= .cse39 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse17 (= ULTIMATE.start_m_run_~a~0 1)) (.cse14 (= .cse39 .cse38)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse38)) (.cse18 (= ~a_t~0 1)) (.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse16 (and .cse21 .cse37 .cse23 .cse33 .cse31 .cse34)) (.cse12 (<= ~c_req_a~0 2)) (.cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 2 ~a_t~0)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse6 (<= ~a_t~0 0)) (.cse35 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse36 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) .cse2 (= ~req_tt_a~0 0) (and .cse3 (and (= 0 ~c_req_a~0) (and .cse4 (<= 0 ~a_t~0) .cse5 .cse6) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) .cse8) .cse9) (and (and .cse0 .cse1 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and (and (and .cse5 .cse10 .cse11) .cse7) .cse3 .cse8) .cse12 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse14 .cse2 .cse15) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (and (and (= 1 ULTIMATE.start_s_run_~req_a~1) .cse16) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) .cse17 (<= ~c_req_d~0 (+ ~c_req_a~0 50)) .cse18) (and (and .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (and .cse5 .cse7) .cse3 .cse8) (<= ~c_req_a~0 1)) .cse13 .cse17 .cse14 .cse2 .cse1 .cse15 (= ~req_tt_a~0 1) .cse18) (and (and .cse19 .cse20 (and .cse4 (and .cse21 .cse22 .cse23 (let ((.cse24 (and (<= ~c_req_a~0 0) .cse25 .cse26 (and .cse27 .cse28 .cse29 .cse30 (not .cse31) .cse32)))) (or (and (= ~s_run_pc~0 0) .cse24) (and (<= 2 ~s_run_pc~0) .cse24))) .cse33 .cse34)) .cse35 .cse36) (= ~a_t~0 0) .cse9) (and (= 52 ~c_req_d~0) (and (<= ULTIMATE.start_s_memory_write_~v 51) .cse0 .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (and (and (<= 2 ~c_req_a~0) .cse16 (= ULTIMATE.start_s_run_~req_a~1 2) .cse12) .cse10 .cse11)) (= 52 ULTIMATE.start_s_run_~req_d~1)) (and (and .cse19 .cse20 (and (<= ~c_req_a~0 ~a_t~0) (and (and .cse4 (and .cse21 .cse23 .cse33 .cse31 (and .cse25 .cse37 .cse26) .cse34)) .cse6)) .cse35 .cse36) .cse9))))) [2019-01-12 15:35:05,691 INFO L444 ceAbstractionStarter]: At program point L868(lines 860 1111) the Hoare annotation is: (let ((.cse15 (= ~m_run_pc~0 3)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (= ~c_empty_rsp~0 1))) (let ((.cse29 (+ ~s_memory2~0 ~c_req_a~0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= ~c_req_type~0 1)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse0 (and (<= 1 ~c_req_type~0) .cse15 .cse16 .cse17))) (let ((.cse11 (and .cse1 .cse2 .cse3 .cse4 .cse0)) (.cse23 (<= ~c_req_a~0 1)) (.cse6 (<= ~c_req_d~0 (+ ~c_req_a~0 50))) (.cse25 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse19 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse27 (= ~a_t~0 1)) (.cse24 (= ~s_memory2~0 52)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (= ~a_t~0 0)) (.cse18 (= .cse29 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse28 (= .cse29 (+ ~req_tt_a~0 52))) (.cse26 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse10 (<= 2 ~c_req_a~0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse20 (= 0 ~c_req_type~0)) (.cse21 (and .cse1 (and .cse16 .cse17) .cse3 .cse4)) (.cse13 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= 2 ~a_t~0)) (.cse22 (= ~m_run_pc~0 6)) (.cse12 (<= ~c_req_a~0 2))) (or (and (and (<= 50 ~c_req_d~0) (and (and (<= ~c_req_a~0 0) .cse0) .cse1 .cse2 .cse3 .cse4)) .cse5 .cse6 .cse7) (and (= 52 ~c_req_d~0) (and (<= ULTIMATE.start_s_memory_write_~v 51) .cse8 .cse9 (<= 51 ULTIMATE.start_s_memory_write_~v) (and (and .cse10 .cse11 .cse12) .cse13 .cse14))) (and (<= 2 ~s_run_pc~0) (and (= ~c_empty_req~0 1) .cse15 .cse16 .cse17)) (and .cse18 .cse9 (= ~req_tt_a~0 1) .cse19 (and (<= 1 ~c_req_a~0) .cse8 (and .cse20 (and .cse21 .cse22)) .cse23) .cse24 .cse25 .cse26 .cse27) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse8 (and .cse11 .cse23) (<= 51 ~c_req_d~0)) .cse6 .cse25 .cse19 .cse27) (and (and .cse21 .cse20 .cse22) .cse28 .cse8 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse24 .cse5 (= ~req_tt_a~0 0) .cse26 .cse7) (and (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse18 .cse28 .cse26 (and .cse10 .cse8 .cse9 (and .cse20 (and (and .cse21 .cse13 .cse14) .cse22)) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse12 (<= ULTIMATE.start_s_memory_read_~i 1))))))) [2019-01-12 15:35:05,693 INFO L448 ceAbstractionStarter]: For program point L736(lines 728 745) no Hoare annotation was computed. [2019-01-12 15:35:05,693 INFO L448 ceAbstractionStarter]: For program point L604(lines 485 837) no Hoare annotation was computed. [2019-01-12 15:35:05,693 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 459) no Hoare annotation was computed. [2019-01-12 15:35:05,693 INFO L448 ceAbstractionStarter]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 79) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L1001-1(lines 876 1106) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L737(lines 737 741) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 609) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-01-12 15:35:05,694 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-01-12 15:35:05,697 INFO L444 ceAbstractionStarter]: At program point L275(lines 268 285) the Hoare annotation is: (let ((.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse4 (= ~c_empty_rsp~0 1))) (let ((.cse3 (and .cse5 (not .cse6) .cse4))) (let ((.cse0 (= ~s_run_pc~0 0)) (.cse1 (and (<= ~c_req_a~0 0) (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 0) (and (<= 1 ~c_req_type~0) (<= 1 ULTIMATE.start_m_run_~req_type~0) .cse3) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ULTIMATE.start_m_run_~req_a~0))) (.cse2 (<= 2 ~s_run_st~0))) (or (and .cse0 .cse1 (<= ~c_req_type~0 1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~req_type~0 1) (<= 1 ~c_m_lock~0) (= ~a_t~0 0) (<= ULTIMATE.start_m_run_~req_d~0 (+ ULTIMATE.start_m_run_~req_a~0 50)) (<= 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:35:05,698 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2019-01-12 15:35:05,698 INFO L448 ceAbstractionStarter]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2019-01-12 15:35:05,698 INFO L448 ceAbstractionStarter]: For program point L936(lines 936 940) no Hoare annotation was computed. [2019-01-12 15:35:05,698 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 1 1376) the Hoare annotation is: (let ((.cse11 (+ ~s_memory2~0 ~c_req_a~0)) (.cse12 (+ ~req_tt_a~0 52))) (let ((.cse6 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse12)) (.cse10 (= .cse11 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse1 (= ~s_memory1~0 51)) (.cse7 (= ~s_memory2~0 52)) (.cse8 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse3 (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))) (.cse4 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse0 (= ~s_memory0~0 50)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse12))) (or (and .cse0 .cse1 (and .cse2 (and (= 0 ~c_req_a~0) .cse3 .cse4) .cse5) .cse6 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= ~req_tt_a~0 0) .cse9 (= ~a_t~0 0)) (and (and (and .cse0 (and (and (and .cse3 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse4) .cse2 .cse5)) .cse1 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= .cse11 .cse12) .cse8 .cse9 .cse6) (and .cse10 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 .cse7 (<= ULTIMATE.start_m_run_~a~0 1) .cse8 (and (<= 1 ~c_req_a~0) (and (and (and .cse3 (<= 1 ULTIMATE.start_m_run_~a~0)) .cse4) .cse2 .cse5) .cse0 (<= 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)) .cse9 (= ~a_t~0 1))))) [2019-01-12 15:35:05,698 INFO L444 ceAbstractionStarter]: At program point L11-4(lines 70 82) the Hoare annotation is: (let ((.cse8 (= ~c_empty_req~0 1)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse12 (= ~s_run_pc~0 2)) (.cse16 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse24 (+ ~c_req_a~0 50))) (let ((.cse21 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse20 (= ~s_memory0~0 50)) (.cse23 (<= .cse24 ~c_req_d~0)) (.cse5 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse0 (<= ~c_req_d~0 .cse24)) (.cse1 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse6 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse22 (and (and .cse8 .cse10 .cse11 .cse13) .cse14 .cse9 .cse15 .cse12 .cse16)) (.cse2 (<= 50 ~c_req_d~0)) (.cse3 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (and .cse6 (<= 0 ~a_t~0) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0) (<= ~a_t~0 0) (and (let ((.cse7 (and .cse8 .cse9 .cse10 .cse11 (not .cse12) .cse13))) (or (and (<= 2 ~s_run_pc~0) .cse7) (and (= ~s_run_pc~0 0) .cse7))) (<= 1 ~c_req_type~0) .cse14 (<= ~c_req_type~0 1) .cse15 .cse16)) .cse17 .cse18 .cse19)) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse20 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse21 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_a~1 1) (and (<= ULTIMATE.start_m_run_~a~0 1) .cse22 (<= 1 ULTIMATE.start_m_run_~a~0))) .cse23 .cse5 .cse0 (= ~a_t~0 1)) (and .cse23 (= 52 ~c_req_d~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ULTIMATE.start_s_memory_write_~v 52) .cse21 (and (<= ULTIMATE.start_s_run_~req_a~1 2) .cse5 .cse20 (= ~s_memory1~0 51) (and .cse22 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) (<= 2 ULTIMATE.start_s_run_~req_a~1))) (and .cse23 .cse5 .cse0 .cse1 (= ~a_t~0 0) (and (<= ~c_req_d~0 50) (and .cse6 .cse22) .cse2 .cse3 .cse4 .cse17 .cse18 .cse19) (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-01-12 15:35:05,702 INFO L448 ceAbstractionStarter]: For program point L276(lines 268 285) no Hoare annotation was computed. [2019-01-12 15:35:05,702 INFO L448 ceAbstractionStarter]: For program point L1003(lines 1003 1007) no Hoare annotation was computed. [2019-01-12 15:35:05,702 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 281) no Hoare annotation was computed. [2019-01-12 15:35:05,703 INFO L444 ceAbstractionStarter]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse14 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse22 (= ~s_run_pc~0 2)) (.cse3 (= ~c_empty_req~0 1)) (.cse5 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (+ ~c_req_a~0 50))) (let ((.cse0 (= ~s_run_pc~0 0)) (.cse1 (<= ~m_run_pc~0 0)) (.cse9 (= 0 ~c_req_type~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse11 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse12 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse15 (= ~a_t~0 0)) (.cse16 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse17 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse18 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse19 (<= ~c_req_d~0 .cse23)) (.cse21 (<= .cse23 ~c_req_d~0)) (.cse20 (and .cse14 .cse4 .cse10 .cse22 (and .cse3 .cse5 (= ~m_run_pc~0 3) .cse6 .cse2 .cse7)))) (or (and .cse0 (<= ULTIMATE.start_m_run_~a~0 0) .cse1 (<= ULTIMATE.start_m_run_~req_a~0 0) .cse2 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ULTIMATE.start_m_run_~a~0) .cse8) (and .cse1 .cse9 .cse2 .cse3 .cse10 .cse5 .cse6 .cse8 .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse18 .cse19 (and (<= ULTIMATE.start_m_run_~req_a~0 1) .cse20) (= ~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) .cse21 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse15 (<= ULTIMATE.start_m_run_~req_d~0 (+ ULTIMATE.start_m_run_~req_a~0 50)) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 .cse9 .cse2 .cse3 .cse4 .cse10 .cse22 .cse5 .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse18 .cse19 (= ~s_memory0~0 50) (= ULTIMATE.start_m_run_~req_d~0 52) (= ~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) .cse21 (and (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse20 (<= ULTIMATE.start_m_run_~req_a~0 2)) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_m_run_~a~0 2) (= ~a_t~0 1)) (and .cse4 (<= 2 ~s_run_pc~0) .cse7 (not .cse22) .cse2)))) [2019-01-12 15:35:05,705 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 727) no Hoare annotation was computed. [2019-01-12 15:35:05,705 INFO L448 ceAbstractionStarter]: For program point L146(lines 145 173) no Hoare annotation was computed. [2019-01-12 15:35:05,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,706 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 679) no Hoare annotation was computed. [2019-01-12 15:35:05,706 INFO L444 ceAbstractionStarter]: At program point L1270(lines 1263 1316) the Hoare annotation is: (let ((.cse37 (= ~s_run_pc~0 2)) (.cse46 (<= 1 ~c_req_type~0)) (.cse27 (= ~m_run_pc~0 3)) (.cse24 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~c_empty_rsp~0 1))) (let ((.cse45 (+ ~c_req_a~0 50)) (.cse35 (<= ~c_req_type~0 1)) (.cse38 (and .cse46 .cse27 .cse24 .cse25)) (.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse44 (not .cse37)) (.cse34 (<= 2 ~c_write_req_ev~0)) (.cse43 (and .cse24 .cse25)) (.cse36 (<= 1 ~c_m_lock~0)) (.cse47 (+ ~s_memory2~0 ~c_req_a~0))) (let ((.cse10 (<= ~c_req_a~0 2)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (= .cse47 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse12 (= .cse47 (+ ~req_tt_a~0 52))) (.cse13 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (= ~s_memory1~0 51)) (.cse6 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (and .cse34 .cse43 .cse36 .cse37)) (.cse32 (<= 50 ~c_req_d~0)) (.cse40 (and .cse18 .cse19 (and .cse46 .cse27 .cse24 .cse44 .cse25))) (.cse29 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse39 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 2 ~a_t~0)) (.cse3 (= ~m_run_pc~0 6)) (.cse22 (<= 2 ~s_run_st~0)) (.cse28 (<= 2 ~s_run_pc~0)) (.cse17 (= ~s_run_pc~0 0)) (.cse21 (<= ~m_run_pc~0 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse41 (= 0 ~c_req_a~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse26 (= ~a_t~0 0)) (.cse23 (<= ~c_m_lock~0 0)) (.cse15 (and .cse34 .cse35 .cse36 .cse37 .cse38)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (<= ~c_req_d~0 .cse45)) (.cse31 (= ~a_t~0 1))) (or (and (and (<= 2 ~c_req_a~0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (and (and .cse15 .cse10) .cse1 .cse2) .cse6 (= ~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) .cse8 .cse9) (= 52 ~c_req_d~0) .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (and (and .cse0 .cse3) .cse5) .cse14 .cse12 .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ~req_tt_a~0 0) .cse13 (= ULTIMATE.start_s_run_~req_a~1 2) .cse26) (and (and .cse20 .cse27 .cse24 .cse25) .cse28) (and .cse11 .cse12 .cse13 .cse7 (and (<= 1 ~c_req_a~0) .cse6 (and .cse4 .cse5 (and (and .cse0 .cse29) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3)) (<= ~c_req_a~0 1)) (= ~req_tt_a~0 1) .cse30 .cse31) (and (and (<= ~c_req_d~0 50) .cse32 (and .cse33 (and .cse34 .cse35 .cse36 .cse37 (and .cse18 .cse19 .cse38)))) .cse26 .cse39) (and (and .cse32 (and .cse33 (and .cse17 .cse34 .cse35 .cse40 .cse36))) .cse16 .cse26 .cse39) (and .cse17 .cse22 .cse40) (and .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse22 .cse26 .cse37 .cse23 .cse24) (and (let ((.cse42 (and (and .cse34 .cse22 .cse43 .cse37) .cse36))) (or (and (and (<= ~a_t~0 1) .cse29 .cse42) (<= 1 ~a_t~0) .cse30) (and (<= 0 ~a_t~0) (and .cse33 (<= ~a_t~0 0) .cse42) .cse39) (and .cse1 .cse42 .cse2))) .cse3) (and .cse34 .cse22 (and .cse27 .cse24 .cse25) .cse37) (and (and .cse1 .cse2 (and .cse20 .cse34 .cse22 .cse28 .cse24 .cse25)) .cse3) (and .cse22 .cse28 (and .cse24 .cse44 .cse25)) (and .cse17 .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse26 .cse23 .cse24) (and (and .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (<= .cse45 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) .cse16 (= ULTIMATE.start_s_run_~req_a~1 0) .cse31))))) [2019-01-12 15:35:05,708 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 151) no Hoare annotation was computed. [2019-01-12 15:35:05,712 INFO L444 ceAbstractionStarter]: At program point L1072(lines 1065 1082) the Hoare annotation is: (let ((.cse14 (+ ~s_memory2~0 ~c_req_a~0)) (.cse13 (+ ~req_tt_a~0 52))) (let ((.cse5 (= .cse14 .cse13)) (.cse9 (= ~s_memory2~0 52)) (.cse11 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse13)) (.cse12 (= .cse14 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse10 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (and (<= 2 ~c_write_req_ev~0) (= ~c_empty_req~0 1) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2))) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= 0 ~c_req_type~0)) (.cse4 (= ~c_write_rsp_ev~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse13))) (or (and (and (and (and .cse0 .cse1) .cse2 .cse3) .cse4) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse11 (= ~a_t~0 0)) (and (and .cse6 (and (and .cse2 .cse3 .cse0 .cse1) .cse4)) .cse12 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (<= ULTIMATE.start_m_run_~a~0 1) .cse10 (= 51 ~c_rsp_d~0) .cse11 (= ~a_t~0 1)) (and (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse10 (and (<= 2 ~c_req_a~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (and (and (and (and (and (<= 2 ULTIMATE.start_m_run_~a~0) .cse0 (<= 2 ~a_t~0)) .cse1) .cse2 .cse3) .cse4) .cse6) .cse7 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) .cse8)))) [2019-01-12 15:35:05,712 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 267) no Hoare annotation was computed. [2019-01-12 15:35:05,712 INFO L444 ceAbstractionStarter]: At program point L1205(lines 1198 1233) 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 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 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:35:05,712 INFO L448 ceAbstractionStarter]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2019-01-12 15:35:05,712 INFO L444 ceAbstractionStarter]: At program point L413(lines 406 459) the Hoare annotation is: (let ((.cse10 (<= 2 ~s_run_st~0)) (.cse8 (= ~s_run_pc~0 2)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse11 (+ ~c_req_a~0 50))) (let ((.cse2 (= ~s_memory0~0 50)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse11)) (.cse3 (and (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse10 .cse8 (= ~m_run_pc~0 3) .cse6 .cse7 .cse9)) (.cse4 (<= .cse11 ~c_req_d~0))) (or (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse3) .cse4 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5) (and (and .cse6 .cse7 (not .cse8) .cse9) .cse10 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (= ~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) .cse4 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse3 (<= ~c_req_d~0 50) .cse4 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-01-12 15:35:05,713 INFO L444 ceAbstractionStarter]: At program point L347(lines 340 375) the Hoare annotation is: (let ((.cse6 (+ ~c_req_a~0 50))) (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse6)) (.cse4 (= ~s_memory0~0 50)) (.cse2 (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))) (.cse3 (<= .cse6 ~c_req_d~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse3 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse2 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse4 (= ~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) .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse4 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse2) .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5)))) [2019-01-12 15:35:05,713 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2019-01-12 15:35:05,713 INFO L448 ceAbstractionStarter]: For program point L1338-1(lines 1170 1349) no Hoare annotation was computed. [2019-01-12 15:35:05,713 INFO L448 ceAbstractionStarter]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2019-01-12 15:35:05,713 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 219) no Hoare annotation was computed. [2019-01-12 15:35:05,714 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1078) no Hoare annotation was computed. [2019-01-12 15:35:05,714 INFO L444 ceAbstractionStarter]: At program point L942(lines 935 961) the Hoare annotation is: (let ((.cse27 (<= 1 ~c_req_type~0)) (.cse28 (= ~c_empty_req~0 1)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse29 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_rsp_ev~0)) (.cse32 (= ~c_empty_rsp~0 1))) (let ((.cse37 (and .cse27 .cse28 .cse22 .cse29 .cse30 .cse32)) (.cse23 (<= ~c_req_type~0 1)) (.cse34 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse38 (+ ~req_tt_a~0 52)) (.cse39 (+ ~s_memory2~0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse33 (<= 1 ~c_m_lock~0)) (.cse31 (= ~s_run_pc~0 2))) (let ((.cse5 (and (and .cse28 .cse30 .cse32) .cse21 .cse33 .cse31)) (.cse7 (= ~m_run_pc~0 6)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse13 (= .cse39 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse17 (= ULTIMATE.start_m_run_~a~0 1)) (.cse14 (= .cse39 .cse38)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse38)) (.cse18 (= ~a_t~0 1)) (.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse16 (and .cse21 .cse37 .cse23 .cse33 .cse31 .cse34)) (.cse12 (<= ~c_req_a~0 2)) (.cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 2 ~a_t~0)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse6 (<= ~a_t~0 0)) (.cse35 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse36 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) .cse2 (= ~req_tt_a~0 0) (and .cse3 (and (= 0 ~c_req_a~0) (and .cse4 (<= 0 ~a_t~0) .cse5 .cse6) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) .cse8) .cse9) (and (and .cse0 .cse1 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and (and (and .cse5 .cse10 .cse11) .cse7) .cse3 .cse8) .cse12 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse14 .cse2 .cse15) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (and (and (= 1 ULTIMATE.start_s_run_~req_a~1) .cse16) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) .cse17 (<= ~c_req_d~0 (+ ~c_req_a~0 50)) .cse18) (and (and .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (and .cse5 .cse7) .cse3 .cse8) (<= ~c_req_a~0 1)) .cse13 .cse17 .cse14 .cse2 .cse1 .cse15 (= ~req_tt_a~0 1) .cse18) (and (and .cse19 .cse20 (and .cse4 (and .cse21 .cse22 .cse23 (let ((.cse24 (and (<= ~c_req_a~0 0) .cse25 .cse26 (and .cse27 .cse28 .cse29 .cse30 (not .cse31) .cse32)))) (or (and (= ~s_run_pc~0 0) .cse24) (and (<= 2 ~s_run_pc~0) .cse24))) .cse33 .cse34)) .cse35 .cse36) (= ~a_t~0 0) .cse9) (and (= 52 ~c_req_d~0) (and (<= ULTIMATE.start_s_memory_write_~v 51) .cse0 .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (and (and (<= 2 ~c_req_a~0) .cse16 (= ULTIMATE.start_s_run_~req_a~1 2) .cse12) .cse10 .cse11)) (= 52 ULTIMATE.start_s_run_~req_d~1)) (and (and .cse19 .cse20 (and (<= ~c_req_a~0 ~a_t~0) (and (and .cse4 (and .cse21 .cse23 .cse33 .cse31 (and .cse25 .cse37 .cse26) .cse34)) .cse6)) .cse35 .cse36) .cse9))))) [2019-01-12 15:35:05,722 INFO L444 ceAbstractionStarter]: At program point L876-1(lines 860 1111) the Hoare annotation is: (let ((.cse35 (+ ~req_tt_a~0 52)) (.cse34 (+ ~s_memory2~0 ~c_req_a~0)) (.cse38 (= ~s_run_pc~0 2)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse32 (= ~m_run_pc~0 3)) (.cse39 (= ~m_run_st~0 0)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse36 (<= 1 ~c_m_lock~0)) (.cse40 (+ ~c_req_a~0 50))) (let ((.cse21 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse26 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse24 (<= 2 ~a_t~0)) (.cse20 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= .cse40 ~c_req_d~0)) (.cse22 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse19 (<= ~c_req_d~0 .cse40)) (.cse25 (and .cse12 (and .cse15 .cse32 .cse39 .cse16) .cse36)) (.cse0 (= ~s_memory0~0 50)) (.cse5 (and .cse12 .cse36 .cse38 (and .cse15 .cse39 .cse16))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse27 (= .cse34 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse1 (= ~s_memory1~0 51)) (.cse28 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse35)) (.cse2 (= ~s_memory2~0 52)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse35)) (.cse29 (= ~a_t~0 1)) (.cse10 (= ~a_t~0 0)) (.cse30 (<= ~c_req_d~0 50)) (.cse31 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse33 (<= 2 ~s_run_pc~0)) (.cse13 (<= ~c_req_a~0 0)) (.cse14 (<= 0 ~c_req_a~0)) (.cse17 (= ~c_empty_rsp~0 1)) (.cse11 (<= 0 ULTIMATE.start_m_run_~a~0))) (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 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse3 (and (and (= 0 ~c_req_a~0) (and .cse4 .cse5) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse6) .cse7 .cse8) .cse9 .cse10 .cse11) (and .cse12 .cse8 .cse10 (and .cse13 .cse14 .cse15 (<= ~m_run_pc~0 0) (<= ~c_m_lock~0 0) .cse16 .cse17)) (and .cse18 (= 52 ~c_req_d~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse19 .cse3 .cse20 (and .cse21 .cse22 .cse0 (and .cse23 .cse24 .cse25) .cse1 .cse26)) (and (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse27 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse3 .cse28 (and (<= 2 ~c_req_a~0) .cse21 .cse1 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse26 (and (and .cse7 .cse8 (and (and .cse5 .cse23 .cse24) .cse6)) .cse0) (<= ~c_req_a~0 2))) (and .cse18 .cse19 (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse22 (and (<= ULTIMATE.start_m_run_~a~0 1) .cse25) .cse0 (<= ~c_req_d~0 51) (= ~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) .cse20 (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0)) (<= 1 ULTIMATE.start_m_run_~a~0) .cse29) (and .cse18 .cse22 .cse19 (= ULTIMATE.start_s_run_~req_a~1 0) .cse10 (and .cse30 .cse31 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (and .cse4 .cse25) (= ~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)) .cse11) (and (and .cse15 .cse32 .cse16 .cse17) .cse33) (and (and .cse0 (and (and .cse5 .cse6) .cse7 .cse8)) .cse27 (= ULTIMATE.start_m_run_~a~0 1) (= .cse34 .cse35) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse1 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse28 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 (= 51 ~c_rsp_d~0) .cse9 .cse29) (and .cse10 (and .cse30 .cse31 (and .cse4 (and .cse12 (<= ~c_req_type~0 1) .cse36 (let ((.cse37 (and .cse13 .cse14 (<= 1 ~c_req_type~0) .cse32 .cse16 (not .cse38) .cse17))) (or (and .cse37 .cse33) (and (= ~s_run_pc~0 0) .cse37)))))) .cse11)))) [2019-01-12 15:35:05,723 INFO L448 ceAbstractionStarter]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2019-01-12 15:35:05,725 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 815) no Hoare annotation was computed. [2019-01-12 15:35:05,726 INFO L444 ceAbstractionStarter]: At program point L481(lines 133 482) the Hoare annotation is: (let ((.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse1 (<= 2 ~s_run_st~0)) (.cse2 (<= 2 ~s_run_pc~0))) (or (let ((.cse0 (+ ~c_req_a~0 50))) (and (= 52 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (<= ~c_req_d~0 .cse0) (= ~s_memory0~0 50) (= ~s_memory1~0 51) (and (and (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse1 .cse2 (= ~m_run_pc~0 3) .cse3 .cse4 .cse5) (<= 3 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) (<= .cse0 ~c_req_d~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (and (and .cse3 .cse4 (not (= ~s_run_pc~0 2)) .cse5) .cse1 .cse2))) [2019-01-12 15:35:05,726 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2019-01-12 15:35:05,726 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 353) no Hoare annotation was computed. [2019-01-12 15:35:05,726 INFO L448 ceAbstractionStarter]: For program point L944(lines 944 948) no Hoare annotation was computed. [2019-01-12 15:35:05,726 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:35:05,726 INFO L448 ceAbstractionStarter]: For program point L879-1(lines 876 1106) no Hoare annotation was computed. [2019-01-12 15:35:05,726 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 753) no Hoare annotation was computed. [2019-01-12 15:35:05,726 INFO L444 ceAbstractionStarter]: At program point L747-1(lines 747 753) the Hoare annotation is: (let ((.cse10 (+ ~req_tt_a~0 52))) (let ((.cse6 (= ~s_memory1~0 51)) (.cse7 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse10)) (.cse8 (= ~s_memory2~0 52)) (.cse1 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse10)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse5 (= ~s_memory0~0 50)) (.cse2 (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)))) (.cse3 (= ~m_run_pc~0 6))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse2) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse3) .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 .cse9 (= ~a_t~0 1)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse4 .cse0 .cse5 .cse6 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (= 0 ~c_req_a~0) .cse2 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3) .cse1 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse9 (= ~a_t~0 0)) (and (= 52 ~c_rsp_d~0) .cse6 .cse7 .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse1 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse9 (and .cse4 .cse0 .cse5 (and (and .cse2 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse3)) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2))))) [2019-01-12 15:35:05,727 INFO L444 ceAbstractionStarter]: At program point L681(lines 674 727) the Hoare annotation is: (let ((.cse10 (+ ~req_tt_a~0 52))) (let ((.cse3 (= ~s_memory1~0 51)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse10)) (.cse4 (= ~s_memory2~0 52)) (.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (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)))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse10))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 .cse2 .cse3 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (and (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5 .cse6) (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse8 (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and (and (and .cse5 (<= ULTIMATE.start_m_run_~a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse6) .cse7 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse4 .cse8 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse3 .cse9 .cse4 (and .cse0 .cse1 .cse2 (and (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) .cse5 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse6)) (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse7 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse8 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2))))) [2019-01-12 15:35:05,727 INFO L448 ceAbstractionStarter]: For program point L880(lines 879 903) no Hoare annotation was computed. [2019-01-12 15:35:05,728 INFO L444 ceAbstractionStarter]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse81 (<= 1 ~c_req_type~0)) (.cse43 (= ~m_run_pc~0 3)) (.cse33 (<= 2 ~c_write_rsp_ev~0)) (.cse34 (= ~c_empty_rsp~0 1)) (.cse58 (= ~s_run_pc~0 2))) (let ((.cse27 (<= ~c_req_a~0 0)) (.cse28 (<= 0 ~c_req_a~0)) (.cse77 (not .cse58)) (.cse76 (and .cse33 .cse34)) (.cse80 (+ ~s_memory2~0 ~c_req_a~0)) (.cse31 (<= 2 ~s_run_st~0)) (.cse29 (= ~c_empty_req~0 1)) (.cse79 (= ~m_run_st~0 0)) (.cse82 (+ ~c_req_a~0 50)) (.cse57 (<= 2 ~c_write_req_ev~0)) (.cse71 (<= ~c_req_type~0 1)) (.cse72 (<= 1 ~c_m_lock~0)) (.cse73 (and .cse81 .cse43 .cse33 .cse34)) (.cse78 (+ ~req_tt_a~0 52))) (let ((.cse11 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse13 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse41 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse78)) (.cse18 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse21 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse10 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse24 (= 52 ~c_req_d~0)) (.cse23 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse20 (and .cse57 .cse71 .cse72 .cse58 .cse73)) (.cse53 (<= ~c_req_d~0 51)) (.cse55 (<= 51 ~c_req_d~0)) (.cse56 (= ULTIMATE.start_m_run_~a~0 1)) (.cse52 (<= .cse82 ~c_req_d~0)) (.cse66 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse61 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse62 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse54 (and .cse57 .cse31 (and .cse29 .cse43 .cse79 .cse33) .cse72 .cse58)) (.cse63 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse64 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse65 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse45 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse36 (= ~s_memory2~0 52)) (.cse59 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1)) (.cse49 (= ~req_tt_a~0 0)) (.cse60 (= ULTIMATE.start_s_run_~req_a~1 2)) (.cse16 (= .cse80 .cse78)) (.cse40 (<= 1 ~c_req_a~0)) (.cse1 (and .cse57 .cse76 .cse72 .cse58)) (.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse39 (<= ~c_req_a~0 1)) (.cse42 (= ~a_t~0 1)) (.cse67 (<= ~c_req_d~0 50)) (.cse68 (<= 50 ~c_req_d~0)) (.cse25 (<= ~c_req_d~0 .cse82)) (.cse26 (= ~s_run_pc~0 0)) (.cse74 (and .cse27 .cse28 (and .cse81 .cse43 .cse33 .cse77 .cse34))) (.cse30 (<= ~m_run_pc~0 0)) (.cse46 (= 0 ~c_req_a~0)) (.cse50 (= ~a_t~0 0)) (.cse32 (<= ~c_m_lock~0 0)) (.cse37 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse35 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse69 (<= 0 ~a_t~0)) (.cse47 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse70 (<= ~a_t~0 0)) (.cse51 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse44 (<= 2 ~s_run_pc~0)) (.cse14 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse15 (= .cse80 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse17 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (<= 2 ~c_req_a~0)) (.cse8 (= ~s_memory1~0 51)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse38 (and .cse57 .cse31 .cse72 .cse58 (and .cse29 .cse79 .cse33))) (.cse2 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse3 (<= 2 ~a_t~0)) (.cse4 (= ~m_run_pc~0 6)) (.cse6 (= 0 ~c_req_type~0)) (.cse7 (= ~s_memory0~0 50)) (.cse12 (<= ~c_req_a~0 2))) (or (and (and .cse0 (and (and (and .cse1 .cse2 .cse3) .cse4) .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17) (and (and .cse18 .cse19 (and (and .cse20 .cse12) .cse2 .cse3) .cse7 .cse21 .cse22 .cse23 .cse9 .cse10) .cse24 .cse25) (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse15 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse35 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse36 .cse37 .cse17 (= 51 ~c_rsp_d~0) (and .cse5 .cse6 .cse7 .cse9 .cse10 .cse38 .cse11 .cse39 .cse4 .cse40 .cse13) .cse41 .cse42) (and (and .cse29 .cse43 .cse33 .cse34) .cse44) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse8 .cse45 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse36 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and .cse5 .cse6 (and .cse46 (and .cse47 .cse38) .cse48 .cse4)) .cse17 .cse49 (= 50 ~c_rsp_d~0) .cse41 .cse50 .cse51) (and .cse52 (and .cse18 .cse19 .cse7 .cse53 .cse21 .cse22 .cse9 .cse23 .cse54 .cse10 .cse55) .cse56 .cse25 .cse42) (and .cse57 .cse31 (and .cse43 .cse33 .cse34) .cse58) (and (and .cse2 .cse3 (and .cse29 .cse57 .cse31 .cse44 .cse33 .cse34)) .cse4) (and .cse52 .cse24 (and (and .cse54 .cse2 .cse3) .cse19 .cse7 .cse8) .cse59 .cse25 .cse17 .cse60 .cse23) (and .cse26 .cse30 .cse6 .cse34 .cse46 .cse29 .cse57 .cse50 .cse32 .cse33) (and (and .cse20 .cse61 .cse62 .cse19 .cse53 .cse63 .cse55 .cse64 .cse65) .cse52 .cse56 .cse25 .cse66 .cse42) (and .cse52 .cse25 .cse66 (and .cse67 .cse68 .cse61 .cse62 .cse19 (and .cse69 (and .cse47 .cse70 .cse54)) .cse63 .cse64 .cse65) .cse51) (and (and (and .cse1 .cse4) .cse6) .cse19 .cse16 .cse7 .cse8 .cse45 .cse36 (= ULTIMATE.start_m_run_~a~0 0) .cse59 .cse49 .cse17 .cse60 .cse50) (and .cse15 .cse16 .cse17 .cse8 (and .cse40 .cse7 (and .cse5 .cse6 (and (and .cse1 .cse37) .cse48 .cse4)) .cse39) (= ~req_tt_a~0 1) .cse35 .cse42) (and (and .cse67 .cse68 (and .cse47 (and .cse57 .cse71 .cse72 .cse58 (and .cse27 .cse28 .cse73)))) .cse50 .cse51) (and (and .cse68 (and .cse47 (and .cse26 .cse57 .cse71 .cse74 .cse72))) .cse25 .cse50 .cse51) (and .cse26 .cse31 .cse74) (and .cse30 .cse6 .cse34 .cse46 .cse29 .cse57 .cse31 .cse50 .cse58 .cse32 .cse33) (and (let ((.cse75 (and (and .cse57 .cse31 .cse76 .cse58) .cse72))) (or (and (and (<= ~a_t~0 1) .cse37 .cse75) (<= 1 ~a_t~0) .cse35) (and .cse69 (and .cse47 .cse70 .cse75) .cse51) (and .cse2 .cse75 .cse3))) .cse4) (and .cse31 .cse44 (and .cse33 .cse77 .cse34)) (and .cse14 (= 52 ~c_rsp_d~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse15 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse17 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse78) (and .cse0 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse8 (and (and .cse5 (and (and .cse38 .cse2 .cse3) .cse4) .cse6) .cse7) (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse12)))))) [2019-01-12 15:35:05,731 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 885) no Hoare annotation was computed. [2019-01-12 15:35:05,731 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 687) no Hoare annotation was computed. [2019-01-12 15:35:05,732 INFO L444 ceAbstractionStarter]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse18 (<= 2 ~c_write_req_ev~0)) (.cse23 (= ~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)) (.cse24 (+ ~req_tt_a~0 52)) (.cse19 (= ~s_run_pc~0 2))) (let ((.cse5 (<= 2 ~s_run_pc~0)) (.cse3 (not .cse19)) (.cse17 (= ~m_run_pc~0 3)) (.cse6 (= 0 ~c_req_type~0)) (.cse8 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse9 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ~s_memory1~0 51)) (.cse12 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse24)) (.cse13 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse15 (= ~s_memory2~0 52)) (.cse16 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse24)) (.cse7 (and .cse18 (and .cse23 .cse1 .cse2 .cse4) .cse0 .cse19)) (.cse20 (<= 3 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= 2 ~a_t~0)) (.cse14 (= ~m_run_pc~0 6))) (or (and .cse0 (and .cse1 .cse2 .cse3 (<= 3 ~m_run_pc~0) .cse4) .cse5) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse7 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= ULTIMATE.start_m_run_~a~0 1) .cse8 (= 50 ~c_rsp_d~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse15 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse16 (= ~a_t~0 0)) (and (and (and .cse17 .cse1 .cse2 .cse4) .cse18 .cse0 .cse19) .cse20 .cse21) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse5 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (let ((.cse22 (+ ~c_req_a~0 50))) (and (= 52 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (<= ~c_req_d~0 .cse22) .cse10 .cse11 (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) (and (and .cse0 (and .cse23 .cse17 .cse1 .cse2 .cse4)) .cse18 .cse19)) (<= .cse22 ~c_req_d~0) .cse15 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0))) (and .cse6 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse7 .cse8 (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse12 .cse13 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) .cse14 (<= 1 ~c_req_a~0) .cse15 .cse16 (= ~a_t~0 1)) (and (and .cse7 .cse20 .cse21) .cse14)))) [2019-01-12 15:35:05,735 INFO L444 ceAbstractionStarter]: At program point L1278(lines 1271 1315) the Hoare annotation is: (let ((.cse37 (= ~s_run_pc~0 2)) (.cse46 (<= 1 ~c_req_type~0)) (.cse27 (= ~m_run_pc~0 3)) (.cse24 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~c_empty_rsp~0 1))) (let ((.cse45 (+ ~c_req_a~0 50)) (.cse35 (<= ~c_req_type~0 1)) (.cse38 (and .cse46 .cse27 .cse24 .cse25)) (.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse44 (not .cse37)) (.cse34 (<= 2 ~c_write_req_ev~0)) (.cse43 (and .cse24 .cse25)) (.cse36 (<= 1 ~c_m_lock~0)) (.cse47 (+ ~s_memory2~0 ~c_req_a~0))) (let ((.cse10 (<= ~c_req_a~0 2)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (= .cse47 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse12 (= .cse47 (+ ~req_tt_a~0 52))) (.cse13 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (= ~s_memory1~0 51)) (.cse6 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (and .cse34 .cse43 .cse36 .cse37)) (.cse32 (<= 50 ~c_req_d~0)) (.cse40 (and .cse18 .cse19 (and .cse46 .cse27 .cse24 .cse44 .cse25))) (.cse29 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse39 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 2 ~a_t~0)) (.cse3 (= ~m_run_pc~0 6)) (.cse22 (<= 2 ~s_run_st~0)) (.cse28 (<= 2 ~s_run_pc~0)) (.cse17 (= ~s_run_pc~0 0)) (.cse21 (<= ~m_run_pc~0 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse41 (= 0 ~c_req_a~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse26 (= ~a_t~0 0)) (.cse23 (<= ~c_m_lock~0 0)) (.cse15 (and .cse34 .cse35 .cse36 .cse37 .cse38)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (<= ~c_req_d~0 .cse45)) (.cse31 (= ~a_t~0 1))) (or (and (and (<= 2 ~c_req_a~0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (and (and .cse15 .cse10) .cse1 .cse2) .cse6 (= ~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) .cse8 .cse9) (= 52 ~c_req_d~0) .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (and (and .cse0 .cse3) .cse5) .cse14 .cse12 .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ~req_tt_a~0 0) .cse13 (= ULTIMATE.start_s_run_~req_a~1 2) .cse26) (and (and .cse20 .cse27 .cse24 .cse25) .cse28) (and .cse11 .cse12 .cse13 .cse7 (and (<= 1 ~c_req_a~0) .cse6 (and .cse4 .cse5 (and (and .cse0 .cse29) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3)) (<= ~c_req_a~0 1)) (= ~req_tt_a~0 1) .cse30 .cse31) (and (and (<= ~c_req_d~0 50) .cse32 (and .cse33 (and .cse34 .cse35 .cse36 .cse37 (and .cse18 .cse19 .cse38)))) .cse26 .cse39) (and (and .cse32 (and .cse33 (and .cse17 .cse34 .cse35 .cse40 .cse36))) .cse16 .cse26 .cse39) (and .cse17 .cse22 .cse40) (and .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse22 .cse26 .cse37 .cse23 .cse24) (and (let ((.cse42 (and (and .cse34 .cse22 .cse43 .cse37) .cse36))) (or (and (and (<= ~a_t~0 1) .cse29 .cse42) (<= 1 ~a_t~0) .cse30) (and (<= 0 ~a_t~0) (and .cse33 (<= ~a_t~0 0) .cse42) .cse39) (and .cse1 .cse42 .cse2))) .cse3) (and .cse34 .cse22 (and .cse27 .cse24 .cse25) .cse37) (and (and .cse1 .cse2 (and .cse20 .cse34 .cse22 .cse28 .cse24 .cse25)) .cse3) (and .cse22 .cse28 (and .cse24 .cse44 .cse25)) (and .cse17 .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse26 .cse23 .cse24) (and (and .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (<= .cse45 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) .cse16 (= ULTIMATE.start_s_run_~req_a~1 0) .cse31))))) [2019-01-12 15:35:05,737 INFO L444 ceAbstractionStarter]: At program point L221(lines 214 267) the Hoare annotation is: (let ((.cse21 (+ ~c_req_a~0 50))) (let ((.cse6 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (<= ~c_req_a~0 0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 (+ ULTIMATE.start_m_run_~req_a~0 50))) (.cse20 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse22 (= ~m_run_pc~0 3)) (.cse0 (<= 2 ~s_run_st~0)) (.cse5 (<= 1 ~c_req_type~0)) (.cse7 (<= ~m_run_pc~0 0)) (.cse16 (<= ~c_req_type~0 1)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse10 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse11 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse4 (= ~s_run_pc~0 0)) (.cse12 (<= ~c_req_d~0 50)) (.cse23 (<= .cse21 ~c_req_d~0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse13 (= ~a_t~0 0)) (.cse15 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (not (= ~s_run_pc~0 2)) .cse2 .cse3) (and .cse4 (<= ULTIMATE.start_m_run_~a~0 0) .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 .cse0 .cse10 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) .cse11) (and .cse12 (<= 50 ~c_req_d~0) .cse13 .cse14 .cse15 (and .cse5 .cse6 .cse7 .cse16 .cse1 .cse2 .cse8 .cse9 .cse0 .cse17 .cse18 .cse10 .cse3) .cse19) (and .cse5 .cse20 .cse16 (= ULTIMATE.start_m_run_~req_d~0 52) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse1 .cse2 .cse0 .cse17 .cse18 .cse14 .cse10 (= 52 ~c_req_d~0) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 .cse21) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0) (= ~s_memory0~0 50) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse22 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 (= ~a_t~0 1)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse20 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (and (and .cse5 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse16 .cse1 .cse22 .cse2 (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) .cse0 .cse17 .cse18 .cse10 .cse3) (<= 1 ULTIMATE.start_m_run_~a~0)) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse23 (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~c_req_d~0 51) .cse13 (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse5 .cse7 .cse16 .cse2 .cse17 .cse18 .cse10 .cse11 (<= ULTIMATE.start_m_run_~req_d~0 50) .cse4 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0) .cse12 .cse23 .cse9 .cse13 .cse15 .cse3 .cse19)))) [2019-01-12 15:35:05,739 INFO L448 ceAbstractionStarter]: For program point L486(lines 485 837) no Hoare annotation was computed. [2019-01-12 15:35:05,739 INFO L451 ceAbstractionStarter]: At program point L1345(lines 1167 1350) the Hoare annotation is: true [2019-01-12 15:35:05,740 INFO L444 ceAbstractionStarter]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse50 (<= 1 ~c_req_type~0)) (.cse40 (= ~c_empty_rsp~0 1)) (.cse41 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= ~c_req_type~0 1)) (.cse7 (and .cse50 .cse40 .cse41)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ~s_run_pc~0 2))) (let ((.cse6 (<= ~c_req_a~0 0)) (.cse25 (and .cse41 (not .cse9) .cse40)) (.cse48 (= ~c_empty_req~0 1)) (.cse24 (<= 2 ~s_run_st~0)) (.cse49 (= ~m_run_pc~0 3)) (.cse51 (+ ~c_req_a~0 50)) (.cse36 (<= ~c_req_d~0 51)) (.cse33 (<= 51 ~c_req_d~0)) (.cse44 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0)) (.cse45 (<= 1 ~a_t~0)) (.cse35 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse47 (and .cse4 .cse5 .cse7 .cse8 .cse9)) (.cse34 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse13 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse15 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse20 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ULTIMATE.start_s_run_~req_d~1 50))) (let ((.cse11 (= ~a_t~0 0)) (.cse0 (and (<= ~a_t~0 1) (and .cse36 .cse33 (and (let ((.cse52 (and (and (<= 1 ~c_req_a~0) .cse47 (<= ~c_req_a~0 1)) .cse34))) (or (and .cse44 (<= 0 ~a_t~0) .cse52 .cse35) (and .cse45 .cse52 .cse35))) .cse13 .cse14 .cse15 .cse20 .cse16 .cse17 .cse22)))) (.cse1 (= ~a_t~0 1)) (.cse10 (<= ~c_req_d~0 .cse51)) (.cse21 (and .cse48 .cse4 .cse24 .cse8 .cse9 .cse49 .cse41)) (.cse19 (<= .cse51 ~c_req_d~0)) (.cse18 (<= ~c_req_d~0 50)) (.cse2 (<= 50 ~c_req_d~0)) (.cse3 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse38 (= 52 ~c_req_d~0)) (.cse27 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (= ~s_memory0~0 50)) (.cse29 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse39 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse30 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse37 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse32 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse26 (<= 2 ~s_run_pc~0)) (.cse42 (= ~s_run_pc~0 0)) (.cse43 (and .cse6 (<= 0 ~c_req_a~0) (and .cse50 .cse25)))) (or (and .cse0 .cse1) (and (and .cse2 (and .cse3 (and .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9))) .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse10 .cse16 .cse17 .cse18 .cse19 .cse2 .cse20 .cse11 (and .cse3 .cse21) .cse12 .cse22) (let ((.cse23 (+ ULTIMATE.start_m_run_~req_a~0 50))) (and (<= .cse23 ULTIMATE.start_m_run_~req_d~0) (<= ULTIMATE.start_m_run_~req_d~0 .cse23) .cse0)) (and .cse24 .cse25 .cse26) (and .cse27 .cse15 .cse10 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse19 .cse34 (and .cse21 .cse35) .cse36 .cse37 .cse1) (and .cse38 .cse15 .cse10 .cse28 (= ~s_memory1~0 51) (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) .cse21 .cse39) .cse19 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse37) (and (and .cse40 .cse41) .cse4 .cse24 .cse9) (and (and .cse18 .cse2 (and .cse3 (<= ~c_req_a~0 ~a_t~0) (<= ~a_t~0 0) (and .cse42 .cse4 .cse5 .cse8 .cse43))) .cse12) (and .cse38 (and .cse27 .cse15 .cse28 .cse29 (let ((.cse46 (and (<= 2 ~c_req_a~0) .cse47 (<= ~c_req_a~0 2)))) (or (and .cse44 .cse45 .cse46 .cse39) (and .cse46 .cse39 (<= 2 ~a_t~0)))) .cse30 .cse37 .cse31 .cse32)) (and .cse48 .cse26 .cse49 .cse41 .cse40) (and .cse42 .cse24 .cse43)))))) [2019-01-12 15:35:05,750 INFO L444 ceAbstractionStarter]: At program point L1213(lines 1206 1232) 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 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 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:35:05,750 INFO L444 ceAbstractionStarter]: At program point L817(lines 810 827) the Hoare annotation is: (let ((.cse4 (+ ~req_tt_a~0 52))) (let ((.cse3 (= 0 ~c_req_type~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (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))) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse4)) (.cse8 (= ~s_memory2~0 52)) (.cse10 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse4))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (and .cse0 .cse1) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 (= (+ ~s_memory2~0 ~c_req_a~0) .cse4) .cse5 .cse6 .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse10 (= ~a_t~0 0)) (and (= 52 ~c_rsp_d~0) .cse6 .cse7 (and .cse2 .cse3 .cse5 (and (and .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~a_t~0)) .cse1)) .cse8 (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse9 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse10 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) (and (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse0) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse1) .cse2 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse8 .cse10 (= ~a_t~0 1))))) [2019-01-12 15:35:05,755 INFO L448 ceAbstractionStarter]: For program point L619(lines 619 623) no Hoare annotation was computed. [2019-01-12 15:35:05,755 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-01-12 15:35:05,755 INFO L444 ceAbstractionStarter]: At program point L421(lines 414 458) the Hoare annotation is: (let ((.cse10 (<= 2 ~s_run_st~0)) (.cse8 (= ~s_run_pc~0 2)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse11 (+ ~c_req_a~0 50))) (let ((.cse2 (= ~s_memory0~0 50)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse11)) (.cse3 (and (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse10 .cse8 (= ~m_run_pc~0 3) .cse6 .cse7 .cse9)) (.cse4 (<= .cse11 ~c_req_d~0))) (or (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse3) .cse4 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5) (and (and .cse6 .cse7 (not .cse8) .cse9) .cse10 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (= ~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) .cse4 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse3 (<= ~c_req_d~0 50) .cse4 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-01-12 15:35:05,755 INFO L444 ceAbstractionStarter]: At program point L355(lines 348 374) the Hoare annotation is: (let ((.cse6 (+ ~c_req_a~0 50))) (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse6)) (.cse4 (= ~s_memory0~0 50)) (.cse2 (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))) (.cse3 (<= .cse6 ~c_req_d~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse3 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse2 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse4 (= ~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) .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse4 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse2) .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5)))) [2019-01-12 15:35:05,759 INFO L448 ceAbstractionStarter]: For program point L289(lines 288 316) no Hoare annotation was computed. [2019-01-12 15:35:05,759 INFO L448 ceAbstractionStarter]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2019-01-12 15:35:05,759 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 227) no Hoare annotation was computed. [2019-01-12 15:35:05,759 INFO L444 ceAbstractionStarter]: At program point L950(lines 943 960) the Hoare annotation is: (let ((.cse27 (<= 1 ~c_req_type~0)) (.cse28 (= ~c_empty_req~0 1)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse29 (= ~m_run_pc~0 3)) (.cse30 (<= 2 ~c_write_rsp_ev~0)) (.cse32 (= ~c_empty_rsp~0 1))) (let ((.cse37 (and .cse27 .cse28 .cse22 .cse29 .cse30 .cse32)) (.cse23 (<= ~c_req_type~0 1)) (.cse34 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse38 (+ ~req_tt_a~0 52)) (.cse39 (+ ~s_memory2~0 ~c_req_a~0)) (.cse21 (<= 2 ~c_write_req_ev~0)) (.cse33 (<= 1 ~c_m_lock~0)) (.cse31 (= ~s_run_pc~0 2))) (let ((.cse5 (and (and .cse28 .cse30 .cse32) .cse21 .cse33 .cse31)) (.cse7 (= ~m_run_pc~0 6)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse13 (= .cse39 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse17 (= ULTIMATE.start_m_run_~a~0 1)) (.cse14 (= .cse39 .cse38)) (.cse2 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse38)) (.cse18 (= ~a_t~0 1)) (.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~s_memory1~0 51)) (.cse16 (and .cse21 .cse37 .cse23 .cse33 .cse31 .cse34)) (.cse12 (<= ~c_req_a~0 2)) (.cse10 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 2 ~a_t~0)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse25 (<= 0 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse6 (<= ~a_t~0 0)) (.cse35 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse36 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) .cse2 (= ~req_tt_a~0 0) (and .cse3 (and (= 0 ~c_req_a~0) (and .cse4 (<= 0 ~a_t~0) .cse5 .cse6) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7) .cse8) .cse9) (and (and .cse0 .cse1 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (and (and (and .cse5 .cse10 .cse11) .cse7) .cse3 .cse8) .cse12 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse14 .cse2 .cse15) (and (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (and (and (= 1 ULTIMATE.start_s_run_~req_a~1) .cse16) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0)) .cse17 (<= ~c_req_d~0 (+ ~c_req_a~0 50)) .cse18) (and (and .cse0 (<= 1 ULTIMATE.start_s_run_~req_a~1) (and (and .cse5 .cse7) .cse3 .cse8) (<= ~c_req_a~0 1)) .cse13 .cse17 .cse14 .cse2 .cse1 .cse15 (= ~req_tt_a~0 1) .cse18) (and (and .cse19 .cse20 (and .cse4 (and .cse21 .cse22 .cse23 (let ((.cse24 (and (<= ~c_req_a~0 0) .cse25 .cse26 (and .cse27 .cse28 .cse29 .cse30 (not .cse31) .cse32)))) (or (and (= ~s_run_pc~0 0) .cse24) (and (<= 2 ~s_run_pc~0) .cse24))) .cse33 .cse34)) .cse35 .cse36) (= ~a_t~0 0) .cse9) (and (= 52 ~c_req_d~0) (and (<= ULTIMATE.start_s_memory_write_~v 51) .cse0 .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (and (and (<= 2 ~c_req_a~0) .cse16 (= ULTIMATE.start_s_run_~req_a~1 2) .cse12) .cse10 .cse11)) (= 52 ULTIMATE.start_s_run_~req_d~1)) (and (and .cse19 .cse20 (and (<= ~c_req_a~0 ~a_t~0) (and (and .cse4 (and .cse21 .cse23 .cse33 .cse31 (and .cse25 .cse37 .cse26) .cse34)) .cse6)) .cse35 .cse36) .cse9))))) [2019-01-12 15:35:05,763 INFO L448 ceAbstractionStarter]: For program point L818(lines 810 827) no Hoare annotation was computed. [2019-01-12 15:35:05,763 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 294) no Hoare annotation was computed. [2019-01-12 15:35:05,763 INFO L448 ceAbstractionStarter]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2019-01-12 15:35:05,763 INFO L448 ceAbstractionStarter]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2019-01-12 15:35:05,764 INFO L448 ceAbstractionStarter]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2019-01-12 15:35:05,764 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 823) no Hoare annotation was computed. [2019-01-12 15:35:05,765 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2019-01-12 15:35:05,765 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-01-12 15:35:05,765 INFO L448 ceAbstractionStarter]: For program point L952(lines 952 956) no Hoare annotation was computed. [2019-01-12 15:35:05,765 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:35:05,765 INFO L444 ceAbstractionStarter]: At program point L689(lines 682 726) the Hoare annotation is: (let ((.cse10 (+ ~req_tt_a~0 52))) (let ((.cse3 (= ~s_memory1~0 51)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse10)) (.cse4 (= ~s_memory2~0 52)) (.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (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)))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse10))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 .cse2 .cse3 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (and (= 0 ~c_req_a~0) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5 .cse6) (= ULTIMATE.start_m_run_~a~0 0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse8 (= ~a_t~0 0)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (and (and (and .cse5 (<= ULTIMATE.start_m_run_~a~0 1)) (<= 1 ULTIMATE.start_m_run_~a~0)) .cse6) .cse7 (= 51 ~c_rsp_d~0) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse4 .cse8 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse3 .cse9 .cse4 (and .cse0 .cse1 .cse2 (and (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) .cse5 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse6)) (<= 2 ~c_req_a~0) (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse7 (= ULTIMATE.start_m_run_~rsp_d___0~0 52) .cse8 (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2))))) [2019-01-12 15:35:05,766 INFO L444 ceAbstractionStarter]: At program point L557(lines 527 558) the Hoare annotation is: (let ((.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 2 ~s_run_st~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse19 (+ ~req_tt_a~0 52)) (.cse16 (= ~s_run_pc~0 2))) (let ((.cse18 (not .cse16)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse1 (= 0 ~c_req_type~0)) (.cse4 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse0 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ~s_memory1~0 51)) (.cse5 (= ~s_memory2~0 52)) (.cse9 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse19)) (.cse7 (and .cse11 .cse12 (and .cse13 .cse14) .cse15 .cse16)) (.cse8 (= ~m_run_pc~0 6))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse4 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) (and (= 0 ~c_req_a~0) (and (and (<= ULTIMATE.start_m_run_~a~0 1) .cse7) (<= 1 ULTIMATE.start_m_run_~a~0)) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse8) .cse9 (= ~a_t~0 0)) (let ((.cse10 (+ ~c_req_a~0 50))) (and (= 52 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (<= ~c_req_d~0 .cse10) .cse2 .cse3 (and (and .cse11 .cse12 (and (= ~m_run_pc~0 3) .cse13 .cse14) .cse15 .cse16) (<= ~c_req_a~0 ~a_t~0)) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (<= .cse10 ~c_req_d~0) .cse5 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0))) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse12 .cse17 .cse18 .cse13 .cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (and .cse18 .cse13 .cse14 (<= 3 ~m_run_pc~0)) .cse12 .cse17) (and .cse1 .cse4 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (= 51 ~c_rsp_d~0) .cse0 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse19) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse5 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_m_run_~a~0 2) .cse9 (and (and .cse7 (<= 2 ULTIMATE.start_m_run_~a~0)) .cse8) (= ~a_t~0 1))))) [2019-01-12 15:35:05,769 INFO L448 ceAbstractionStarter]: For program point L756(lines 756 809) no Hoare annotation was computed. [2019-01-12 15:35:05,769 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 761) no Hoare annotation was computed. [2019-01-12 15:35:05,769 INFO L448 ceAbstractionStarter]: For program point L691(lines 691 695) no Hoare annotation was computed. [2019-01-12 15:35:05,769 INFO L444 ceAbstractionStarter]: At program point L625(lines 618 635) the Hoare annotation is: (let ((.cse3 (<= 2 ~s_run_st~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse1 (<= 1 ~a_t~0)) (.cse2 (<= 0 ~a_t~0)) (.cse0 (and .cse3 (<= 1 ~c_m_lock~0) .cse5 (and .cse6 .cse4)))) (or (and .cse0 .cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) (and (or (and .cse2 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~a_t~0 0) .cse0) (and (<= ~a_t~0 1) .cse1 .cse0)) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse3 (<= 2 ~s_run_pc~0) (and .cse4 (not .cse5) .cse6)) (and .cse2 (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0) (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-01-12 15:35:05,770 INFO L444 ceAbstractionStarter]: At program point L1286(lines 1279 1314) the Hoare annotation is: (let ((.cse37 (= ~s_run_pc~0 2)) (.cse46 (<= 1 ~c_req_type~0)) (.cse27 (= ~m_run_pc~0 3)) (.cse24 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~c_empty_rsp~0 1))) (let ((.cse45 (+ ~c_req_a~0 50)) (.cse35 (<= ~c_req_type~0 1)) (.cse38 (and .cse46 .cse27 .cse24 .cse25)) (.cse18 (<= ~c_req_a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse44 (not .cse37)) (.cse34 (<= 2 ~c_write_req_ev~0)) (.cse43 (and .cse24 .cse25)) (.cse36 (<= 1 ~c_m_lock~0)) (.cse47 (+ ~s_memory2~0 ~c_req_a~0))) (let ((.cse10 (<= ~c_req_a~0 2)) (.cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (= .cse47 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse12 (= .cse47 (+ ~req_tt_a~0 52))) (.cse13 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse7 (= ~s_memory1~0 51)) (.cse6 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (and .cse34 .cse43 .cse36 .cse37)) (.cse32 (<= 50 ~c_req_d~0)) (.cse40 (and .cse18 .cse19 (and .cse46 .cse27 .cse24 .cse44 .cse25))) (.cse29 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse30 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse39 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 2 ~a_t~0)) (.cse3 (= ~m_run_pc~0 6)) (.cse22 (<= 2 ~s_run_st~0)) (.cse28 (<= 2 ~s_run_pc~0)) (.cse17 (= ~s_run_pc~0 0)) (.cse21 (<= ~m_run_pc~0 0)) (.cse5 (= 0 ~c_req_type~0)) (.cse41 (= 0 ~c_req_a~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse26 (= ~a_t~0 0)) (.cse23 (<= ~c_m_lock~0 0)) (.cse15 (and .cse34 .cse35 .cse36 .cse37 .cse38)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse16 (<= ~c_req_d~0 .cse45)) (.cse31 (= ~a_t~0 1))) (or (and (and (<= 2 ~c_req_a~0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ULTIMATE.start_s_memory_read_~i 1)) (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13) (and (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (and (and .cse15 .cse10) .cse1 .cse2) .cse6 (= ~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) .cse8 .cse9) (= 52 ~c_req_d~0) .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (and (and .cse0 .cse3) .cse5) .cse14 .cse12 .cse6 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 52) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ~req_tt_a~0 0) .cse13 (= ULTIMATE.start_s_run_~req_a~1 2) .cse26) (and (and .cse20 .cse27 .cse24 .cse25) .cse28) (and .cse11 .cse12 .cse13 .cse7 (and (<= 1 ~c_req_a~0) .cse6 (and .cse4 .cse5 (and (and .cse0 .cse29) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3)) (<= ~c_req_a~0 1)) (= ~req_tt_a~0 1) .cse30 .cse31) (and (and (<= ~c_req_d~0 50) .cse32 (and .cse33 (and .cse34 .cse35 .cse36 .cse37 (and .cse18 .cse19 .cse38)))) .cse26 .cse39) (and (and .cse32 (and .cse33 (and .cse17 .cse34 .cse35 .cse40 .cse36))) .cse16 .cse26 .cse39) (and .cse17 .cse22 .cse40) (and .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse22 .cse26 .cse37 .cse23 .cse24) (and (let ((.cse42 (and (and .cse34 .cse22 .cse43 .cse37) .cse36))) (or (and (and (<= ~a_t~0 1) .cse29 .cse42) (<= 1 ~a_t~0) .cse30) (and (<= 0 ~a_t~0) (and .cse33 (<= ~a_t~0 0) .cse42) .cse39) (and .cse1 .cse42 .cse2))) .cse3) (and .cse34 .cse22 (and .cse27 .cse24 .cse25) .cse37) (and (and .cse1 .cse2 (and .cse20 .cse34 .cse22 .cse28 .cse24 .cse25)) .cse3) (and .cse22 .cse28 (and .cse24 .cse44 .cse25)) (and .cse17 .cse21 .cse5 .cse25 .cse41 .cse20 .cse34 .cse26 .cse23 .cse24) (and (and .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= ~c_req_d~0 51) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (<= .cse45 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) .cse16 (= ULTIMATE.start_s_run_~req_a~1 0) .cse31))))) [2019-01-12 15:35:05,775 INFO L444 ceAbstractionStarter]: At program point L229(lines 222 266) the Hoare annotation is: (let ((.cse2 (+ ~c_req_a~0 50)) (.cse7 (<= 1 ~c_req_type~0)) (.cse13 (<= 2 ~s_run_st~0)) (.cse20 (<= ~c_req_type~0 1)) (.cse22 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse23 (<= 1 ~c_m_lock~0)) (.cse25 (= ~s_run_pc~0 2)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (+ ULTIMATE.start_m_run_~req_a~0 50))) (let ((.cse5 (<= ULTIMATE.start_m_run_~req_d~0 .cse3)) (.cse8 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (<= ~c_req_a~0 0)) (.cse1 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse0 (and .cse7 .cse13 .cse20 .cse22 .cse23 .cse25 .cse14 (= ~m_run_pc~0 3) .cse10 .cse15)) (.cse9 (<= ~m_run_pc~0 0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse6 (= ~s_run_pc~0 0)) (.cse17 (<= ~c_req_d~0 50)) (.cse4 (<= .cse2 ~c_req_d~0)) (.cse12 (<= 0 ~c_req_a~0)) (.cse18 (= ~a_t~0 0)) (.cse19 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse24 (= 0 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= 2 ~s_run_pc~0))) (or (and .cse0 (= 52 ~c_req_d~0) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= ~c_req_d~0 .cse2) (<= .cse3 ULTIMATE.start_m_run_~req_d~0) (= ~s_memory0~0 50) (= ULTIMATE.start_m_run_~req_d~0 52) (= ~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) .cse4 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5 (= ULTIMATE.start_m_run_~a~0 2) (= ~a_t~0 1)) (and .cse6 (<= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 ULTIMATE.start_m_run_~a~0) .cse16) (and .cse17 (<= 50 ~c_req_d~0) .cse18 .cse5 .cse19 (and .cse7 .cse8 .cse9 .cse20 .cse21 .cse10 .cse11 .cse12 .cse13 .cse22 .cse23 .cse14 .cse15) .cse24) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) (<= ~c_req_d~0 51) .cse18 (and (and (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) .cse0 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0)) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse7 .cse9 .cse20 .cse10 .cse22 .cse23 .cse14 .cse16 (<= ULTIMATE.start_m_run_~req_d~0 50) .cse6 (<= ULTIMATE.start_m_run_~req_a~0 ULTIMATE.start_m_run_~a~0) .cse17 .cse4 .cse12 .cse18 .cse19 .cse15 .cse24) (and .cse13 .cse21 (and (not .cse25) .cse10 .cse15))))) [2019-01-12 15:35:05,777 INFO L448 ceAbstractionStarter]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2019-01-12 15:35:05,777 INFO L448 ceAbstractionStarter]: For program point L626(lines 618 635) no Hoare annotation was computed. [2019-01-12 15:35:05,777 INFO L444 ceAbstractionStarter]: At program point L1221(lines 1214 1231) 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 ~c_req_type~0) .cse2 (= 0 ~c_req_a~0) .cse3 (<= 2 ~c_write_req_ev~0) (= ~a_t~0 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:35:05,777 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 631) no Hoare annotation was computed. [2019-01-12 15:35:05,777 INFO L444 ceAbstractionStarter]: At program point L429(lines 422 457) the Hoare annotation is: (let ((.cse10 (<= 2 ~s_run_st~0)) (.cse8 (= ~s_run_pc~0 2)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse11 (+ ~c_req_a~0 50))) (let ((.cse2 (= ~s_memory0~0 50)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse11)) (.cse3 (and (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse10 .cse8 (= ~m_run_pc~0 3) .cse6 .cse7 .cse9)) (.cse4 (<= .cse11 ~c_req_d~0))) (or (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse2 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse3) .cse4 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5) (and (and .cse6 .cse7 (not .cse8) .cse9) .cse10 (<= 2 ~s_run_pc~0)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (= ~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) .cse4 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse3 (<= ~c_req_d~0 50) .cse4 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-01-12 15:35:05,779 INFO L444 ceAbstractionStarter]: At program point L495-2(lines 495 523) the Hoare annotation is: (let ((.cse8 (+ ~req_tt_a~0 52)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 2 ~s_run_st~0)) (.cse19 (= ~c_empty_req~0 1)) (.cse11 (<= ~c_m_lock~0 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~s_run_pc~0 2))) (let ((.cse16 (<= 2 ~s_run_pc~0)) (.cse13 (not .cse20)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ~s_memory1~0 51)) (.cse3 (= 0 ULTIMATE.start_m_run_~req_type___0~0)) (.cse0 (and .cse18 .cse15 .cse20 (and .cse19 .cse11 .cse14 .cse12))) (.cse1 (= ~m_run_pc~0 6)) (.cse9 (= ~s_memory2~0 52)) (.cse4 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse10 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse8))) (or (and (and .cse0 .cse1) .cse2 .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse4 (= 51 ~c_rsp_d~0) (= ULTIMATE.start_m_run_~a~0 2) .cse5 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse8) (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) (<= 1 ~c_req_a~0) .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ~a_t~0 1)) (and (and (<= ULTIMATE.start_m_run_~a~0 0) (and .cse11 .cse12 .cse13 .cse14) (<= 0 ULTIMATE.start_m_run_~a~0)) .cse15 .cse16) (and .cse15 .cse16 (and .cse12 .cse13 (<= 3 ~m_run_pc~0) .cse14)) (let ((.cse17 (+ ~c_req_a~0 50))) (and (= 52 ~c_req_d~0) (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i) (<= ~c_req_d~0 .cse17) .cse6 .cse7 (and (<= ~c_req_a~0 ~a_t~0) (and .cse18 .cse15 (and .cse19 (= ~m_run_pc~0 3) .cse11 .cse14 .cse12) .cse20)) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse3 (<= .cse17 ~c_req_d~0) .cse9 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (= ULTIMATE.start_s_run_~req_a~1 2) (= 0 ULTIMATE.start_m_run_~a~0))) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse2 .cse6 .cse7 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse3 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (and (= 0 ~c_req_a~0) (and .cse0 (<= ULTIMATE.start_m_run_~a~0 1)) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1) .cse9 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse4 (= 50 ~c_rsp_d~0) (= ~req_tt_a~0 0) .cse10 (= ~a_t~0 0))))) [2019-01-12 15:35:05,786 INFO L444 ceAbstractionStarter]: At program point L363(lines 356 373) the Hoare annotation is: (let ((.cse6 (+ ~c_req_a~0 50))) (let ((.cse0 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse1 (<= ~c_req_d~0 .cse6)) (.cse4 (= ~s_memory0~0 50)) (.cse2 (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))) (.cse3 (<= .cse6 ~c_req_d~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse3 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ~a_t~0 0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse2 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse4 (= ~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) .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= ~c_req_d~0 51) .cse5 (= ~a_t~0 1)) (and (= 52 ~c_req_d~0) .cse0 .cse1 .cse4 (= ~s_memory1~0 51) (and (<= ~c_req_a~0 ~a_t~0) (<= 2 ULTIMATE.start_m_run_~a~0) .cse2) .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v 52) (= ULTIMATE.start_s_run_~req_a~1 2) .cse5)))) [2019-01-12 15:35:05,786 INFO L448 ceAbstractionStarter]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2019-01-12 15:35:05,788 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 235) no Hoare annotation was computed. [2019-01-12 15:35:05,788 INFO L448 ceAbstractionStarter]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2019-01-12 15:35:05,788 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:35:05,789 INFO L448 ceAbstractionStarter]: For program point L496(lines 495 523) no Hoare annotation was computed. [2019-01-12 15:35:05,789 INFO L448 ceAbstractionStarter]: For program point L364(lines 134 480) no Hoare annotation was computed. [2019-01-12 15:35:05,789 INFO L448 ceAbstractionStarter]: For program point L1223(lines 1223 1227) no Hoare annotation was computed. [2019-01-12 15:35:05,789 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 501) no Hoare annotation was computed. [2019-01-12 15:35:05,789 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2019-01-12 15:35:05,789 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-01-12 15:35:05,790 INFO L444 ceAbstractionStarter]: At program point L1026(lines 1000 1027) the Hoare annotation is: (let ((.cse36 (+ ~req_tt_a~0 52)) (.cse35 (+ ~s_memory2~0 ~c_req_a~0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse10 (= ~s_run_pc~0 2)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse37 (= ~c_empty_rsp~0 1)) (.cse38 (+ ~c_req_a~0 50))) (let ((.cse20 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 50 ~c_req_d~0)) (.cse1 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse16 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse13 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (= ~a_t~0 0)) (.cse31 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= .cse38 ~c_req_d~0)) (.cse19 (and .cse5 .cse6 .cse10 (and .cse8 .cse9 .cse11 .cse37))) (.cse3 (= ULTIMATE.start_s_run_~req_a~1 ULTIMATE.start_s_memory_write_~i)) (.cse24 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse15 (<= ~c_req_d~0 .cse38)) (.cse27 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse28 (= 0 ~c_req_type~0)) (.cse29 (and .cse8 .cse5 .cse6 .cse10 .cse11 .cse37)) (.cse30 (= ~m_run_pc~0 6)) (.cse21 (= ~s_memory0~0 50)) (.cse25 (= .cse35 (+ ULTIMATE.start_m_run_~req_a___0~0 52))) (.cse22 (= ~s_memory1~0 51)) (.cse26 (= (+ ~s_memory2~0 ULTIMATE.start_s_run_~req_a~1) .cse36)) (.cse32 (= ~s_memory2~0 52)) (.cse23 (= ULTIMATE.start_s_memory_write_~v 52)) (.cse33 (= (+ ~s_memory2~0 ULTIMATE.start_s_memory_read_~i) .cse36)) (.cse34 (= ~a_t~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (<= ~c_req_a~0 ULTIMATE.start_m_run_~a~0) (and (<= 1 ~c_req_type~0) .cse5 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse6 (let ((.cse7 (and .cse8 .cse9 (not .cse10) .cse11))) (or (and (<= 2 ~s_run_pc~0) .cse7) (and (= ~s_run_pc~0 0) .cse7))) (<= ULTIMATE.start_s_run_~req_type~1 1))) .cse12 .cse13 .cse14) .cse15 .cse16 .cse17) (and .cse18 (= 52 ~c_req_d~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (and (and (<= ULTIMATE.start_s_run_~req_a~1 ~a_t~0) .cse19 .cse20) .cse3 .cse21 .cse22) .cse15 .cse23 (= ULTIMATE.start_s_run_~req_a~1 2) .cse24) (and (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse25 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse23 .cse26 (and (<= 2 ~c_req_a~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse22 (and (and .cse27 .cse28 (and (and .cse29 .cse20 (<= 2 ~a_t~0)) .cse30)) .cse21) (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_s_memory_read_~i) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2))) (and .cse18 .cse15 (and (<= ~c_req_d~0 50) .cse0 .cse1 .cse2 .cse3 .cse16 (and .cse4 .cse19) .cse12 .cse13 .cse14) .cse17 .cse31) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse21 .cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse32 (= 50 ULTIMATE.start_s_memory_read_~x~0) (and .cse27 .cse28 (and (= 0 ~c_req_a~0) (and .cse4 .cse29) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse30)) (= ~req_tt_a~0 0) .cse23 .cse33 .cse17 .cse31) (and .cse18 (and .cse19 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse3 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse21 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse24 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_a~1 1)) .cse15 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse34) (and (and (and .cse27 .cse28 (and .cse29 .cse30)) .cse21) .cse25 (= ULTIMATE.start_m_run_~a~0 1) (= .cse35 .cse36) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse26 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse32 .cse23 .cse33 .cse34)))) [2019-01-12 15:35:06,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:35:06 BoogieIcfgContainer [2019-01-12 15:35:06,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:35:06,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:35:06,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:35:06,074 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:35:06,075 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:42" (3/4) ... [2019-01-12 15:35:06,082 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:35:06,125 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:35:06,128 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 15:35:06,167 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((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_memory2 + c_req_a == req_a___0 + 52 && 51 == x) && s_memory1 == 51) && 51 == \result) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && (((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (((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 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && i <= 1) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((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) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 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) && 0 == req_a) && m_run_pc == 6) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a)) || ((((c_req_a + 50 <= c_req_d && (((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == 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 <= 1) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 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)) || (((2 <= a && 2 <= a_t) && ((((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) && m_run_pc == 6)) || (((((((c_req_a + 50 <= c_req_d && 52 == c_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) && 2 <= a) && 2 <= a_t) && req_a == i) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && req_a == 2) && v == req_d)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && req_a == 0) && (((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && 0 <= a_t && (a <= 0 && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= 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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((a_t <= 1 && a <= 1) && (((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_t) && 1 <= a) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && (((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) && 2 <= a_t)) && 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)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && ((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 0 == c_req_type) && s_memory0 == 50) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-01-12 15:35:06,167 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((((((s_memory2 + c_req_a == req_a___0 + 52 && 51 == x) && s_memory1 == 51) && 51 == \result) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && (((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (((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 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && i <= 1) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((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) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 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) && 0 == req_a) && m_run_pc == 6) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a)) || (((((((((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)) || ((((c_req_a + 50 <= c_req_d && (((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == 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 <= 1) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 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)) || (((2 <= a && 2 <= a_t) && ((((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) && m_run_pc == 6)) || (((((((c_req_a + 50 <= c_req_d && 52 == c_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) && 2 <= a) && 2 <= a_t) && req_a == i) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && req_a == 2) && v == req_d)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1)) || (((((((((((m_run_pc <= 0 && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && req_a == 0) && (((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && 0 <= a_t && (a <= 0 && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= 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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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_t <= 1 && a <= 1) && (((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_t) && 1 <= a) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && (((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) && 2 <= a_t)) && 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)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && ((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 0 == c_req_type) && s_memory0 == 50) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) [2019-01-12 15:35:06,175 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) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && v == 52) && ((((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 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) && req_type == 0) && 0 == c_req_type) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a) || (((2 <= c_write_req_ev && 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_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && v == req_d) && ((((req_a <= 2 && req_a == i) && s_memory0 == 50) && (2 <= a && 2 <= a_t) && (2 <= c_write_req_ev && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_memory1 == 51) && 2 <= req_a)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && ((req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 2)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && (((((((((51 <= req_d && req_a == i) && a <= 1 && (2 <= c_write_req_ev && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && a_t == 1)) || ((((((c_req_a + 50 <= c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 0) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && a <= 0 && (2 <= c_write_req_ev && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_memory0 == req_d) && 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)) || (((((((((((((((s_memory0 == 50 && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 51 == rsp_d) && s_memory2 == 52) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((a_t == 0 && (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) [2019-01-12 15:35:06,177 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((50 <= c_req_d && 50 <= v) && v <= 50) && req_a == i) && (a <= 0 && c_req_a <= a) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && ((2 <= s_run_pc && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) || (s_run_pc == 0 && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev))) && req_type <= 1) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 0) || (((((((c_req_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && ((((req_a <= a_t && ((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) && 2 <= a) && req_a == i) && s_memory0 == 50) && s_memory1 == 51) && c_req_d <= c_req_a + 50) && v == 52) && req_a == 2) && v == req_d)) || (((((((2 == req_a___0 && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && ((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && s_memory0 == 50) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && ((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && 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) && a_t == 0) && 0 <= a)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((((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_tt_a == 0) && v == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a)) || (((((c_req_a + 50 <= c_req_d && ((((((((((((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) && 51 <= req_d) && req_a == i) && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && v == req_d) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && c_req_d <= c_req_a + 50) && a <= 1) && 1 <= a) && a_t == 1)) || ((((((((((((((((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) && m_run_pc == 6) && s_memory0 == 50) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 51 == rsp_d) && s_memory2 == 52) && v == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) [2019-01-12 15:35:06,179 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) || ((((((((((((((((((((50 == \result && 0 == c_req_type) && ((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) && 50 == rsp_d) && a <= 1) && v == 52) && 50 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_a___0 + 50 == rsp_d___0) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((((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) && 3 <= a) && 2 <= a_t)) || (((((((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)) || (((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && req_a <= a_t && ((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) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 0 == a)) || (((((((((((((((((((((0 == c_req_type && 51 == rsp_d) && ((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) && v == 52) && 51 == c_rsp_d) && a == 2) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((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) && 3 <= a) && 2 <= a_t) && m_run_pc == 6) [2019-01-12 15:35:06,180 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && v == 52) && a_t == 1) || (((((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) && 2 <= a_t) && m_run_pc == 6)) || (((((((((((((52 == c_rsp_d && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && 2 <= c_req_a) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((((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) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && m_run_pc == 6) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && v == 52) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((((((((((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && v == 52) && 51 == c_rsp_d) && (((((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) && m_run_pc == 6) && s_memory2 + i == req_tt_a + 52) && i <= 1) && a_t == 1)) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && ((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) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || ((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)) || ((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_type == 0 && s_memory2 + c_req_a == req_tt_a + 52) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && ((((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) && 2 <= a_t) && m_run_pc == 6) && 1 <= i) && s_memory2 == 52) && 2 <= c_req_a) && v == 52) && c_req_a <= 2) && i <= 1) [2019-01-12 15:35:06,180 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && 0 == req_type___0) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) || ((((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)) || (((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && c_req_a <= a_t && ((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) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 0 == a)) || ((((((((((((((((50 == \result && req_type == 0) && 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) && (((0 == c_req_a && (((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) && a <= 1) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory2 == 52) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) [2019-01-12 15:35:06,180 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) || (((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && (((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) && 2 <= a_t) && req_a == 2) && 0 == a)) || ((((((((((((((((50 == \result && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && ((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) && a <= 1) && 1 <= a) && 0 == req_a) && m_run_pc == 6) && 0 == req_type___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((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)) || ((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && 0 == req_type___0) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) [2019-01-12 15:35:06,186 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && ((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && (((a <= 0 && 0 <= a_t) && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && c_write_rsp_ev == 1) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((((((50 <= c_req_d && 50 <= v) && v <= 50) && req_a == 0) && s_memory0 == req_d) && ((((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && c_req_a <= a) && req_a == i) && c_write_rsp_ev == 1) && 50 <= req_d) && req_d <= 50) && a == 0) && c_req_d <= c_req_a + 50) && a_t == 0)) || ((((((c_req_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && ((((req_a <= 2 && req_a == i) && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 2 <= a) && 2 <= a_t) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && 2 <= req_a) && v == req_d)) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && a <= 1) && (((((((((51 <= req_d && req_a == i) && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && v == req_d) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && ((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 1 <= a) && c_write_rsp_ev == 1) && a_t == 1) [2019-01-12 15:35:06,186 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) || ((((((((((((((((50 == \result && req_type == 0) && 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) && s_memory2 == 52) && 50 == x) && ((0 == c_req_a && 1 <= 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) && a <= 1) && 0 == req_a) && m_run_pc == 6) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && c_req_a <= a_t && (((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) && v == 52) && req_a == 2) && 0 == a)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && (((((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) && 2 <= a) && m_run_pc == 6) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((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:35:06,186 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && ((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && (((a <= 0 && 0 <= a_t) && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && c_write_rsp_ev == 1) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((((((50 <= c_req_d && 50 <= v) && v <= 50) && req_a == 0) && s_memory0 == req_d) && ((((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && c_req_a <= a) && req_a == i) && c_write_rsp_ev == 1) && 50 <= req_d) && req_d <= 50) && a == 0) && c_req_d <= c_req_a + 50) && a_t == 0)) || ((((((c_req_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && ((((req_a <= 2 && req_a == i) && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 2 <= a) && 2 <= a_t) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && 2 <= req_a) && v == req_d)) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && a <= 1) && (((((((((51 <= req_d && req_a == i) && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && v == req_d) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && ((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 1 <= a) && c_write_rsp_ev == 1) && a_t == 1) [2019-01-12 15:35:06,187 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((50 == \result && req_type == 0) && 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) && s_memory2 == 52) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && ((0 == c_req_a && (a <= 1 && (((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) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && ((((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) && c_req_a <= a_t) && 0 == req_a___0) && 0 == req_type___0) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 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)) || (((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && s_memory2 + i == req_tt_a + 52) && (((((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) && 2 <= a) && m_run_pc == 6) && a_t == 1) [2019-01-12 15:35:06,187 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52) [2019-01-12 15:35:06,187 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((c_req_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && v == req_d) && (((((req_a <= 2 && req_a == i) && (((2 <= c_write_req_ev && 1 <= c_m_lock) && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) || (2 <= s_run_pc && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0))) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 2 <= req_a) && c_write_rsp_ev == 1) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && req_a == 0) && ((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) || (2 <= s_run_pc && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0))) && req_a == i) && s_memory0 == req_d) && c_write_rsp_ev == 1) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((((((((((((50 == \result && s_memory0 == 50) && (((0 == c_req_a && req_type == 0) && 0 == c_req_type) && (((c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && c_write_rsp_ev == 1) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((((((((s_memory2 + c_req_a == req_a___0 + 52 && 51 == x) && (((1 <= req_a___0 && s_memory0 == 50) && ((((((((c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_req_a <= 1) && c_write_rsp_ev == 1) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 51 == rsp_d) && s_memory2 == 52) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((((((req_type == 0 && 0 == c_req_type) && ((((((c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && s_memory0 == 50) && c_write_rsp_ev == 1) && 2 <= c_req_a) && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52)) || ((((((c_req_a + 50 <= c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && a <= 1) && (((((((((51 <= req_d && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) || (2 <= s_run_pc && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0))) && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && c_write_rsp_ev == 1) && 1 <= a) && a_t == 1) [2019-01-12 15:35:06,187 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52) [2019-01-12 15:35:06,189 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52) [2019-01-12 15:35:06,190 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((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) && 1 <= a_t) && 2 <= a) || (((s_memory2 == req_d && s_memory2 + c_req_a == req_a___0 + 52) && v == 52) && ((req_a <= 2 && s_memory1 == 51 && (a <= 0 && req_a == i) && (s_memory0 == 50 && 0 == c_req_type && 0 == c_req_a && 0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 == req_a___0) && 2 <= req_a) && 0 <= a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 0 <= a) && req_type == 0) && (((((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) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((a <= 0 && (((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_t) && 0 <= 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) && m_run_pc == 6) && a == 1) && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6)) || (((((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) && a <= 1) && a_t <= 0) || ((((((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) && a_t <= 1) && 1 <= a_t)) && 1 <= a)) || ((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + i == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 2 <= req_a) && c_req_a <= 2)) || ((((((2 <= c_req_a && (((((s_memory0 == 50 && ((((1 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 2 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && i <= 1) && c_req_a <= 2) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52)) || (((s_memory2 + c_req_a == req_tt_a + 52 && v == 52) && (a <= 1 && ((((1 == req_a___0 && s_memory1 == 51) && a_t == 0) && (1 <= c_req_a && s_memory0 == 50 && (req_type == 0 && ((((a_t <= 1 && 1 <= a_t) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) || ((0 <= a_t && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev)) && 0 == req_a) && m_run_pc == 6) && 0 == c_req_type) && c_req_a <= 1) || (((1 == req_a___0 && s_memory1 == 51) && (1 <= c_req_a && s_memory0 == 50 && (req_type == 0 && ((((a_t <= 1 && 1 <= a_t) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) || ((0 <= a_t && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev)) && 0 == req_a) && m_run_pc == 6) && 0 == c_req_type) && c_req_a <= 1) && req_tt_a == 1))) && 1 <= a) && a_t == 1)) || ((((s_memory2 + c_req_a == req_a___0 + 52 && v == 52) && (a <= 1 && ((((1 == req_a___0 && s_memory1 == 51) && a_t == 0) && (1 <= c_req_a && s_memory0 == 50 && (req_type == 0 && ((((a_t <= 1 && 1 <= a_t) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) || ((0 <= a_t && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev)) && 0 == req_a) && m_run_pc == 6) && 0 == c_req_type) && c_req_a <= 1) || (((1 == req_a___0 && s_memory1 == 51) && (1 <= c_req_a && s_memory0 == 50 && (req_type == 0 && ((((a_t <= 1 && 1 <= a_t) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) || ((0 <= a_t && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev)) && 0 == req_a) && m_run_pc == 6) && 0 == c_req_type) && c_req_a <= 1) && req_tt_a == 1))) && 1 <= a) && s_memory2 + i == req_tt_a + 52) && s_memory2 + req_a == req_tt_a + 52)) || ((((((((2 <= c_req_a && (((((s_memory0 == 50 && ((((1 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 2 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && i <= 1) && c_req_a <= 2) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && a == 2) && a_t == 1) [2019-01-12 15:35:06,190 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 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && ((((((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 == c_req_a) && 0 == req_a) && m_run_pc == 6) && a == 0) && 50 == x) && req_tt_a == 0) && v == 52) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((0 == c_req_type && 51 == rsp_d) && (a <= 1 && (((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) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((((((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) && req_a <= a_t) && 2 <= a) && m_run_pc == 6) && 52 == c_rsp_d) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) [2019-01-12 15:35:06,191 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)) || (((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && v == 52) && 51 == c_rsp_d) && a == 2) && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2)) || (((((((((((((req_a <= a_t && ((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) && req_a == i) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 0 == a)) || (((((((((((((((((((50 == \result && 0 == c_req_type) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 0 == req_type___0) && 50 == rsp_d) && a <= 1) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) [2019-01-12 15:35:06,196 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((s_memory0 == 50 && (((((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 2 <= req_a) && c_req_a <= 2) && 2 == req_a___0) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 52 == \result) && v == 52) && s_memory2 + i == req_tt_a + 52) && s_memory2 + req_a == req_tt_a + 52) || ((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == x) && (((((0 == c_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) && 0 == i) && 0 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && req_tt_a == 0) && v == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a)) || ((((((((((((s_memory2 + c_req_a == req_a___0 + 52 && ((1 <= c_req_a && (((((((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) && req_type == 0) && 0 == c_req_type) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && 51 == x) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 51 == \result) && req_tt_a == 1) && 1 <= a) && s_memory2 == 52) && a <= 1) && v == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) [2019-01-12 15:35:06,196 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_type___0) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && (((a <= 1 && ((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) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((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) && req_a <= a_t && ((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 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 0 == a)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && (((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2) [2019-01-12 15:35:06,197 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_type___0) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && (((a <= 1 && ((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) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && (((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2)) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && (((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) && 0 <= a_t) && v == 52) && req_a == 2) && 0 == a) [2019-01-12 15:35:06,197 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_type___0) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && (((a <= 1 && ((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) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && (((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2)) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && (((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) && 0 <= a_t) && v == 52) && req_a == 2) && 0 == a) [2019-01-12 15:35:06,197 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && v == 52) && 51 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && m_run_pc == 6) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2) || (((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_type___0) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && (0 == req_a && (a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((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 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && (((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) && 0 <= a_t) && v == 52) && req_a == 2) && 0 == a) [2019-01-12 15:35:06,197 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) [2019-01-12 15:35:06,201 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) [2019-01-12 15:35:06,201 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) [2019-01-12 15:35:06,201 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((((((rsp_d___0 == 50 && ((((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) && m_run_pc == 6) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) [2019-01-12 15:35:06,202 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) [2019-01-12 15:35:06,204 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) [2019-01-12 15:35:06,204 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) || ((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 2 <= req_a) && c_req_a <= 2) [2019-01-12 15:35:06,206 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) [2019-01-12 15:35:06,206 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) [2019-01-12 15:35:06,215 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) [2019-01-12 15:35:06,215 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) [2019-01-12 15:35:06,215 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) [2019-01-12 15:35:06,215 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) [2019-01-12 15:35:06,215 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) || ((((((((((((((((((((((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_a___0 + 50 == rsp_d___0) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((((((((((((((((((0 == c_req_type && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((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) && 2 <= a_t) && m_run_pc == 6)) || ((((((((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) && 2 <= a) && 2 <= a_t) [2019-01-12 15:35:06,408 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:35:06,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:35:06,412 INFO L168 Benchmark]: Toolchain (without parser) took 327100.18 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -334.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-12 15:35:06,413 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:35:06,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.91 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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:35:06,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:35:06,418 INFO L168 Benchmark]: Boogie Preprocessor took 83.13 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:35:06,419 INFO L168 Benchmark]: RCFGBuilder took 2154.33 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: 86.7 MB). Peak memory consumption was 86.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:35:06,419 INFO L168 Benchmark]: TraceAbstraction took 323795.37 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -318.5 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-01-12 15:35:06,419 INFO L168 Benchmark]: Witness Printer took 342.08 ms. Allocated memory is still 3.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:35:06,422 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 560.91 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 159.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.13 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 2154.33 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: 86.7 MB). Peak memory consumption was 86.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 323795.37 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -318.5 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 342.08 ms. Allocated memory is still 3.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 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: 1167]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52) - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52) - InvariantResult [Line: 1236]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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: 101]: 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: 1214]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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: 101]: 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) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 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)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 911]: Loop Invariant Derived loop invariant: ((((((((((((s_memory0 == 50 && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && v == 52) && req_tt_a == 0) && (req_type == 0 && ((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) && 0 == c_req_type) && 0 <= a) || (((((((((((s_memory0 == 50 && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (((((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory2 + req_a == req_tt_a + 52)) || (((((((((50 <= v && 51 <= req_d) && v <= 50) && s_memory0 == 50) && (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 <= a) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 1)) || (((((((((((s_memory0 == 50 && 1 <= req_a) && (((((((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) && req_type == 0) && 0 == c_req_type) && c_req_a <= 1) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && a_t == 1)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && ((((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) && 50 <= req_d) && req_d <= 50) && a_t == 0) && 0 <= a)) || ((52 == c_req_d && (((v <= 51 && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((2 <= c_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) && req_a == 2) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && 52 == req_d)) || (((((c_req_d <= 50 && 50 <= c_req_d) && c_req_a <= a_t && (a <= 0 && ((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (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) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((((((s_memory2 + c_req_a == req_a___0 + 52 && 51 == x) && s_memory1 == 51) && 51 == \result) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && (((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (((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 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && i <= 1) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((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) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 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) && 0 == req_a) && m_run_pc == 6) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a)) || (((((((((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)) || ((((c_req_a + 50 <= c_req_d && (((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == 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 <= 1) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 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)) || (((2 <= a && 2 <= a_t) && ((((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) && m_run_pc == 6)) || (((((((c_req_a + 50 <= c_req_d && 52 == c_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) && 2 <= a) && 2 <= a_t) && req_a == i) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && req_a == 2) && v == req_d)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1)) || (((((((((((m_run_pc <= 0 && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && req_a == 0) && (((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && 0 <= a_t && (a <= 0 && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= 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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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_t <= 1 && a <= 1) && (((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_t) && 1 <= a) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && (((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) && 2 <= a_t)) && 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)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && ((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 0 == c_req_type) && s_memory0 == 50) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 101]: 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: 674]: Loop Invariant Derived loop invariant: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: ((((((((((((s_memory0 == 50 && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && v == 52) && req_tt_a == 0) && (req_type == 0 && ((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) && 0 == c_req_type) && 0 <= a) || (((((((((((s_memory0 == 50 && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (((((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory2 + req_a == req_tt_a + 52)) || (((((((((50 <= v && 51 <= req_d) && v <= 50) && s_memory0 == 50) && (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 <= a) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 1)) || (((((((((((s_memory0 == 50 && 1 <= req_a) && (((((((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) && req_type == 0) && 0 == c_req_type) && c_req_a <= 1) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && a_t == 1)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && ((((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) && 50 <= req_d) && req_d <= 50) && a_t == 0) && 0 <= a)) || ((52 == c_req_d && (((v <= 51 && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((2 <= c_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) && req_a == 2) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && 52 == req_d)) || (((((c_req_d <= 50 && 50 <= c_req_d) && c_req_a <= a_t && (a <= 0 && ((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (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) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((((((((50 <= c_req_d && ((((c_req_a <= 0 && ((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) && a == 0) && c_req_d <= c_req_a + 50) && a_t == 0) || (52 == c_req_d && (((v <= 51 && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && (((2 <= 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 <= 2) && 2 <= a) && 2 <= a_t)) || ((((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory1 == 51) && req_tt_a == 1) && 1 <= a) && ((1 <= c_req_a && s_memory0 == 50) && 0 == c_req_type && (((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) && c_req_a <= 1) && s_memory2 == 52) && a <= 1) && v == 52) && a_t == 1)) || ((((((((50 <= v && v <= 50) && s_memory0 == 50) && ((((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) && 51 <= c_req_d) && c_req_d <= c_req_a + 50) && a <= 1) && 1 <= a) && a_t == 1)) || ((((((((((((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && m_run_pc == 6) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && req_tt_a == 0) && v == 52) && a_t == 0)) || ((((2 == req_a___0 && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && (((((2 <= c_req_a && s_memory0 == 50) && s_memory1 == 51) && 0 == c_req_type && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 1 <= i) && c_req_a <= 2) && i <= 1)) || ((a_t == 0 && (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) - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: ((((((((((c_req_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && v == req_d) && (((((req_a <= 2 && req_a == i) && (((2 <= c_write_req_ev && 1 <= c_m_lock) && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) || (2 <= s_run_pc && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0))) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == 51) && 2 <= req_a) && c_write_rsp_ev == 1) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && req_a == 0) && ((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && ((a <= 0 && 0 <= a_t) && a_t <= 0) && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) || (2 <= s_run_pc && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0))) && req_a == i) && s_memory0 == req_d) && c_write_rsp_ev == 1) && 50 <= req_d) && req_d <= 50) && 0 <= a)) || (((((((((((((((50 == \result && s_memory0 == 50) && (((0 == c_req_a && req_type == 0) && 0 == c_req_type) && (((c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && c_write_rsp_ev == 1) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((((((((s_memory2 + c_req_a == req_a___0 + 52 && 51 == x) && (((1 <= req_a___0 && s_memory0 == 50) && ((((((((c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 1 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_req_a <= 1) && c_write_rsp_ev == 1) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 51 == rsp_d) && s_memory2 == 52) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((((((req_type == 0 && 0 == c_req_type) && ((((((c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && s_memory0 == 50) && c_write_rsp_ev == 1) && 2 <= c_req_a) && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && 2 == req_a___0) && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52)) || ((((((c_req_a + 50 <= c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && a <= 1) && (((((((((51 <= req_d && (2 <= c_write_req_ev && 1 <= c_m_lock) && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) || (2 <= s_run_pc && (c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0))) && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && c_write_rsp_ev == 1) && 1 <= a) && a_t == 1) - InvariantResult [Line: 564]: 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)) || (((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && v == 52) && 51 == c_rsp_d) && a == 2) && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2)) || (((((((((((((req_a <= a_t && ((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) && req_a == i) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 0 == a)) || (((((((((((((((((((50 == \result && 0 == c_req_type) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 0 == req_type___0) && 50 == rsp_d) && a <= 1) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((50 <= c_req_d && ((((c_req_a <= 0 && ((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) && a == 0) && c_req_d <= c_req_a + 50) && a_t == 0) || (52 == c_req_d && (((v <= 51 && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && (((2 <= 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 <= 2) && 2 <= a) && 2 <= a_t)) || (2 <= s_run_pc && ((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory1 == 51) && req_tt_a == 1) && 1 <= a) && ((1 <= c_req_a && s_memory0 == 50) && 0 == c_req_type && (((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) && c_req_a <= 1) && s_memory2 == 52) && a <= 1) && v == 52) && a_t == 1)) || ((((((((50 <= v && v <= 50) && s_memory0 == 50) && ((((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) && 51 <= c_req_d) && c_req_d <= c_req_a + 50) && a <= 1) && 1 <= a) && a_t == 1)) || ((((((((((((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 == c_req_type) && m_run_pc == 6) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && req_tt_a == 0) && v == 52) && a_t == 0)) || ((((2 == req_a___0 && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && (((((2 <= c_req_a && s_memory0 == 50) && s_memory1 == 51) && 0 == c_req_type && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 1 <= i) && c_req_a <= 2) && i <= 1) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_type___0) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && (((a <= 1 && ((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) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((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) && req_a <= a_t && ((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 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 0 == a)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && (((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 == \result && req_type == 0) && 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) && s_memory2 == 52) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && ((0 == c_req_a && (a <= 1 && (((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) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && ((((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) && c_req_a <= a_t) && 0 == req_a___0) && 0 == req_type___0) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 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)) || (((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && s_memory2 + i == req_tt_a + 52) && (((((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) && 2 <= a) && m_run_pc == 6) && a_t == 1) - InvariantResult [Line: 494]: 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) || (((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && (((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) && 2 <= a_t) && req_a == 2) && 0 == a)) || ((((((((((((((((50 == \result && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 <= 1) && ((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) && a <= 1) && 1 <= a) && 0 == req_a) && m_run_pc == 6) && 0 == req_type___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((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)) || ((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && 0 == req_type___0) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: ((((((((2 <= s_run_st && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((s_run_pc == 0 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d) && (((((((((((1 <= c_req_type && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 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 == a)) || (((((((((((((((((((((((((1 <= c_req_type && req_a == i) && c_req_type <= 1) && req_d == 52) && s_memory1 == req_d) && req_d <= 51) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && req_d <= req_a + 50) && 1 <= req_type) && 52 == c_req_d) && 51 <= req_d) && c_req_d <= c_req_a + 50) && c_req_a <= a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && req_a <= 2) && a <= 2) && v == req_d) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && s_memory0 == req_d) && 51 <= req_d) && ((((((((((((1 <= c_req_type && 1 <= req_a) && c_req_type <= 1) && 2 <= s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 1 <= a) && 50 <= req_d) && c_req_a + 50 <= c_req_d) && a <= 1) && req_a == 0) && c_req_d <= 51) && a_t == 0) && req_d <= 51) && req_d <= 50)) || (((((((((((((((((1 <= c_req_type && m_run_pc <= 0) && c_req_type <= 1) && c_empty_rsp == 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 0 <= req_a) && req_d <= 50) && s_run_pc == 0) && req_a <= a) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 0 <= c_req_a) && a_t == 0) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a) - InvariantResult [Line: 1263]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((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)) || (((((((((((((((((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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((a_t <= 1 && a <= 1) && (((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_t) && 1 <= a) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && (((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) && 2 <= a_t)) && 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)) || (((2 <= a && 2 <= a_t) && ((((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) && 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)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1) - InvariantResult [Line: 747]: Loop Invariant Derived loop invariant: ((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) || ((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && ((0 == c_req_a && ((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 == req_a) && m_run_pc == 6) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 1271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((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)) || (((((((((((((((((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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((a_t <= 1 && a <= 1) && (((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_t) && 1 <= a) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && (((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) && 2 <= a_t)) && 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)) || (((2 <= a && 2 <= a_t) && ((((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) && 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)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1) - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: ((((((((((((s_memory0 == 50 && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && v == 52) && req_tt_a == 0) && (req_type == 0 && ((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) && 0 == c_req_type) && 0 <= a) || (((((((((((s_memory0 == 50 && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (((((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory2 + req_a == req_tt_a + 52)) || (((((((((50 <= v && 51 <= req_d) && v <= 50) && s_memory0 == 50) && (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 <= a) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 1)) || (((((((((((s_memory0 == 50 && 1 <= req_a) && (((((((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) && req_type == 0) && 0 == c_req_type) && c_req_a <= 1) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && a_t == 1)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && ((((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) && 50 <= req_d) && req_d <= 50) && a_t == 0) && 0 <= a)) || ((52 == c_req_d && (((v <= 51 && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((2 <= c_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) && req_a == 2) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && 52 == req_d)) || (((((c_req_d <= 50 && 50 <= c_req_d) && c_req_a <= a_t && (a <= 0 && ((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (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) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((((((((((((((((req_type == 0 && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && ((((((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 == c_req_a) && 0 == req_a) && m_run_pc == 6) && a == 0) && 50 == x) && req_tt_a == 0) && v == 52) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((0 == c_req_type && 51 == rsp_d) && (a <= 1 && (((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) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((((((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) && req_a <= a_t) && 2 <= a) && m_run_pc == 6) && 52 == c_rsp_d) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((s_memory0 == 50 && (((((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 2 <= req_a) && c_req_a <= 2) && 2 == req_a___0) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 52 == \result) && v == 52) && s_memory2 + i == req_tt_a + 52) && s_memory2 + req_a == req_tt_a + 52) || ((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == x) && (((((0 == c_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) && 0 == i) && 0 == req_a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && req_tt_a == 0) && v == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a)) || ((((((((((((s_memory2 + c_req_a == req_a___0 + 52 && ((1 <= c_req_a && (((((((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) && req_type == 0) && 0 == c_req_type) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 1) && 51 == x) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 51 == \result) && req_tt_a == 1) && 1 <= a) && s_memory2 == 52) && a <= 1) && v == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((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) || (((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 51 <= req_d) && 50 <= req_d) && req_a <= a && 1 <= req_a && ((((2 <= c_write_req_ev && 2 <= s_run_st) && 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) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a <= 1) && req_a == 0) && a_t == 0) && req_d <= 51) && req_d <= 50)) || (((((((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 0 <= req_a) && req_d <= 50) && s_run_pc == 0) && req_a <= a) && 0 == c_req_a) && 2 <= c_write_req_ev) && a_t == 0) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a)) || ((((((0 == c_req_type && ((((((((2 <= c_write_req_ev && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == c_req_a) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d) && 0 == a)) || (((((((((((((((51 <= req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && req_d == 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && c_req_a + 50 <= c_req_d) && (2 <= req_a && ((((2 <= c_write_req_ev && 2 <= s_run_st) && 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) && req_a <= 2) && c_req_d <= 51) && v == req_d) && a == 2) && a_t == 1)) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((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) && 52 == c_req_d) && 51 <= req_d) && req_a == i) && c_req_d <= c_req_a + 50) && req_a + 50 <= req_d) && s_memory0 == 50) && req_d == 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && c_req_a + 50 <= c_req_d) && v == req_d) && req_d <= req_a + 50) && a == 2) && a_t == 1) || ((((((((((((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)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d) && (((((((((((1 <= c_req_type && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 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 == a)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && s_memory0 == req_d) && 51 <= req_d) && 50 <= req_d) && c_req_a + 50 <= c_req_d) && a <= 1) && req_a == 0) && c_req_d <= 51) && a_t == 0) && (((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 <= a) && req_d <= 51) && req_d <= 50)) || (((((((((((((((((1 <= c_req_type && m_run_pc <= 0) && c_req_type <= 1) && c_empty_rsp == 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 0 <= req_a) && req_d <= 50) && s_run_pc == 0) && req_a <= a) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 0 <= c_req_a) && a_t == 0) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((s_memory0 == 50 && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && v == 52) && req_tt_a == 0) && (req_type == 0 && ((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) && 0 == c_req_type) && 0 <= a) || (((((((((((s_memory0 == 50 && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (((((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory2 + req_a == req_tt_a + 52)) || (((((((((50 <= v && 51 <= req_d) && v <= 50) && s_memory0 == 50) && (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 <= a) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 1)) || (((((((((((s_memory0 == 50 && 1 <= req_a) && (((((((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) && req_type == 0) && 0 == c_req_type) && c_req_a <= 1) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && a_t == 1)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && ((((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) && 50 <= req_d) && req_d <= 50) && a_t == 0) && 0 <= a)) || ((52 == c_req_d && (((v <= 51 && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((2 <= c_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) && req_a == 2) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && 52 == req_d)) || (((((c_req_d <= 50 && 50 <= c_req_d) && c_req_a <= a_t && (a <= 0 && ((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (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) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 485]: 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) || ((((((((((((((((((((50 == \result && 0 == c_req_type) && ((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) && 50 == rsp_d) && a <= 1) && v == 52) && 50 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_a___0 + 50 == rsp_d___0) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((((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) && 3 <= a) && 2 <= a_t)) || (((((((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)) || (((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && req_a <= a_t && ((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) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 0 == a)) || (((((((((((((((((((((0 == c_req_type && 51 == rsp_d) && ((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) && v == 52) && 51 == c_rsp_d) && a == 2) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((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) && 3 <= a) && 2 <= a_t) && m_run_pc == 6) - InvariantResult [Line: 397]: 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) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && ((((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && 1 <= a) && c_req_a + 50 <= c_req_d) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && (((((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) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50)) || ((((((((((52 == c_req_d && req_a == i) && (req_a <= a_t && (((((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) && 2 <= a) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && v == 52) && ((((0 == c_req_a && a <= 0 && ((2 <= c_write_req_ev && 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) && req_type == 0) && 0 == c_req_type) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a) || (((2 <= c_write_req_ev && 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_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && v == req_d) && ((((req_a <= 2 && req_a == i) && s_memory0 == 50) && (2 <= a && 2 <= a_t) && (2 <= c_write_req_ev && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_memory1 == 51) && 2 <= req_a)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && ((req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && s_memory0 == 50) && c_req_a <= 2)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && (((((((((51 <= req_d && req_a == i) && a <= 1 && (2 <= c_write_req_ev && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == req_d) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && a_t == 1)) || ((((((c_req_a + 50 <= c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 0) && ((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && a <= 0 && (2 <= c_write_req_ev && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_memory0 == req_d) && 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)) || (((((((((((((((s_memory0 == 50 && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 51 == rsp_d) && s_memory2 == 52) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((a_t == 0 && (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) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && ((((((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) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) || ((((((((((((((((((((((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) && 51 <= req_d) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || ((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= 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) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_type___0) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && (((a <= 1 && ((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) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && (((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2)) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && (((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) && 0 <= a_t) && v == 52) && req_a == 2) && 0 == a) - InvariantResult [Line: 1351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && ((((((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) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) || ((((((((((((((((((((((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) && 51 <= req_d) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || ((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= 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) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_type___0) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && (((a <= 1 && ((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) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && (((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2)) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && (((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) && 0 <= a_t) && v == 52) && req_a == 2) && 0 == a) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (((((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) && c_req_a <= a_t) && 2 <= a) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) || (((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a <= 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) && req_a == 0) && a_t == 0) && 0 <= a) && req_d <= 50)) || (((((((((((((51 <= req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && c_req_a + 50 <= c_req_d) && c_req_d <= 51) && v == req_d) && (a <= 1 && (((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) && a_t == 1) - InvariantResult [Line: 829]: 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) || ((((((((((((((((((((((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_a___0 + 50 == rsp_d___0) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((((((((((((((((((0 == c_req_type && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((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) && 2 <= a_t) && m_run_pc == 6)) || ((((((((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) && 2 <= a) && 2 <= a_t) - InvariantResult [Line: 1279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((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)) || (((((((((((((((((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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((a_t <= 1 && a <= 1) && (((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_t) && 1 <= a) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && (((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) && 2 <= a_t)) && 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)) || (((2 <= a && 2 <= a_t) && ((((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) && 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)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1) - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((((((((((((s_run_pc == 0 && a <= 0) && c_empty_req == 1) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a) || (((((((((((((((51 <= req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && req_d == 52) && s_memory1 == req_d) && req_d <= 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_empty_rsp == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && s_run_pc == 2) && 1 <= req_type) && 2 <= req_a) && req_a <= 2) && c_req_a + 50 <= c_req_d) && c_req_d <= 51) && v == req_d) && a == 2) && a_t == 1)) || ((((((0 == c_req_type && ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_type <= 1) && 1 <= req_type) && 0 == c_req_a) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d) && 0 == a)) || (((((((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && c_empty_req == 1) && req_type <= 1) && 1 <= req_type) && 0 <= req_a) && req_d <= 50) && s_run_pc == 0) && req_a <= a) && 0 == c_req_a) && 2 <= c_write_req_ev) && a_t == 0) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && (a <= 1 && req_a <= 1 && ((((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) && req_type <= 1) && s_run_pc == 2) && 1 <= req_type) && 1 <= a) && s_memory0 == req_d) && 51 <= req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && req_a == 0) && a_t == 0) && req_d <= req_a + 50) && req_d <= 50) - InvariantResult [Line: 1287]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((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)) || (((((((((((((((((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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((a_t <= 1 && a <= 1) && 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) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && 2 <= 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)) && 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)) || (((2 <= a && 2 <= a_t) && ((((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) && 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)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 965]: Loop Invariant Derived loop invariant: ((((((((((((s_memory0 == 50 && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && v == 52) && req_tt_a == 0) && (req_type == 0 && ((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) && 0 == c_req_type) && 0 <= a) || (((((((((((s_memory0 == 50 && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (((((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory2 + req_a == req_tt_a + 52)) || (((((((((50 <= v && 51 <= req_d) && v <= 50) && s_memory0 == 50) && (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 <= a) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 1)) || (((((((((((s_memory0 == 50 && 1 <= req_a) && (((((((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) && req_type == 0) && 0 == c_req_type) && c_req_a <= 1) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && a_t == 1)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && ((((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) && 50 <= req_d) && req_d <= 50) && a_t == 0) && 0 <= a)) || ((52 == c_req_d && (((v <= 51 && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((2 <= c_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) && req_a == 2) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && 52 == req_d)) || (((((c_req_d <= 50 && 50 <= c_req_d) && c_req_a <= a_t && (a <= 0 && ((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (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) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: ((((c_req_d <= c_req_a + 50 && req_a == 0) && ((((((50 <= c_req_d && 50 <= v) && v <= 50) && req_a == i) && (((a <= 0 && 0 <= a_t) && c_req_a <= a) && a_t <= 0) && ((((((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) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) || (((((((((((((51 <= req_d && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && v == req_d) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && (a <= 1 && (((((((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) && 1 <= a) && c_req_a + 50 <= c_req_d) && req_a == i) && c_req_d <= c_req_a + 50) && a_t == 1)) || ((((((c_req_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && v == req_d) && ((((req_a <= 2 && req_a == i) && s_memory0 == 50) && s_memory1 == 51) && (((((((((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) && 2 <= a) && 2 <= a_t) && 2 <= req_a)) || ((((((c_req_a + 50 <= c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 0) && ((((((c_req_d <= 50 && a <= 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 <= c_req_d) && 50 <= v) && v <= 50) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((s_memory0 == 50 && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && v == 52) && req_tt_a == 0) && (req_type == 0 && ((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) && 0 == c_req_type) && 0 <= a) || (((((((((((s_memory0 == 50 && s_memory1 == 51) && 1 <= i) && 2 <= req_a) && (((((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory2 + req_a == req_tt_a + 52)) || (((((((((50 <= v && 51 <= req_d) && v <= 50) && s_memory0 == 50) && (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 <= a) && req_d <= 51) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 1)) || (((((((((((s_memory0 == 50 && 1 <= req_a) && (((((((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) && req_type == 0) && 0 == c_req_type) && c_req_a <= 1) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && a_t == 1)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && a <= 0 && ((((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) && 50 <= req_d) && req_d <= 50) && a_t == 0) && 0 <= a)) || ((52 == c_req_d && (((v <= 51 && s_memory0 == 50) && s_memory1 == 51) && 51 <= v) && ((((2 <= c_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) && req_a == 2) && c_req_a <= 2) && 2 <= a) && 2 <= a_t) && 52 == req_d)) || (((((c_req_d <= 50 && 50 <= c_req_d) && c_req_a <= a_t && (a <= 0 && ((((2 <= c_write_req_ev && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (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) && a_t <= 0) && 50 <= req_d) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((s_memory0 == 50 && s_memory1 == 51) && (req_type == 0 && (0 == c_req_a && ((((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 == c_req_type) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((s_memory0 == 50 && (((((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 2 <= req_a) && c_req_a <= 2) && 2 == req_a___0) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory2 + i == req_tt_a + 52) && s_memory2 + req_a == req_tt_a + 52)) || ((((((((s_memory2 + c_req_a == req_a___0 + 52 && 51 == x) && s_memory1 == 51) && s_memory2 == 52) && a <= 1) && v == 52) && ((((((1 <= c_req_a && ((((((((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) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 1) && i <= 1) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: (((((((((((((((((rsp_d___0 == 50 && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && ((0 == c_req_a && 0 == req_a) && (((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) && m_run_pc == 6) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= a) && ((((((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_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) || (((((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) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && ((((((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) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && ((((((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 <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((2 <= s_run_st && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= a) || (((((0 <= a_t && a <= 1) && a_t <= 0) && ((2 <= s_run_st && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) || ((a_t <= 1 && 1 <= a_t) && ((2 <= s_run_st && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev)) && 1 <= a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((0 <= a_t && a <= 0 && ((2 <= s_run_st && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 230]: 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)) || (((((((((((((51 <= req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && req_d == 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && (((2 <= c_req_a && 2 <= req_a) && ((((((1 <= c_req_type && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_a <= 2) && c_req_a <= a) && c_req_a + 50 <= c_req_d) && v == req_d) && a == 2) && a_t == 1)) || (((((((((s_run_pc == 0 && c_req_type <= 1) && c_req_d <= 50) && 50 <= c_req_d) && (((((((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_type <= 1) && 1 <= c_m_lock) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= s_run_st && c_req_type <= 1) && (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) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_a <= a) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d) && 0 == a)) || (((((((((((((((((((((((1 <= c_req_type && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= v) && req_a == i) && s_memory0 == req_d) && a <= 1) && req_a == 0) && req_d <= req_a + 50) && req_a <= a) && v <= 50) && c_req_d <= c_req_a + 50) && 51 <= c_req_d) && 51 <= req_d) && 50 <= req_d) && c_req_a + 50 <= c_req_d) && c_req_d <= 51) && a_t == 0) && req_d <= 50) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && ((((((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) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) || ((((((((((((((((((((((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) && 51 <= req_d) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || ((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= 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) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && 2 <= c_req_a) && v == 52) && 51 == c_rsp_d) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && ((((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a) && m_run_pc == 6) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && s_memory2 + i == req_tt_a + 52) && a_t == 1) && c_req_a <= 2) || (((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_type___0) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && (0 == req_a && (a <= 1 && ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 1 <= a) && m_run_pc == 6) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((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 == 51) && 0 == req_a___0) && 0 == req_type___0) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && (((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) && 0 <= a_t) && v == 52) && req_a == 2) && 0 == a) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((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_memory2 + c_req_a == req_a___0 + 52 && 51 == x) && s_memory1 == 51) && 51 == \result) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && (((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && (((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 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && i <= 1) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((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) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 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) && 0 == req_a) && m_run_pc == 6) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a)) || ((((c_req_a + 50 <= c_req_d && (((((((((51 <= req_d && req_a == i) && s_memory0 == 50) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && v == 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 <= 1) && 51 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && a_t == 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)) || (((2 <= a && 2 <= a_t) && ((((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) && m_run_pc == 6)) || (((((((c_req_a + 50 <= c_req_d && 52 == c_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) && 2 <= a) && 2 <= a_t) && req_a == i) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && req_a == 2) && v == req_d)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && req_a == 0) && (((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && 0 <= a_t && (a <= 0 && a_t <= 0) && (((2 <= c_write_req_ev && 2 <= s_run_st) && ((c_empty_req == 1 && m_run_pc == 3) && m_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= 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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((a_t <= 1 && a <= 1) && (((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_t) && 1 <= a) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && (((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) && 2 <= a_t)) && 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)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && ((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 0 == c_req_type) && s_memory0 == 50) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && ((((((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) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) || ((((((((((((((((((((((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) && 51 <= req_d) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || ((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= 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) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) - InvariantResult [Line: 1317]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((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)) || (((((((((((((((((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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((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) && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= a) || (((0 <= a_t && a_t <= 0) && a <= 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)) || (((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) && 2 <= a) && 2 <= a_t)) && 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)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((2 <= a && 2 <= a_t) && (2 <= c_write_req_ev && ((c_empty_req == 1 && 2 <= s_run_st) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2) && m_run_pc == 6)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1) - InvariantResult [Line: 246]: 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)) || (((((((((((((51 <= req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && req_d == 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && (((2 <= c_req_a && 2 <= req_a) && ((((((1 <= c_req_type && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_a <= 2) && c_req_a <= a) && c_req_a + 50 <= c_req_d) && v == req_d) && a == 2) && a_t == 1)) || (((((((((s_run_pc == 0 && c_req_type <= 1) && c_req_d <= 50) && 50 <= c_req_d) && (((((((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_type <= 1) && 1 <= c_m_lock) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= s_run_st && c_req_type <= 1) && (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) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_a <= a) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d) && 0 == a)) || (((((((((((((((((((((((1 <= c_req_type && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= v) && req_a == i) && s_memory0 == req_d) && a <= 1) && req_a == 0) && req_d <= req_a + 50) && req_a <= a) && v <= 50) && c_req_d <= c_req_a + 50) && 51 <= c_req_d) && 51 <= req_d) && 50 <= req_d) && c_req_a + 50 <= c_req_d) && c_req_d <= 51) && a_t == 0) && req_d <= 50) - InvariantResult [Line: 1295]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((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)) || (((((((((((((((((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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((a_t <= 1 && a <= 1) && 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) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && 2 <= 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)) && 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)) || (((2 <= a && 2 <= a_t) && ((((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) && 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)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && c_req_d <= 50) && 50 <= c_req_d) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && req_d <= req_a + 50) && 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: 728]: Loop Invariant Derived loop invariant: ((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && ((((((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) && a <= 1) && 1 <= a) && m_run_pc == 6) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((req_a <= a_t && (((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) && 2 <= a) && m_run_pc == 6) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((((((rsp_d___0 == 50 && ((((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) && m_run_pc == 6) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) - InvariantResult [Line: 238]: 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)) || (((((((((((((51 <= req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && req_d == 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && (((2 <= c_req_a && 2 <= req_a) && ((((((1 <= c_req_type && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_a <= 2) && c_req_a <= a) && c_req_a + 50 <= c_req_d) && v == req_d) && a == 2) && a_t == 1)) || (((((((((s_run_pc == 0 && c_req_type <= 1) && c_req_d <= 50) && 50 <= c_req_d) && (((((((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_type <= 1) && 1 <= c_m_lock) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d)) || ((((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= s_run_st && c_req_type <= 1) && (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) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_a <= a) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d) && 0 == a)) || (((((((((((((((((((((((1 <= c_req_type && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 1 <= req_type) && 2 <= s_run_st) && c_req_type <= 1) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && 50 <= v) && req_a == i) && s_memory0 == req_d) && a <= 1) && req_a == 0) && req_d <= req_a + 50) && req_a <= a) && v <= 50) && c_req_d <= c_req_a + 50) && 51 <= c_req_d) && 51 <= req_d) && 50 <= req_d) && c_req_a + 50 <= c_req_d) && c_req_d <= 51) && a_t == 0) && req_d <= 50) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 1182]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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: 414]: Loop Invariant Derived loop invariant: ((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= a) && ((((((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_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) || (((((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) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && ((((((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) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && ((((((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 <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((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) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && v == 52) && a_t == 1) || (((((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) && 2 <= a_t) && m_run_pc == 6)) || (((((((((((((52 == c_rsp_d && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && ((((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && 2 <= c_req_a) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((((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) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && m_run_pc == 6) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && v == 52) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((((((((((((((((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 51 == rsp_d) && 1 <= c_req_a) && s_memory2 == 52) && v == 52) && 51 == c_rsp_d) && (((((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) && m_run_pc == 6) && s_memory2 + i == req_tt_a + 52) && i <= 1) && a_t == 1)) || ((((((((((((req_a == i && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == 52) && s_memory2 == req_d) && ((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) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || ((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)) || ((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_type == 0 && s_memory2 + c_req_a == req_tt_a + 52) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && ((((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) && 2 <= a_t) && m_run_pc == 6) && 1 <= i) && s_memory2 == 52) && 2 <= c_req_a) && v == 52) && c_req_a <= 2) && i <= 1) - InvariantResult [Line: 528]: 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) || ((((((((((((((((50 == \result && req_type == 0) && 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) && s_memory2 == 52) && 50 == x) && ((0 == c_req_a && 1 <= 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) && a <= 1) && 0 == req_a) && m_run_pc == 6) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 0 == req_type___0) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && c_req_a <= a_t && (((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) && v == 52) && req_a == 2) && 0 == a)) || ((((((((((((((((((((0 == c_req_type && 0 == req_type___0) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && (((((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) && 2 <= a) && m_run_pc == 6) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((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: 1190]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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: 422]: Loop Invariant Derived loop invariant: ((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= a) && ((((((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_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) || (((((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) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && ((((((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) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && ((((((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 <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((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) && m_run_pc == 6) && 0 == c_req_type) && 0 == req_type___0) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && a == 2) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && s_memory2 + i == req_tt_a + 52) && a_t == 1) || ((((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)) || (((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && c_req_a <= a_t && ((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) && c_req_a + 50 <= c_req_d) && s_memory2 == 52) && s_memory2 == req_d) && v == 52) && req_a == 2) && 0 == a)) || ((((((((((((((((50 == \result && req_type == 0) && 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) && (((0 == c_req_a && (((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) && a <= 1) && 0 == req_a) && 1 <= a) && m_run_pc == 6) && s_memory2 == 52) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: ((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && ((((((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) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) || ((((((((((((((((((((((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) && 51 <= req_d) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || ((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= 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) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && ((((((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) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) || ((((((((((((((((((((((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) && 51 <= req_d) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || ((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= 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) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) - InvariantResult [Line: 101]: 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: 1113]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((2 <= 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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && c_req_a <= 2) && i <= 1) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) || ((((((((((51 <= req_d && req_a == i) && ((((((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 <= 2) && 2 <= a) && 2 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1) && 52 == c_req_d) && c_req_d <= c_req_a + 50)) || ((((((((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)) || (((((((((((((((((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_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && s_memory2 == req_d) && req_tt_a == 0) && v == 52) && req_a == 2) && a_t == 0)) || ((((c_empty_req == 1 && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((((s_memory2 + c_req_a == req_a___0 + 52 && s_memory2 + c_req_a == req_tt_a + 52) && v == 52) && s_memory1 == 51) && ((1 <= c_req_a && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (((((2 <= c_write_req_ev && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && a <= 1) && 0 == req_a) && m_run_pc == 6) && c_req_a <= 1) && req_tt_a == 1) && 1 <= a) && a_t == 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)) || ((((50 <= c_req_d && a <= 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) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || ((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)) || ((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((a_t <= 1 && a <= 1) && (((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_t) && 1 <= a) || ((0 <= a_t && (a <= 0 && 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)) || ((2 <= a && (((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) && 2 <= a_t)) && 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)) || (((2 <= a && 2 <= a_t) && ((((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) && 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)) || (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((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) && 50 <= v) && v <= 50) && req_a == i) && c_req_d <= 51) && s_memory0 == req_d) && 51 <= c_req_d) && 50 <= req_d) && req_d <= 50) && c_req_a + 50 <= c_req_d) && a == 1) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 1) - InvariantResult [Line: 101]: 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: 638]: Loop Invariant Derived loop invariant: (((((((((((((((((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) && 1 <= a_t) && 2 <= a) || (((s_memory2 == req_d && s_memory2 + c_req_a == req_a___0 + 52) && v == 52) && ((req_a <= 2 && s_memory1 == 51 && (a <= 0 && req_a == i) && (s_memory0 == 50 && 0 == c_req_type && 0 == c_req_a && 0 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 == req_a___0) && 2 <= req_a) && 0 <= a)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && v == 52) && 50 == c_rsp_d) && 0 <= a) && req_type == 0) && (((((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) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || (((a <= 0 && (((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_t) && 0 <= 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) && m_run_pc == 6) && a == 1) && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6)) || (((((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) && a <= 1) && a_t <= 0) || ((((((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) && a_t <= 1) && 1 <= a_t)) && 1 <= a)) || ((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + i == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && 2 <= req_a) && c_req_a <= 2)) || ((((((2 <= c_req_a && (((((s_memory0 == 50 && ((((1 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 2 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && i <= 1) && c_req_a <= 2) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && v == 52)) || (((s_memory2 + c_req_a == req_tt_a + 52 && v == 52) && (a <= 1 && ((((1 == req_a___0 && s_memory1 == 51) && a_t == 0) && (1 <= c_req_a && s_memory0 == 50 && (req_type == 0 && ((((a_t <= 1 && 1 <= a_t) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) || ((0 <= a_t && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev)) && 0 == req_a) && m_run_pc == 6) && 0 == c_req_type) && c_req_a <= 1) || (((1 == req_a___0 && s_memory1 == 51) && (1 <= c_req_a && s_memory0 == 50 && (req_type == 0 && ((((a_t <= 1 && 1 <= a_t) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) || ((0 <= a_t && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev)) && 0 == req_a) && m_run_pc == 6) && 0 == c_req_type) && c_req_a <= 1) && req_tt_a == 1))) && 1 <= a) && a_t == 1)) || ((((s_memory2 + c_req_a == req_a___0 + 52 && v == 52) && (a <= 1 && ((((1 == req_a___0 && s_memory1 == 51) && a_t == 0) && (1 <= c_req_a && s_memory0 == 50 && (req_type == 0 && ((((a_t <= 1 && 1 <= a_t) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) || ((0 <= a_t && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev)) && 0 == req_a) && m_run_pc == 6) && 0 == c_req_type) && c_req_a <= 1) || (((1 == req_a___0 && s_memory1 == 51) && (1 <= c_req_a && s_memory0 == 50 && (req_type == 0 && ((((a_t <= 1 && 1 <= a_t) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) || ((0 <= a_t && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev)) && 0 == req_a) && m_run_pc == 6) && 0 == c_req_type) && c_req_a <= 1) && req_tt_a == 1))) && 1 <= a) && s_memory2 + i == req_tt_a + 52) && s_memory2 + req_a == req_tt_a + 52)) || ((((((((2 <= c_req_a && (((((s_memory0 == 50 && ((((1 <= a_t && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 2 <= a) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && i <= 1) && c_req_a <= 2) && 2 == req_a___0) && s_memory2 + c_req_a == req_a___0 + 52) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && a == 2) && a_t == 1) - InvariantResult [Line: 810]: Loop Invariant Derived loop invariant: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: (((((((((((((((((((rsp_d___0 == 50 && (((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) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 50 == rsp_d) && 0 == req_a___0) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && 50 == c_rsp_d) && req_tt_a == 0) && s_memory2 + i == req_tt_a + 52) && a_t == 0) || (((((((((((((((52 == c_rsp_d && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && ((req_type == 0 && 0 == c_req_type) && s_memory0 == 50) && (((((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) && 2 <= a_t) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && req_a <= 2) && 52 == x) && 52 == rsp_d) && 52 == \result) && v == 52) && rsp_d___0 == 52) && s_memory2 + i == req_tt_a + 52) && 2 <= req_a) && c_req_a <= 2)) || (((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && 51 == rsp_d) && v == 52) && 51 == c_rsp_d) && 1 == req_a___0) && ((a <= 1 && ((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) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 51 == \result) && req_a <= 1) && s_memory2 + req_a == req_tt_a + 52) && 1 <= i) && c_req_a <= 1) && 1 <= c_req_a) && s_memory2 == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 1033]: Loop Invariant Derived loop invariant: ((((((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && ((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && (((a <= 0 && 0 <= a_t) && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && c_write_rsp_ev == 1) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((((((50 <= c_req_d && 50 <= v) && v <= 50) && req_a == 0) && s_memory0 == req_d) && ((((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && c_req_a <= a) && req_a == i) && c_write_rsp_ev == 1) && 50 <= req_d) && req_d <= 50) && a == 0) && c_req_d <= c_req_a + 50) && a_t == 0)) || ((((((c_req_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && ((((req_a <= 2 && req_a == i) && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 2 <= a) && 2 <= a_t) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && 2 <= req_a) && v == req_d)) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && a <= 1) && (((((((((51 <= req_d && req_a == i) && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && v == req_d) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && ((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 1 <= a) && c_write_rsp_ev == 1) && a_t == 1) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 0 && a <= 0) && m_run_pc <= 0) && req_a <= 0) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 2 <= s_run_st) && 1 <= req_type) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a) || ((((((((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && c_empty_req == 1) && req_type <= 1) && 1 <= req_type) && c_m_lock <= 0) && 0 <= req_a) && req_d <= 50) && s_run_pc == 0) && req_a <= a) && 0 == c_req_a) && 2 <= c_write_req_ev) && a_t == 0) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a)) || ((((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && req_a <= 1 && (((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) && s_memory0 == req_d) && 51 <= req_d) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a <= 1) && req_a == 0) && a_t == 0) && req_d <= req_a + 50) && req_d <= 50)) || (((((((((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= s_run_st) && req_type <= 1) && s_run_pc == 2) && 1 <= req_type) && c_m_lock <= 0) && 0 <= req_a) && req_d <= 50) && req_a <= a) && 0 == c_req_a) && 2 <= c_write_req_ev) && a_t == 0) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a)) || (((((((((((((((51 <= req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && req_d == 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && c_req_a + 50 <= c_req_d) && (2 <= 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) && req_a <= 2) && c_req_d <= 51) && v == req_d) && a == 2) && a_t == 1)) || ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 0 && 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) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || (((50 <= c_req_d && ((((c_req_a <= 0 && ((1 <= c_req_type && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_d <= c_req_a + 50) && a_t == 0)) || (((((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) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && (((((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) && 2 <= c_req_a) && c_req_a <= 2) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && c_req_a + 50 <= c_req_d) && v == req_d) && 2 <= a_t)) || (((((((((((((51 <= req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 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_a + 50 <= c_req_d) && c_req_d <= 51) && v == req_d) && a_t == 1)) || ((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && (((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && req_a == 0) && a_t == 0) && req_d <= 50)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((50 <= v && v <= 50) && req_a == i) && s_memory0 == req_d) && 50 <= 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 + 50 <= c_req_d) && req_a == 0) && c_req_d <= 51) && req_d <= 50) && a_t == 1)) || (((2 <= c_write_req_ev && 2 <= s_run_st) && (m_run_pc == 3 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && s_run_pc == 2)) || (((((((((((((((((c_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_a <= a_t) && 52 == c_req_d) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_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) - InvariantResult [Line: 178]: 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) || ((((((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 51 <= req_d) && 1 <= a) && 50 <= req_d) && (req_a <= 1 && 1 <= req_a) && (((((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((c_empty_req == 1 && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= req_type) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a <= 1) && req_a == 0) && a_t == 0) && req_d <= 51) && req_d <= 50)) || (((((((((((((((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((c_empty_req == 1 && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= req_type) && 51 <= req_d) && req_a == i) && c_req_d <= c_req_a + 50) && req_a + 50 <= req_d) && s_memory0 == 50) && req_d == 52) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && c_req_a + 50 <= c_req_d) && c_req_d <= 51) && v == req_d) && req_d <= req_a + 50) && a == 2) && a_t == 1)) || ((((((((((((((((m_run_pc <= 0 && 0 == c_req_type) && c_empty_rsp == 1) && c_empty_req == 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 0 <= req_a) && req_d <= 50) && s_run_pc == 0) && req_a <= a) && 0 == c_req_a) && 2 <= c_write_req_ev) && a_t == 0) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 == a)) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((0 == c_req_type && 0 == c_req_a) && (((((((((m_run_pc <= 0 && req_a <= 0) && c_empty_rsp == 1) && c_empty_req == 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) && a_t == 0) && req_d <= req_a + 50) && 50 <= req_d) && 0 == a) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((((((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && ((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && (((a <= 0 && 0 <= a_t) && a_t <= 0) && ((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && c_write_rsp_ev == 1) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && 0 <= a) || ((((((((((((((((((((((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && 50 == \result) && s_memory2 + c_req_a == req_tt_a + 52) && s_memory0 == 50) && s_memory1 == 51) && s_memory2 + req_a == req_tt_a + 52) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && a == 0) && 50 == x) && v == 52) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 0)) || ((((((((((50 <= c_req_d && 50 <= v) && v <= 50) && req_a == 0) && s_memory0 == req_d) && ((((((((1 <= c_req_type && ((s_run_pc == 0 && (c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) || (((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= s_run_pc))) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && c_req_a <= a) && req_a == i) && c_write_rsp_ev == 1) && 50 <= req_d) && req_d <= 50) && a == 0) && c_req_d <= c_req_a + 50) && a_t == 0)) || ((((((c_req_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && c_req_d <= c_req_a + 50) && v == 52) && ((((req_a <= 2 && req_a == i) && (((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 2 <= a) && 2 <= a_t) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && 2 <= req_a) && v == req_d)) || ((((((((((((((((s_memory0 == 50 && (((req_type == 0 && 0 == c_req_type) && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && m_run_pc == 6) && c_write_rsp_ev == 1) && s_memory2 + c_req_a == req_a___0 + 52) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && s_memory2 == 52) && a <= 1) && v == 52) && 51 == c_rsp_d) && s_memory2 + i == req_tt_a + 52) && a_t == 1)) || ((((((((2 == req_a___0 && 52 == c_rsp_d) && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && ((((((2 <= c_req_a && req_a <= 2) && ((((((2 <= a && ((2 <= c_write_req_ev && c_empty_req == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= a_t) && m_run_pc == 6) && req_type == 0) && 0 == c_req_type) && c_write_rsp_ev == 1) && s_memory0 == 50) && s_memory1 == 51) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2) && s_memory2 + req_a == req_tt_a + 52)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && a <= 1) && (((((((((51 <= req_d && req_a == i) && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && v == req_d) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && ((((2 <= c_write_req_ev && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_req == 1 && m_run_pc == 3) && 1 <= a) && c_write_rsp_ev == 1) && a_t == 1) - InvariantResult [Line: 1000]: Loop Invariant Derived loop invariant: (((((((((((((((50 <= c_req_d && 50 <= v) && v <= 50) && req_a == i) && (a <= 0 && c_req_a <= a) && (((((1 <= c_req_type && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && ((2 <= s_run_pc && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) || (s_run_pc == 0 && ((c_empty_req == 1 && m_run_pc == 3) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev))) && req_type <= 1) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && c_req_d <= c_req_a + 50) && req_a == 0) && a_t == 0) || (((((((c_req_a + 50 <= c_req_d && 52 == c_req_d) && s_memory2 == req_d) && ((((req_a <= a_t && ((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) && 2 <= a) && req_a == i) && s_memory0 == 50) && s_memory1 == 51) && c_req_d <= c_req_a + 50) && v == 52) && req_a == 2) && v == req_d)) || (((((((2 == req_a___0 && 52 == x) && s_memory2 + c_req_a == req_a___0 + 52) && 52 == rsp_d) && 52 == \result) && v == 52) && s_memory2 + req_a == req_tt_a + 52) && ((((((2 <= c_req_a && req_a <= 2) && s_memory1 == 51) && ((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) && 2 <= a) && 2 <= a_t) && m_run_pc == 6) && s_memory0 == 50) && i <= 2) && 2 <= i) && 2 <= req_a) && c_req_a <= 2)) || ((((c_req_a + 50 <= c_req_d && c_req_d <= c_req_a + 50) && ((((((((c_req_d <= 50 && 50 <= c_req_d) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && 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) && a_t == 0) && 0 <= a)) || ((((((((((((50 == \result && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && s_memory2 == 52) && 50 == x) && (req_type == 0 && 0 == c_req_type) && ((0 == c_req_a && a <= 0 && ((((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_tt_a == 0) && v == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 0) && 0 <= a)) || (((((c_req_a + 50 <= c_req_d && ((((((((((((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) && 51 <= req_d) && req_a == i) && c_req_d <= 51) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && v == req_d) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && c_req_d <= c_req_a + 50) && a <= 1) && 1 <= a) && a_t == 1)) || ((((((((((((((((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) && m_run_pc == 6) && s_memory0 == 50) && s_memory2 + c_req_a == req_a___0 + 52) && a == 1) && s_memory2 + c_req_a == req_tt_a + 52) && 51 == x) && s_memory1 == 51) && 51 == \result) && s_memory2 + req_a == req_tt_a + 52) && req_tt_a == 1) && 51 == rsp_d) && s_memory2 == 52) && v == 52) && s_memory2 + i == req_tt_a + 52) && a_t == 1) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && ((((((((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) && 3 <= a) && 2 <= a_t) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) || (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 1198]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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: 430]: Loop Invariant Derived loop invariant: ((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= a) && ((((((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_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) || (((((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) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && ((((((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) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && ((((((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 <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((a_t <= 1 && (c_req_d <= 51 && 51 <= c_req_d) && ((((((((((req_a <= a && 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) && a <= 1) && 1 <= a) || ((1 <= 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) && a <= 1) && 1 <= a)) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && a_t == 1) || ((((50 <= c_req_d && a <= 0 && (((2 <= c_write_req_ev && c_req_type <= 1) && c_req_a <= 0 && (1 <= c_req_type && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && c_req_d <= c_req_a + 50) && a_t == 0) && 0 <= a)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && req_a == 0) && a_t == 0) && 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) && req_d <= 50)) || ((req_a + 50 <= req_d && req_d <= req_a + 50) && a_t <= 1 && (c_req_d <= 51 && 51 <= c_req_d) && ((((((((((req_a <= a && 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) && a <= 1) && 1 <= a) || ((1 <= 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) && a <= 1) && 1 <= a)) && 50 <= v) && v <= 50) && req_a == i) && req_a == 0) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50)) || ((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) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && c_req_a + 50 <= c_req_d) && a <= 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) && c_req_d <= 51) && v == req_d) && a_t == 1)) || ((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (req_a <= a_t && (((((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) && 2 <= a) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d)) || ((((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || (((c_req_d <= 50 && 50 <= c_req_d) && ((a <= 0 && c_req_a <= a_t) && a_t <= 0) && (((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)) || (52 == c_req_d && (((((((51 <= req_d && req_a == i) && s_memory0 == 50) && s_memory1 == req_d) && ((((req_a <= a && 1 <= a_t) && (2 <= 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 <= 2) && 2 <= a) || ((((2 <= 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 <= 2) && 2 <= a) && 2 <= a_t))) && req_d <= 51) && v == req_d) && 1 <= req_a) && req_a <= 1)) || ((((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) - InvariantResult [Line: 460]: Loop Invariant Derived loop invariant: ((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= a) && ((((((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_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) || (((((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) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && ((((((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) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && ((((((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 <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && 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: 438]: Loop Invariant Derived loop invariant: ((((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && (c_req_a <= a_t && 2 <= a) && ((((((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_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d) || (((((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) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 1 <= a) && c_req_a + 50 <= c_req_d) && ((((((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) && a <= 1) && c_req_d <= 51) && v == req_d) && a_t == 1)) || (((((((((((((50 <= v && v <= 50) && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && ((((((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 <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && a == 0) && req_a == 0) && a_t == 0) && req_d <= 50) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((((51 <= req_d && req_a == i) && c_req_d <= c_req_a + 50) && ((((((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) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && c_req_a + 50 <= c_req_d) && c_req_d <= 51) && v == req_d) && a == 2) && a_t == 1) || ((((((((((52 == c_req_d && req_a == i) && c_req_d <= c_req_a + 50) && s_memory0 == 50) && s_memory1 == 51) && ((((((((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) && 3 <= a) && 2 <= a_t) && c_req_a + 50 <= c_req_d) && s_memory2 == req_d) && v == 52) && req_a == 2) && v == req_d)) || ((((((((((s_run_pc == 0 && c_req_a <= 0) && a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || (((((((((((m_run_pc <= 0 && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 == a)) || ((((((((((s_run_pc == 0 && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 == 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) && 50 <= v) && v <= 50) && req_a == i) && a == 1) && c_req_d <= c_req_a + 50) && s_memory0 == req_d) && 50 <= req_d) && c_req_d <= 50) && c_req_a + 50 <= c_req_d) && 50 <= c_req_d) && req_a == 0) && a_t == 0) && req_d <= 50)) || ((((((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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 274 locations, 5 error locations. SAFE Result, 323.4s OverallTime, 31 OverallIterations, 12 TraceHistogramMax, 59.0s AutomataDifference, 0.0s DeadEndRemovalTime, 234.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 21680 SDtfs, 43438 SDslu, 105790 SDs, 0 SdLazy, 9756 SolverSat, 1056 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4163 GetRequests, 3599 SyntacticMatches, 14 SemanticMatches, 550 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10440 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9473occurred 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: 14.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 89082 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 1314 NumberOfFragments, 34713 HoareAnnotationTreeSize, 98 FomulaSimplifications, 3983016873 FormulaSimplificationTreeSizeReduction, 42.9s HoareSimplificationTime, 98 FomulaSimplificationsInter, 1041733393 FormulaSimplificationTreeSizeReductionInter, 191.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 9883 NumberOfCodeBlocks, 9883 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9844 ConstructedInterpolants, 0 QuantifiedInterpolants, 14319870 SizeOfPredicates, 101 NumberOfNonLiveVariables, 9520 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 39 InterpolantComputations, 24 PerfectInterpolantSequences, 7329/11302 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...