./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5175cce01b12a2d959ac6d92bcc0adb5892ab17f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 20:15:41,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:15:41,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:15:41,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:15:41,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:15:41,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:15:41,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:15:41,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:15:41,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:15:41,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:15:41,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:15:41,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:15:41,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:15:41,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:15:41,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:15:41,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:15:41,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:15:41,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:15:41,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:15:41,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:15:41,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:15:41,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:15:41,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:15:41,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:15:41,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:15:41,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:15:41,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:15:41,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:15:41,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:15:41,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:15:41,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:15:41,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:15:41,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:15:41,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:15:41,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:15:41,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:15:41,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:15:41,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:15:41,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:15:41,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:15:41,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:15:41,215 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 20:15:41,239 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:15:41,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:15:41,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:15:41,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:15:41,241 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:15:41,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:15:41,241 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:15:41,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:15:41,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:15:41,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:15:41,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 20:15:41,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 20:15:41,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 20:15:41,243 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:15:41,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:15:41,243 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:15:41,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 20:15:41,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:15:41,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:15:41,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 20:15:41,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 20:15:41,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:15:41,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:15:41,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 20:15:41,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 20:15:41,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:15:41,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 20:15:41,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 20:15:41,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:15:41,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer 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(reach_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 -> 5175cce01b12a2d959ac6d92bcc0adb5892ab17f [2020-11-29 20:15:41,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:15:41,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:15:41,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:15:41,560 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:15:41,562 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:15:41,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2020-11-29 20:15:41,652 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/data/4ec634402/6900060d78a542c584f07feb55392c9d/FLAGd365ad037 [2020-11-29 20:15:42,289 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:15:42,293 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2020-11-29 20:15:42,315 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/data/4ec634402/6900060d78a542c584f07feb55392c9d/FLAGd365ad037 [2020-11-29 20:15:42,562 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/data/4ec634402/6900060d78a542c584f07feb55392c9d [2020-11-29 20:15:42,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:15:42,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:15:42,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:15:42,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:15:42,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:15:42,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:15:42" (1/1) ... [2020-11-29 20:15:42,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b93476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:42, skipping insertion in model container [2020-11-29 20:15:42,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:15:42" (1/1) ... [2020-11-29 20:15:42,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:15:42,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:15:42,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:15:42,987 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:15:43,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:15:43,115 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:15:43,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43 WrapperNode [2020-11-29 20:15:43,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:15:43,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:15:43,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:15:43,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:15:43,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... [2020-11-29 20:15:43,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... [2020-11-29 20:15:43,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:15:43,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:15:43,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:15:43,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:15:43,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... [2020-11-29 20:15:43,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... [2020-11-29 20:15:43,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... [2020-11-29 20:15:43,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... [2020-11-29 20:15:43,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... [2020-11-29 20:15:43,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... [2020-11-29 20:15:43,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... [2020-11-29 20:15:43,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:15:43,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:15:43,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:15:43,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:15:43,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/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 [2020-11-29 20:15:43,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:15:43,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:15:43,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:15:43,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:15:44,875 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:15:44,876 INFO L298 CfgBuilder]: Removed 49 assume(true) statements. [2020-11-29 20:15:44,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:15:44 BoogieIcfgContainer [2020-11-29 20:15:44,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:15:44,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 20:15:44,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 20:15:44,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 20:15:44,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:15:42" (1/3) ... [2020-11-29 20:15:44,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1beb9473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:15:44, skipping insertion in model container [2020-11-29 20:15:44,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:15:43" (2/3) ... [2020-11-29 20:15:44,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1beb9473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:15:44, skipping insertion in model container [2020-11-29 20:15:44,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:15:44" (3/3) ... [2020-11-29 20:15:44,890 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2020-11-29 20:15:44,902 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 20:15:44,907 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-11-29 20:15:44,918 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-29 20:15:44,964 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 20:15:44,965 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 20:15:44,965 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 20:15:44,965 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:15:44,965 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:15:44,966 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 20:15:44,966 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:15:44,966 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 20:15:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2020-11-29 20:15:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 20:15:45,012 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:45,013 INFO L422 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] [2020-11-29 20:15:45,014 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash -828410770, now seen corresponding path program 1 times [2020-11-29 20:15:45,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:45,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617586247] [2020-11-29 20:15:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:45,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617586247] [2020-11-29 20:15:45,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:45,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:15:45,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072271283] [2020-11-29 20:15:45,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:15:45,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:45,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:15:45,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:15:45,310 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 3 states. [2020-11-29 20:15:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:45,956 INFO L93 Difference]: Finished difference Result 718 states and 1297 transitions. [2020-11-29 20:15:45,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:15:45,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-11-29 20:15:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:45,989 INFO L225 Difference]: With dead ends: 718 [2020-11-29 20:15:45,989 INFO L226 Difference]: Without dead ends: 440 [2020-11-29 20:15:46,002 INFO L677 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 [2020-11-29 20:15:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-11-29 20:15:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 424. [2020-11-29 20:15:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-29 20:15:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 666 transitions. [2020-11-29 20:15:46,113 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 666 transitions. Word has length 27 [2020-11-29 20:15:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:46,114 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 666 transitions. [2020-11-29 20:15:46,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:15:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 666 transitions. [2020-11-29 20:15:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:15:46,117 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:46,117 INFO L422 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] [2020-11-29 20:15:46,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 20:15:46,118 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash 585120716, now seen corresponding path program 1 times [2020-11-29 20:15:46,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:46,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942571825] [2020-11-29 20:15:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:46,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942571825] [2020-11-29 20:15:46,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:46,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:15:46,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516270369] [2020-11-29 20:15:46,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:15:46,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:46,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:15:46,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:15:46,218 INFO L87 Difference]: Start difference. First operand 424 states and 666 transitions. Second operand 3 states. [2020-11-29 20:15:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:46,442 INFO L93 Difference]: Finished difference Result 1111 states and 1767 transitions. [2020-11-29 20:15:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:15:46,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-29 20:15:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:46,448 INFO L225 Difference]: With dead ends: 1111 [2020-11-29 20:15:46,448 INFO L226 Difference]: Without dead ends: 701 [2020-11-29 20:15:46,450 INFO L677 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 [2020-11-29 20:15:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2020-11-29 20:15:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 685. [2020-11-29 20:15:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2020-11-29 20:15:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1105 transitions. [2020-11-29 20:15:46,519 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1105 transitions. Word has length 36 [2020-11-29 20:15:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:46,519 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 1105 transitions. [2020-11-29 20:15:46,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:15:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1105 transitions. [2020-11-29 20:15:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 20:15:46,522 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:46,522 INFO L422 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] [2020-11-29 20:15:46,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 20:15:46,523 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:46,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:46,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1780672929, now seen corresponding path program 1 times [2020-11-29 20:15:46,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:46,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274256673] [2020-11-29 20:15:46,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:46,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274256673] [2020-11-29 20:15:46,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:46,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:15:46,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685831075] [2020-11-29 20:15:46,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:15:46,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:46,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:15:46,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:15:46,608 INFO L87 Difference]: Start difference. First operand 685 states and 1105 transitions. Second operand 3 states. [2020-11-29 20:15:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:46,697 INFO L93 Difference]: Finished difference Result 1731 states and 2796 transitions. [2020-11-29 20:15:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:15:46,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-11-29 20:15:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:46,707 INFO L225 Difference]: With dead ends: 1731 [2020-11-29 20:15:46,708 INFO L226 Difference]: Without dead ends: 1071 [2020-11-29 20:15:46,710 INFO L677 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 [2020-11-29 20:15:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2020-11-29 20:15:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1059. [2020-11-29 20:15:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2020-11-29 20:15:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1708 transitions. [2020-11-29 20:15:46,804 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1708 transitions. Word has length 37 [2020-11-29 20:15:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:46,804 INFO L481 AbstractCegarLoop]: Abstraction has 1059 states and 1708 transitions. [2020-11-29 20:15:46,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:15:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1708 transitions. [2020-11-29 20:15:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-29 20:15:46,807 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:46,807 INFO L422 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] [2020-11-29 20:15:46,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 20:15:46,807 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash -775080850, now seen corresponding path program 1 times [2020-11-29 20:15:46,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:46,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634486108] [2020-11-29 20:15:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:46,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634486108] [2020-11-29 20:15:46,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:46,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:15:46,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79077811] [2020-11-29 20:15:46,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:15:46,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:15:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:15:46,899 INFO L87 Difference]: Start difference. First operand 1059 states and 1708 transitions. Second operand 4 states. [2020-11-29 20:15:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:47,444 INFO L93 Difference]: Finished difference Result 2909 states and 4673 transitions. [2020-11-29 20:15:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:15:47,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-11-29 20:15:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:47,455 INFO L225 Difference]: With dead ends: 2909 [2020-11-29 20:15:47,455 INFO L226 Difference]: Without dead ends: 1875 [2020-11-29 20:15:47,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:15:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-11-29 20:15:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1645. [2020-11-29 20:15:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2020-11-29 20:15:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2616 transitions. [2020-11-29 20:15:47,528 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2616 transitions. Word has length 46 [2020-11-29 20:15:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:47,529 INFO L481 AbstractCegarLoop]: Abstraction has 1645 states and 2616 transitions. [2020-11-29 20:15:47,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:15:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2616 transitions. [2020-11-29 20:15:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 20:15:47,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:47,533 INFO L422 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] [2020-11-29 20:15:47,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 20:15:47,533 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:47,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:47,534 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2020-11-29 20:15:47,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:47,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908877323] [2020-11-29 20:15:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:47,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908877323] [2020-11-29 20:15:47,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:47,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:15:47,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314685349] [2020-11-29 20:15:47,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:15:47,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:47,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:15:47,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:15:47,655 INFO L87 Difference]: Start difference. First operand 1645 states and 2616 transitions. Second operand 4 states. [2020-11-29 20:15:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:48,367 INFO L93 Difference]: Finished difference Result 4885 states and 7660 transitions. [2020-11-29 20:15:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:15:48,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-11-29 20:15:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:48,397 INFO L225 Difference]: With dead ends: 4885 [2020-11-29 20:15:48,397 INFO L226 Difference]: Without dead ends: 3259 [2020-11-29 20:15:48,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:15:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2020-11-29 20:15:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2889. [2020-11-29 20:15:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2020-11-29 20:15:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4519 transitions. [2020-11-29 20:15:48,532 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4519 transitions. Word has length 52 [2020-11-29 20:15:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:48,535 INFO L481 AbstractCegarLoop]: Abstraction has 2889 states and 4519 transitions. [2020-11-29 20:15:48,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:15:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4519 transitions. [2020-11-29 20:15:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 20:15:48,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:48,537 INFO L422 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] [2020-11-29 20:15:48,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 20:15:48,537 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:48,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2020-11-29 20:15:48,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:48,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068823280] [2020-11-29 20:15:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:48,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068823280] [2020-11-29 20:15:48,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:48,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:15:48,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521086982] [2020-11-29 20:15:48,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:15:48,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:48,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:15:48,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:15:48,640 INFO L87 Difference]: Start difference. First operand 2889 states and 4519 transitions. Second operand 3 states. [2020-11-29 20:15:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:48,825 INFO L93 Difference]: Finished difference Result 6783 states and 10562 transitions. [2020-11-29 20:15:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:15:48,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-11-29 20:15:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:48,848 INFO L225 Difference]: With dead ends: 6783 [2020-11-29 20:15:48,848 INFO L226 Difference]: Without dead ends: 3917 [2020-11-29 20:15:48,853 INFO L677 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 [2020-11-29 20:15:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2020-11-29 20:15:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3733. [2020-11-29 20:15:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-11-29 20:15:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5757 transitions. [2020-11-29 20:15:49,036 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5757 transitions. Word has length 52 [2020-11-29 20:15:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:49,057 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 5757 transitions. [2020-11-29 20:15:49,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:15:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5757 transitions. [2020-11-29 20:15:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-29 20:15:49,060 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:49,060 INFO L422 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] [2020-11-29 20:15:49,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 20:15:49,061 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2003108181, now seen corresponding path program 1 times [2020-11-29 20:15:49,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:49,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812991443] [2020-11-29 20:15:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:49,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812991443] [2020-11-29 20:15:49,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:49,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:15:49,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498331716] [2020-11-29 20:15:49,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:15:49,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:49,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:15:49,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:15:49,151 INFO L87 Difference]: Start difference. First operand 3733 states and 5757 transitions. Second operand 3 states. [2020-11-29 20:15:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:49,744 INFO L93 Difference]: Finished difference Result 8963 states and 13937 transitions. [2020-11-29 20:15:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:15:49,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-11-29 20:15:49,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:49,778 INFO L225 Difference]: With dead ends: 8963 [2020-11-29 20:15:49,778 INFO L226 Difference]: Without dead ends: 5253 [2020-11-29 20:15:49,785 INFO L677 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 [2020-11-29 20:15:49,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2020-11-29 20:15:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4515. [2020-11-29 20:15:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4515 states. [2020-11-29 20:15:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6698 transitions. [2020-11-29 20:15:50,005 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6698 transitions. Word has length 56 [2020-11-29 20:15:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:50,005 INFO L481 AbstractCegarLoop]: Abstraction has 4515 states and 6698 transitions. [2020-11-29 20:15:50,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:15:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6698 transitions. [2020-11-29 20:15:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-29 20:15:50,008 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:50,008 INFO L422 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] [2020-11-29 20:15:50,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 20:15:50,009 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1830588417, now seen corresponding path program 1 times [2020-11-29 20:15:50,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:50,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834376221] [2020-11-29 20:15:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:50,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834376221] [2020-11-29 20:15:50,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:50,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:15:50,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486920912] [2020-11-29 20:15:50,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:15:50,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:50,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:15:50,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:15:50,070 INFO L87 Difference]: Start difference. First operand 4515 states and 6698 transitions. Second operand 3 states. [2020-11-29 20:15:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:50,306 INFO L93 Difference]: Finished difference Result 8873 states and 13173 transitions. [2020-11-29 20:15:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:15:50,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-11-29 20:15:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:50,331 INFO L225 Difference]: With dead ends: 8873 [2020-11-29 20:15:50,331 INFO L226 Difference]: Without dead ends: 4381 [2020-11-29 20:15:50,339 INFO L677 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 [2020-11-29 20:15:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2020-11-29 20:15:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 4381. [2020-11-29 20:15:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4381 states. [2020-11-29 20:15:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 6397 transitions. [2020-11-29 20:15:50,584 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 6397 transitions. Word has length 58 [2020-11-29 20:15:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:50,586 INFO L481 AbstractCegarLoop]: Abstraction has 4381 states and 6397 transitions. [2020-11-29 20:15:50,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:15:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 6397 transitions. [2020-11-29 20:15:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-29 20:15:50,588 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:50,589 INFO L422 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] [2020-11-29 20:15:50,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 20:15:50,589 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1143608735, now seen corresponding path program 1 times [2020-11-29 20:15:50,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:50,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643350164] [2020-11-29 20:15:50,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:50,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643350164] [2020-11-29 20:15:50,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:50,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:15:50,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110144703] [2020-11-29 20:15:50,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:15:50,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:50,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:15:50,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:15:50,650 INFO L87 Difference]: Start difference. First operand 4381 states and 6397 transitions. Second operand 3 states. [2020-11-29 20:15:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:50,920 INFO L93 Difference]: Finished difference Result 9409 states and 13912 transitions. [2020-11-29 20:15:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:15:50,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-11-29 20:15:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:50,969 INFO L225 Difference]: With dead ends: 9409 [2020-11-29 20:15:50,969 INFO L226 Difference]: Without dead ends: 5051 [2020-11-29 20:15:50,978 INFO L677 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 [2020-11-29 20:15:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2020-11-29 20:15:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 3399. [2020-11-29 20:15:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3399 states. [2020-11-29 20:15:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 5031 transitions. [2020-11-29 20:15:51,187 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 5031 transitions. Word has length 59 [2020-11-29 20:15:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:51,189 INFO L481 AbstractCegarLoop]: Abstraction has 3399 states and 5031 transitions. [2020-11-29 20:15:51,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:15:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 5031 transitions. [2020-11-29 20:15:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 20:15:51,191 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:51,191 INFO L422 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] [2020-11-29 20:15:51,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 20:15:51,192 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:51,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:51,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1698583374, now seen corresponding path program 1 times [2020-11-29 20:15:51,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:51,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332579511] [2020-11-29 20:15:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:51,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332579511] [2020-11-29 20:15:51,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:51,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:15:51,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813576260] [2020-11-29 20:15:51,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:15:51,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:51,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:15:51,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:15:51,282 INFO L87 Difference]: Start difference. First operand 3399 states and 5031 transitions. Second operand 6 states. [2020-11-29 20:15:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:52,749 INFO L93 Difference]: Finished difference Result 16205 states and 23855 transitions. [2020-11-29 20:15:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 20:15:52,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-11-29 20:15:52,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:52,777 INFO L225 Difference]: With dead ends: 16205 [2020-11-29 20:15:52,777 INFO L226 Difference]: Without dead ends: 13025 [2020-11-29 20:15:52,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-11-29 20:15:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13025 states. [2020-11-29 20:15:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13025 to 4265. [2020-11-29 20:15:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4265 states. [2020-11-29 20:15:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4265 states to 4265 states and 6289 transitions. [2020-11-29 20:15:53,130 INFO L78 Accepts]: Start accepts. Automaton has 4265 states and 6289 transitions. Word has length 61 [2020-11-29 20:15:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:53,131 INFO L481 AbstractCegarLoop]: Abstraction has 4265 states and 6289 transitions. [2020-11-29 20:15:53,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:15:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4265 states and 6289 transitions. [2020-11-29 20:15:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-29 20:15:53,132 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:53,133 INFO L422 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] [2020-11-29 20:15:53,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 20:15:53,133 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:53,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1116999633, now seen corresponding path program 1 times [2020-11-29 20:15:53,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:53,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737132061] [2020-11-29 20:15:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:53,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737132061] [2020-11-29 20:15:53,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:53,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 20:15:53,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491056523] [2020-11-29 20:15:53,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:15:53,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:15:53,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:15:53,233 INFO L87 Difference]: Start difference. First operand 4265 states and 6289 transitions. Second operand 7 states. [2020-11-29 20:15:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:55,237 INFO L93 Difference]: Finished difference Result 25491 states and 37406 transitions. [2020-11-29 20:15:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-29 20:15:55,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-11-29 20:15:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:55,307 INFO L225 Difference]: With dead ends: 25491 [2020-11-29 20:15:55,307 INFO L226 Difference]: Without dead ends: 25489 [2020-11-29 20:15:55,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2020-11-29 20:15:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25489 states. [2020-11-29 20:15:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25489 to 4573. [2020-11-29 20:15:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4573 states. [2020-11-29 20:15:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 6699 transitions. [2020-11-29 20:15:55,842 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 6699 transitions. Word has length 62 [2020-11-29 20:15:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:55,842 INFO L481 AbstractCegarLoop]: Abstraction has 4573 states and 6699 transitions. [2020-11-29 20:15:55,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:15:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 6699 transitions. [2020-11-29 20:15:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-29 20:15:55,850 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:55,850 INFO L422 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] [2020-11-29 20:15:55,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 20:15:55,851 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:55,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 490399450, now seen corresponding path program 1 times [2020-11-29 20:15:55,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:55,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590730277] [2020-11-29 20:15:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:55,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590730277] [2020-11-29 20:15:55,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:55,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:15:55,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918259299] [2020-11-29 20:15:55,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:15:55,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:55,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:15:55,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:15:55,900 INFO L87 Difference]: Start difference. First operand 4573 states and 6699 transitions. Second operand 3 states. [2020-11-29 20:15:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:56,234 INFO L93 Difference]: Finished difference Result 9620 states and 14052 transitions. [2020-11-29 20:15:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:15:56,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-11-29 20:15:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:56,244 INFO L225 Difference]: With dead ends: 9620 [2020-11-29 20:15:56,245 INFO L226 Difference]: Without dead ends: 5068 [2020-11-29 20:15:56,252 INFO L677 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 [2020-11-29 20:15:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2020-11-29 20:15:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 4994. [2020-11-29 20:15:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2020-11-29 20:15:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 7280 transitions. [2020-11-29 20:15:56,594 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 7280 transitions. Word has length 77 [2020-11-29 20:15:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:56,594 INFO L481 AbstractCegarLoop]: Abstraction has 4994 states and 7280 transitions. [2020-11-29 20:15:56,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:15:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 7280 transitions. [2020-11-29 20:15:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 20:15:56,597 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:56,597 INFO L422 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] [2020-11-29 20:15:56,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 20:15:56,597 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:56,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1468083949, now seen corresponding path program 1 times [2020-11-29 20:15:56,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:56,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182215706] [2020-11-29 20:15:56,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:56,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182215706] [2020-11-29 20:15:56,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:56,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:15:56,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038829102] [2020-11-29 20:15:56,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:15:56,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:15:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:15:56,639 INFO L87 Difference]: Start difference. First operand 4994 states and 7280 transitions. Second operand 4 states. [2020-11-29 20:15:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:57,436 INFO L93 Difference]: Finished difference Result 13350 states and 19292 transitions. [2020-11-29 20:15:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:15:57,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-29 20:15:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:57,453 INFO L225 Difference]: With dead ends: 13350 [2020-11-29 20:15:57,453 INFO L226 Difference]: Without dead ends: 8256 [2020-11-29 20:15:57,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:15:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8256 states. [2020-11-29 20:15:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8256 to 7429. [2020-11-29 20:15:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2020-11-29 20:15:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 10640 transitions. [2020-11-29 20:15:58,015 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 10640 transitions. Word has length 88 [2020-11-29 20:15:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:58,015 INFO L481 AbstractCegarLoop]: Abstraction has 7429 states and 10640 transitions. [2020-11-29 20:15:58,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:15:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 10640 transitions. [2020-11-29 20:15:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-29 20:15:58,019 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:58,019 INFO L422 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] [2020-11-29 20:15:58,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 20:15:58,019 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash 175649853, now seen corresponding path program 1 times [2020-11-29 20:15:58,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:58,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685357675] [2020-11-29 20:15:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:58,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685357675] [2020-11-29 20:15:58,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:58,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:15:58,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414603808] [2020-11-29 20:15:58,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:15:58,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:58,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:15:58,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:15:58,075 INFO L87 Difference]: Start difference. First operand 7429 states and 10640 transitions. Second operand 3 states. [2020-11-29 20:15:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:58,465 INFO L93 Difference]: Finished difference Result 10736 states and 15421 transitions. [2020-11-29 20:15:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:15:58,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-11-29 20:15:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:58,473 INFO L225 Difference]: With dead ends: 10736 [2020-11-29 20:15:58,473 INFO L226 Difference]: Without dead ends: 3315 [2020-11-29 20:15:58,484 INFO L677 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 [2020-11-29 20:15:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2020-11-29 20:15:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3262. [2020-11-29 20:15:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-11-29 20:15:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4385 transitions. [2020-11-29 20:15:58,647 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4385 transitions. Word has length 95 [2020-11-29 20:15:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:58,647 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 4385 transitions. [2020-11-29 20:15:58,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:15:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4385 transitions. [2020-11-29 20:15:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-29 20:15:58,649 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:58,649 INFO L422 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] [2020-11-29 20:15:58,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 20:15:58,649 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:58,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1463950789, now seen corresponding path program 1 times [2020-11-29 20:15:58,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:58,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979876940] [2020-11-29 20:15:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:58,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979876940] [2020-11-29 20:15:58,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:15:58,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:15:58,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654663035] [2020-11-29 20:15:58,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:15:58,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:15:58,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:15:58,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:15:58,744 INFO L87 Difference]: Start difference. First operand 3262 states and 4385 transitions. Second operand 5 states. [2020-11-29 20:15:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:15:59,546 INFO L93 Difference]: Finished difference Result 12465 states and 16771 transitions. [2020-11-29 20:15:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 20:15:59,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-11-29 20:15:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:15:59,560 INFO L225 Difference]: With dead ends: 12465 [2020-11-29 20:15:59,560 INFO L226 Difference]: Without dead ends: 9377 [2020-11-29 20:15:59,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:15:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2020-11-29 20:15:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 3264. [2020-11-29 20:15:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2020-11-29 20:15:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4381 transitions. [2020-11-29 20:15:59,827 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4381 transitions. Word has length 98 [2020-11-29 20:15:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:15:59,827 INFO L481 AbstractCegarLoop]: Abstraction has 3264 states and 4381 transitions. [2020-11-29 20:15:59,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:15:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4381 transitions. [2020-11-29 20:15:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-29 20:15:59,829 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:15:59,829 INFO L422 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, 1] [2020-11-29 20:15:59,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 20:15:59,829 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:15:59,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:15:59,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1371445226, now seen corresponding path program 1 times [2020-11-29 20:15:59,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:15:59,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3199621] [2020-11-29 20:15:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:15:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:15:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:15:59,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3199621] [2020-11-29 20:15:59,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751133750] [2020-11-29 20:15:59,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:16:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:00,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 20:16:00,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:16:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 20:16:00,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:16:00,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-11-29 20:16:00,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138000694] [2020-11-29 20:16:00,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:16:00,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:16:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:16:00,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:16:00,218 INFO L87 Difference]: Start difference. First operand 3264 states and 4381 transitions. Second operand 3 states. [2020-11-29 20:16:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:16:00,678 INFO L93 Difference]: Finished difference Result 3891 states and 5212 transitions. [2020-11-29 20:16:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:16:00,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-11-29 20:16:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:16:00,685 INFO L225 Difference]: With dead ends: 3891 [2020-11-29 20:16:00,685 INFO L226 Difference]: Without dead ends: 3887 [2020-11-29 20:16:00,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:16:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2020-11-29 20:16:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3837. [2020-11-29 20:16:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2020-11-29 20:16:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5136 transitions. [2020-11-29 20:16:01,066 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5136 transitions. Word has length 100 [2020-11-29 20:16:01,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:16:01,067 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 5136 transitions. [2020-11-29 20:16:01,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:16:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5136 transitions. [2020-11-29 20:16:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-11-29 20:16:01,070 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:16:01,071 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:16:01,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-29 20:16:01,286 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:16:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:16:01,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1350491852, now seen corresponding path program 1 times [2020-11-29 20:16:01,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:16:01,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753891783] [2020-11-29 20:16:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:16:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:16:01,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753891783] [2020-11-29 20:16:01,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569691673] [2020-11-29 20:16:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:16:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:01,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 20:16:01,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:16:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 20:16:01,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:16:01,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-11-29 20:16:01,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443164401] [2020-11-29 20:16:01,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:16:01,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:16:01,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:16:01,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:16:01,592 INFO L87 Difference]: Start difference. First operand 3837 states and 5136 transitions. Second operand 3 states. [2020-11-29 20:16:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:16:01,913 INFO L93 Difference]: Finished difference Result 6823 states and 9177 transitions. [2020-11-29 20:16:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:16:01,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2020-11-29 20:16:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:16:01,919 INFO L225 Difference]: With dead ends: 6823 [2020-11-29 20:16:01,920 INFO L226 Difference]: Without dead ends: 2995 [2020-11-29 20:16:01,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:16:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-11-29 20:16:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2774. [2020-11-29 20:16:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2020-11-29 20:16:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3648 transitions. [2020-11-29 20:16:02,188 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3648 transitions. Word has length 152 [2020-11-29 20:16:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:16:02,189 INFO L481 AbstractCegarLoop]: Abstraction has 2774 states and 3648 transitions. [2020-11-29 20:16:02,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:16:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3648 transitions. [2020-11-29 20:16:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-11-29 20:16:02,192 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:16:02,192 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:16:02,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-11-29 20:16:02,410 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:16:02,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:16:02,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1833127117, now seen corresponding path program 1 times [2020-11-29 20:16:02,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:16:02,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795852011] [2020-11-29 20:16:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:16:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-29 20:16:02,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795852011] [2020-11-29 20:16:02,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:16:02,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:16:02,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056620225] [2020-11-29 20:16:02,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:16:02,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:16:02,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:16:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:16:02,467 INFO L87 Difference]: Start difference. First operand 2774 states and 3648 transitions. Second operand 3 states. [2020-11-29 20:16:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:16:02,913 INFO L93 Difference]: Finished difference Result 3357 states and 4372 transitions. [2020-11-29 20:16:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:16:02,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2020-11-29 20:16:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:16:02,914 INFO L225 Difference]: With dead ends: 3357 [2020-11-29 20:16:02,915 INFO L226 Difference]: Without dead ends: 641 [2020-11-29 20:16:02,917 INFO L677 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 [2020-11-29 20:16:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-11-29 20:16:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 633. [2020-11-29 20:16:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-11-29 20:16:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 680 transitions. [2020-11-29 20:16:02,977 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 680 transitions. Word has length 155 [2020-11-29 20:16:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:16:02,977 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 680 transitions. [2020-11-29 20:16:02,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:16:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 680 transitions. [2020-11-29 20:16:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-11-29 20:16:02,980 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:16:02,980 INFO L422 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] [2020-11-29 20:16:02,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 20:16:02,980 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:16:02,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:16:02,981 INFO L82 PathProgramCache]: Analyzing trace with hash 36210659, now seen corresponding path program 1 times [2020-11-29 20:16:02,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:16:02,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214620644] [2020-11-29 20:16:02,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:16:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 20:16:03,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214620644] [2020-11-29 20:16:03,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178026348] [2020-11-29 20:16:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:16:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:03,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:16:03,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:16:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 20:16:03,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:16:03,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2020-11-29 20:16:03,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928639775] [2020-11-29 20:16:03,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:16:03,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:16:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:16:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:16:03,301 INFO L87 Difference]: Start difference. First operand 633 states and 680 transitions. Second operand 5 states. [2020-11-29 20:16:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:16:03,413 INFO L93 Difference]: Finished difference Result 923 states and 990 transitions. [2020-11-29 20:16:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:16:03,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2020-11-29 20:16:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:16:03,415 INFO L225 Difference]: With dead ends: 923 [2020-11-29 20:16:03,415 INFO L226 Difference]: Without dead ends: 537 [2020-11-29 20:16:03,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:16:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-11-29 20:16:03,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-11-29 20:16:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-11-29 20:16:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 575 transitions. [2020-11-29 20:16:03,475 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 575 transitions. Word has length 158 [2020-11-29 20:16:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:16:03,475 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 575 transitions. [2020-11-29 20:16:03,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:16:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 575 transitions. [2020-11-29 20:16:03,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-11-29 20:16:03,477 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:16:03,478 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:16:03,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:16:03,702 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:16:03,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:16:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash -884011814, now seen corresponding path program 1 times [2020-11-29 20:16:03,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:16:03,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342749902] [2020-11-29 20:16:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:16:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-29 20:16:03,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342749902] [2020-11-29 20:16:03,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:16:03,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 20:16:03,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986465683] [2020-11-29 20:16:03,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:16:03,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:16:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:16:03,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:16:03,793 INFO L87 Difference]: Start difference. First operand 537 states and 575 transitions. Second operand 7 states. [2020-11-29 20:16:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:16:04,104 INFO L93 Difference]: Finished difference Result 1008 states and 1085 transitions. [2020-11-29 20:16:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:16:04,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2020-11-29 20:16:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:16:04,106 INFO L225 Difference]: With dead ends: 1008 [2020-11-29 20:16:04,106 INFO L226 Difference]: Without dead ends: 1006 [2020-11-29 20:16:04,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-11-29 20:16:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2020-11-29 20:16:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 535. [2020-11-29 20:16:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2020-11-29 20:16:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 572 transitions. [2020-11-29 20:16:04,171 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 572 transitions. Word has length 160 [2020-11-29 20:16:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:16:04,171 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 572 transitions. [2020-11-29 20:16:04,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:16:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 572 transitions. [2020-11-29 20:16:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-11-29 20:16:04,174 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:16:04,174 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:16:04,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 20:16:04,174 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:16:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:16:04,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1634039867, now seen corresponding path program 1 times [2020-11-29 20:16:04,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:16:04,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176543304] [2020-11-29 20:16:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:16:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-29 20:16:04,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176543304] [2020-11-29 20:16:04,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:16:04,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:16:04,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912814238] [2020-11-29 20:16:04,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:16:04,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:16:04,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:16:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:16:04,255 INFO L87 Difference]: Start difference. First operand 535 states and 572 transitions. Second operand 5 states. [2020-11-29 20:16:04,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:16:04,405 INFO L93 Difference]: Finished difference Result 748 states and 799 transitions. [2020-11-29 20:16:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:16:04,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2020-11-29 20:16:04,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:16:04,407 INFO L225 Difference]: With dead ends: 748 [2020-11-29 20:16:04,407 INFO L226 Difference]: Without dead ends: 644 [2020-11-29 20:16:04,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 20:16:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-11-29 20:16:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 527. [2020-11-29 20:16:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2020-11-29 20:16:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 559 transitions. [2020-11-29 20:16:04,468 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 559 transitions. Word has length 161 [2020-11-29 20:16:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:16:04,469 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 559 transitions. [2020-11-29 20:16:04,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:16:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 559 transitions. [2020-11-29 20:16:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-29 20:16:04,472 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:16:04,472 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:16:04,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 20:16:04,473 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:16:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:16:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2074229243, now seen corresponding path program 1 times [2020-11-29 20:16:04,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:16:04,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479624506] [2020-11-29 20:16:04,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:16:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:16:04,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479624506] [2020-11-29 20:16:04,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990027958] [2020-11-29 20:16:04,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:16:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:16:05,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-29 20:16:05,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:16:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:16:05,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:16:05,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2020-11-29 20:16:05,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6188664] [2020-11-29 20:16:05,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-29 20:16:05,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:16:05,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-29 20:16:05,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-11-29 20:16:05,334 INFO L87 Difference]: Start difference. First operand 527 states and 559 transitions. Second operand 17 states. [2020-11-29 20:16:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:16:06,397 INFO L93 Difference]: Finished difference Result 836 states and 893 transitions. [2020-11-29 20:16:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-29 20:16:06,398 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 220 [2020-11-29 20:16:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:16:06,399 INFO L225 Difference]: With dead ends: 836 [2020-11-29 20:16:06,399 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 20:16:06,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2020-11-29 20:16:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 20:16:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 20:16:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 20:16:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 20:16:06,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2020-11-29 20:16:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:16:06,401 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 20:16:06,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-29 20:16:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 20:16:06,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 20:16:06,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:16:06,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-29 20:16:06,873 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 161 [2020-11-29 20:16:08,649 WARN L193 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 669 DAG size of output: 470 [2020-11-29 20:16:09,209 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-11-29 20:16:09,727 WARN L193 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 156 [2020-11-29 20:16:10,179 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-11-29 20:16:10,638 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 281 [2020-11-29 20:16:10,820 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 161 [2020-11-29 20:16:11,037 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 161 [2020-11-29 20:16:11,889 WARN L193 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 290 [2020-11-29 20:16:12,380 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 268 [2020-11-29 20:16:12,802 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 268 [2020-11-29 20:16:12,971 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 161 [2020-11-29 20:16:13,653 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 268 [2020-11-29 20:16:14,203 WARN L193 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 496 DAG size of output: 281 [2020-11-29 20:16:14,579 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 268 [2020-11-29 20:16:15,939 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 759 DAG size of output: 533 [2020-11-29 20:16:16,496 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-11-29 20:16:16,903 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 281 [2020-11-29 20:16:17,411 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-11-29 20:16:17,768 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 262 [2020-11-29 20:16:18,101 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-11-29 20:16:18,286 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 178 [2020-11-29 20:16:19,097 WARN L193 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-11-29 20:16:21,822 WARN L193 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 449 DAG size of output: 101 [2020-11-29 20:16:22,686 WARN L193 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-11-29 20:16:23,335 WARN L193 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 64 [2020-11-29 20:16:23,458 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2020-11-29 20:16:24,336 WARN L193 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-11-29 20:16:24,528 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2020-11-29 20:16:25,626 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 270 DAG size of output: 88 [2020-11-29 20:16:25,738 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-11-29 20:16:25,848 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-11-29 20:16:26,493 WARN L193 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-11-29 20:16:26,935 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 53 [2020-11-29 20:16:27,048 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-11-29 20:16:27,749 WARN L193 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-11-29 20:16:28,193 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 53 [2020-11-29 20:16:28,329 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2020-11-29 20:16:28,476 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2020-11-29 20:16:30,557 WARN L193 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 281 DAG size of output: 78 [2020-11-29 20:16:30,754 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-11-29 20:16:30,986 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2020-11-29 20:16:31,163 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-11-29 20:16:31,454 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-11-29 20:16:32,592 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 257 DAG size of output: 88 [2020-11-29 20:16:32,977 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-11-29 20:16:34,124 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 257 DAG size of output: 88 [2020-11-29 20:16:34,231 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-11-29 20:16:34,336 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-11-29 20:16:34,952 WARN L193 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-11-29 20:16:35,083 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-11-29 20:16:35,703 WARN L193 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-11-29 20:16:35,813 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-11-29 20:16:36,146 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-11-29 20:16:36,815 WARN L193 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-11-29 20:16:37,022 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-11-29 20:16:37,375 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-11-29 20:16:38,450 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 257 DAG size of output: 88 [2020-11-29 20:16:38,558 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-11-29 20:16:39,699 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 270 DAG size of output: 88 [2020-11-29 20:16:40,832 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 257 DAG size of output: 88 [2020-11-29 20:16:40,949 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-11-29 20:16:41,188 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2020-11-29 20:16:41,303 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-11-29 20:16:41,425 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-11-29 20:16:41,563 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-11-29 20:16:44,770 WARN L193 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 514 DAG size of output: 99 [2020-11-29 20:16:45,128 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-11-29 20:16:45,327 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-11-29 20:16:45,794 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2020-11-29 20:16:45,905 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-11-29 20:16:46,236 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-11-29 20:16:46,347 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-11-29 20:16:46,573 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 45 [2020-11-29 20:16:47,403 WARN L193 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-11-29 20:16:47,758 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2020-11-29 20:16:48,144 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2020-11-29 20:16:49,364 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 270 DAG size of output: 88 [2020-11-29 20:16:49,577 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2020-11-29 20:16:49,765 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-11-29 20:16:50,305 WARN L193 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 57 [2020-11-29 20:16:50,777 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 52 [2020-11-29 20:16:51,026 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2020-11-29 20:16:51,857 WARN L193 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-11-29 20:16:53,341 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 256 DAG size of output: 73 [2020-11-29 20:16:53,541 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2020-11-29 20:16:54,500 WARN L193 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-11-29 20:16:54,902 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2020-11-29 20:16:55,869 WARN L193 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 62 [2020-11-29 20:16:55,872 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,873 INFO L270 CegarLoopResult]: At program point L630-2(lines 630 658) the Hoare annotation is: (let ((.cse4 (= ~req_tt_a~0 0)) (.cse15 (= ~m_run_pc~0 6)) (.cse17 (= ~c_empty_req~0 1)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse8 (= ~c_req_a~0 0)) (.cse10 (= ~c_req_type~0 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse16 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse16 .cse4 .cse6 .cse5 .cse7 .cse8 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 .cse17 .cse11 .cse12 (= ULTIMATE.start_s_run_~req_a~1 0) .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse14 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse15 .cse9 .cse17 .cse16 .cse6 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_m_run_~a~0 0) .cse13 .cse14) (and .cse9 .cse16 .cse5 .cse6 .cse13 .cse14))) [2020-11-29 20:16:55,876 INFO L270 CegarLoopResult]: At program point L763(lines 756 800) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-11-29 20:16:55,876 INFO L270 CegarLoopResult]: At program point L697(lines 690 716) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-11-29 20:16:55,876 INFO L274 CegarLoopResult]: For program point L631(lines 630 658) no Hoare annotation was computed. [2020-11-29 20:16:55,876 INFO L274 CegarLoopResult]: For program point L565(lines 565 569) no Hoare annotation was computed. [2020-11-29 20:16:55,876 INFO L274 CegarLoopResult]: For program point L103(lines 103 119) no Hoare annotation was computed. [2020-11-29 20:16:55,877 INFO L270 CegarLoopResult]: At program point L896(lines 870 897) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse9 (= ~c_req_type~0 1)) (.cse10 (= ~m_run_pc~0 3)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse11 (<= 50 ~c_req_d~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v 50) .cse5 .cse6 (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse10 .cse5 (= ~s_run_pc~0 0) .cse6 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse11 .cse7 .cse8 .cse12))) [2020-11-29 20:16:55,877 INFO L274 CegarLoopResult]: For program point L632(lines 632 636) no Hoare annotation was computed. [2020-11-29 20:16:55,877 INFO L270 CegarLoopResult]: At program point L104(lines 93 835) the Hoare annotation is: (let ((.cse3 (= 2 ~s_run_pc~0))) (let ((.cse1 (= ~c_empty_req~0 1)) (.cse5 (<= 0 ~a_t~0)) (.cse14 (not (= ~c_req_type~0 0))) (.cse7 (= ~c_req_type~0 1)) (.cse10 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse6 (<= 50 ~c_req_d~0)) (.cse15 (not .cse3)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse11 (<= ~c_req_d~0 50)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse13 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse3 .cse7 .cse2 .cse4 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse14 .cse15 .cse2 .cse4 .cse10) (and .cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse13 .cse2 .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v 50) .cse1 (= ~s_memory0~0 50) .cse6 .cse8 .cse9 .cse11) (and .cse5 .cse14 .cse2 .cse7 .cse4 .cse10 .cse12 .cse0 .cse6 .cse15 .cse8 .cse9 .cse11) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse8)))) [2020-11-29 20:16:55,878 INFO L270 CegarLoopResult]: At program point L170-2(lines 170 198) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse8 (<= 0 ~a_t~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~m_run_pc~0 0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse8 .cse9 .cse4 .cse10 .cse7 .cse11 .cse0 .cse1 .cse12 .cse2 .cse13 .cse5 .cse14 .cse6 .cse15) (and .cse8 .cse3 .cse9 (= 2 ~s_run_pc~0) .cse4 .cse10 .cse7 .cse11 .cse1 .cse12 .cse2 .cse13 .cse5 .cse14 .cse6 .cse15))) [2020-11-29 20:16:55,878 INFO L274 CegarLoopResult]: For program point L765(lines 765 769) no Hoare annotation was computed. [2020-11-29 20:16:55,878 INFO L274 CegarLoopResult]: For program point L699(lines 699 703) no Hoare annotation was computed. [2020-11-29 20:16:55,878 INFO L270 CegarLoopResult]: At program point L1294(lines 1287 1304) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-11-29 20:16:55,878 INFO L270 CegarLoopResult]: At program point L237(lines 230 256) the Hoare annotation is: (let ((.cse2 (not (= ~s_run_st~0 0))) (.cse8 (<= 0 ~a_t~0)) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_type~0 1)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~m_run_pc~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 (not (= ~c_req_type~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse8 .cse2 .cse9 (or (and .cse1 .cse5) (and .cse1 (= ~m_run_pc~0 3))) .cse3 (= 2 ~s_run_pc~0) .cse10 .cse6 .cse7 .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (and .cse8 .cse9 .cse3 .cse10 .cse6 .cse7 .cse11 .cse1 .cse0 .cse12 .cse13 .cse4 .cse5 .cse14 .cse15))) [2020-11-29 20:16:55,878 INFO L274 CegarLoopResult]: For program point L171(lines 170 198) no Hoare annotation was computed. [2020-11-29 20:16:55,878 INFO L270 CegarLoopResult]: At program point L964(lines 957 974) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-11-29 20:16:55,878 INFO L274 CegarLoopResult]: For program point L1295(lines 1247 1336) no Hoare annotation was computed. [2020-11-29 20:16:55,879 INFO L274 CegarLoopResult]: For program point L1229(lines 1229 1233) no Hoare annotation was computed. [2020-11-29 20:16:55,879 INFO L274 CegarLoopResult]: For program point L172(lines 172 176) no Hoare annotation was computed. [2020-11-29 20:16:55,879 INFO L274 CegarLoopResult]: For program point L106(lines 106 118) no Hoare annotation was computed. [2020-11-29 20:16:55,879 INFO L274 CegarLoopResult]: For program point L965(lines 957 974) no Hoare annotation was computed. [2020-11-29 20:16:55,879 INFO L270 CegarLoopResult]: At program point L437(lines 430 447) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,879 INFO L274 CegarLoopResult]: For program point L371(lines 371 375) no Hoare annotation was computed. [2020-11-29 20:16:55,879 INFO L274 CegarLoopResult]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2020-11-29 20:16:55,879 INFO L274 CegarLoopResult]: For program point L239(lines 239 243) no Hoare annotation was computed. [2020-11-29 20:16:55,879 INFO L274 CegarLoopResult]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2020-11-29 20:16:55,879 INFO L270 CegarLoopResult]: At program point L107(lines 93 835) the Hoare annotation is: false [2020-11-29 20:16:55,879 INFO L274 CegarLoopResult]: For program point L1164-2(lines 1162 1341) no Hoare annotation was computed. [2020-11-29 20:16:55,880 INFO L270 CegarLoopResult]: At program point L1032(lines 1025 1078) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-11-29 20:16:55,880 INFO L274 CegarLoopResult]: For program point L966(lines 966 970) no Hoare annotation was computed. [2020-11-29 20:16:55,880 INFO L274 CegarLoopResult]: For program point L438(lines 126 472) no Hoare annotation was computed. [2020-11-29 20:16:55,880 INFO L270 CegarLoopResult]: At program point L571(lines 564 608) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-11-29 20:16:55,881 INFO L274 CegarLoopResult]: For program point L439(lines 439 443) no Hoare annotation was computed. [2020-11-29 20:16:55,881 INFO L274 CegarLoopResult]: For program point L109(lines 109 117) no Hoare annotation was computed. [2020-11-29 20:16:55,881 INFO L274 CegarLoopResult]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2020-11-29 20:16:55,881 INFO L270 CegarLoopResult]: At program point L110(lines 93 835) the Hoare annotation is: false [2020-11-29 20:16:55,881 INFO L274 CegarLoopResult]: For program point L903(lines 903 956) no Hoare annotation was computed. [2020-11-29 20:16:55,881 INFO L270 CegarLoopResult]: At program point L771(lines 764 799) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-11-29 20:16:55,881 INFO L270 CegarLoopResult]: At program point L705(lines 698 715) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-11-29 20:16:55,881 INFO L274 CegarLoopResult]: For program point L573(lines 573 577) no Hoare annotation was computed. [2020-11-29 20:16:55,882 INFO L277 CegarLoopResult]: At program point L1366(lines 1343 1368) the Hoare annotation is: true [2020-11-29 20:16:55,882 INFO L270 CegarLoopResult]: At program point L309(lines 279 310) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,882 INFO L274 CegarLoopResult]: For program point L904(lines 904 908) no Hoare annotation was computed. [2020-11-29 20:16:55,882 INFO L274 CegarLoopResult]: For program point L706(lines 477 829) no Hoare annotation was computed. [2020-11-29 20:16:55,882 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,882 INFO L270 CegarLoopResult]: At program point L1235(lines 1228 1245) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-11-29 20:16:55,882 INFO L274 CegarLoopResult]: For program point L1169-1(lines 1162 1341) no Hoare annotation was computed. [2020-11-29 20:16:55,882 INFO L274 CegarLoopResult]: For program point L112(lines 112 116) no Hoare annotation was computed. [2020-11-29 20:16:55,882 INFO L274 CegarLoopResult]: For program point L773(lines 773 777) no Hoare annotation was computed. [2020-11-29 20:16:55,882 INFO L274 CegarLoopResult]: For program point L707(lines 707 711) no Hoare annotation was computed. [2020-11-29 20:16:55,882 INFO L270 CegarLoopResult]: At program point L377(lines 370 387) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,883 INFO L270 CegarLoopResult]: At program point L245(lines 238 255) the Hoare annotation is: (let ((.cse2 (not (= ~s_run_st~0 0))) (.cse8 (<= 0 ~a_t~0)) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_type~0 1)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~m_run_pc~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 (not (= ~c_req_type~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse8 .cse2 .cse9 (or (and .cse1 .cse5) (and .cse1 (= ~m_run_pc~0 3))) .cse3 (= 2 ~s_run_pc~0) .cse10 .cse6 .cse7 .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (and .cse8 .cse9 .cse3 .cse10 .cse6 .cse7 .cse11 .cse1 .cse0 .cse12 .cse13 .cse4 .cse5 .cse14 .cse15))) [2020-11-29 20:16:55,883 INFO L270 CegarLoopResult]: At program point L113(lines 93 835) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse6 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse7 (= ~c_req_a~0 0)) (.cse8 (= ~c_req_type~0 0)) (.cse10 (= ~s_memory0~0 50)) (.cse9 (= ~c_empty_req~0 1)) (.cse0 (= ~m_run_pc~0 6)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ULTIMATE.start_s_run_~req_type~1 0) .cse8 .cse9 (= ~c_rsp_d~0 50) .cse10 (= ULTIMATE.start_s_run_~req_a~1 0) .cse11 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse9 .cse2 .cse4 .cse5 .cse11) (and .cse0 .cse13 .cse2 .cse4 .cse5 .cse11 .cse12))) [2020-11-29 20:16:55,883 INFO L274 CegarLoopResult]: For program point L378(lines 370 387) no Hoare annotation was computed. [2020-11-29 20:16:55,883 INFO L274 CegarLoopResult]: For program point L246(lines 126 472) no Hoare annotation was computed. [2020-11-29 20:16:55,883 INFO L274 CegarLoopResult]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2020-11-29 20:16:55,883 INFO L274 CegarLoopResult]: For program point L379(lines 379 383) no Hoare annotation was computed. [2020-11-29 20:16:55,883 INFO L274 CegarLoopResult]: For program point L247(lines 247 251) no Hoare annotation was computed. [2020-11-29 20:16:55,883 INFO L270 CegarLoopResult]: At program point L1040(lines 1033 1077) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-11-29 20:16:55,883 INFO L270 CegarLoopResult]: At program point L579(lines 572 607) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 0)) (and .cse0 (= ~m_run_pc~0 3)))) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-11-29 20:16:55,884 INFO L274 CegarLoopResult]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2020-11-29 20:16:55,884 INFO L270 CegarLoopResult]: At program point L910(lines 903 956) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-11-29 20:16:55,884 INFO L274 CegarLoopResult]: For program point L316(lines 316 369) no Hoare annotation was computed. [2020-11-29 20:16:55,884 INFO L274 CegarLoopResult]: For program point L1175(lines 1175 1179) no Hoare annotation was computed. [2020-11-29 20:16:55,884 INFO L274 CegarLoopResult]: For program point L977(lines 977 991) no Hoare annotation was computed. [2020-11-29 20:16:55,884 INFO L270 CegarLoopResult]: At program point L779(lines 772 798) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-11-29 20:16:55,884 INFO L274 CegarLoopResult]: For program point L581(lines 581 585) no Hoare annotation was computed. [2020-11-29 20:16:55,884 INFO L274 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-11-29 20:16:55,884 INFO L274 CegarLoopResult]: For program point L912(lines 912 916) no Hoare annotation was computed. [2020-11-29 20:16:55,884 INFO L270 CegarLoopResult]: At program point L516(lines 486 517) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,884 INFO L274 CegarLoopResult]: For program point L781(lines 781 785) no Hoare annotation was computed. [2020-11-29 20:16:55,885 INFO L274 CegarLoopResult]: For program point L1310(lines 1310 1314) no Hoare annotation was computed. [2020-11-29 20:16:55,885 INFO L274 CegarLoopResult]: For program point L1112(lines 1111 1152) no Hoare annotation was computed. [2020-11-29 20:16:55,885 INFO L274 CegarLoopResult]: For program point L453(lines 453 457) no Hoare annotation was computed. [2020-11-29 20:16:55,885 INFO L270 CegarLoopResult]: At program point L123(lines 93 835) the Hoare annotation is: (let ((.cse6 (= 2 ~s_run_pc~0))) (let ((.cse1 (<= 0 ~a_t~0)) (.cse2 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse12 (not .cse6)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse3 .cse4 .cse12 .cse5 .cse8 .cse9)))) [2020-11-29 20:16:55,885 INFO L270 CegarLoopResult]: At program point L1048(lines 1041 1076) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-11-29 20:16:55,885 INFO L270 CegarLoopResult]: At program point L520-2(lines 520 548) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,885 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-29 20:16:55,885 INFO L270 CegarLoopResult]: At program point L1181(lines 1174 1227) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-11-29 20:16:55,885 INFO L274 CegarLoopResult]: For program point L58(lines 58 61) no Hoare annotation was computed. [2020-11-29 20:16:55,885 INFO L274 CegarLoopResult]: For program point L983(lines 983 990) no Hoare annotation was computed. [2020-11-29 20:16:55,886 INFO L270 CegarLoopResult]: At program point L587(lines 580 606) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 0)) (and .cse0 (= ~m_run_pc~0 3)))) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-11-29 20:16:55,886 INFO L274 CegarLoopResult]: For program point L521(lines 520 548) no Hoare annotation was computed. [2020-11-29 20:16:55,886 INFO L274 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2020-11-29 20:16:55,886 INFO L270 CegarLoopResult]: At program point L389-1(lines 389 395) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,886 INFO L270 CegarLoopResult]: At program point L323(lines 316 369) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,886 INFO L274 CegarLoopResult]: For program point L1248(line 1248) no Hoare annotation was computed. [2020-11-29 20:16:55,886 INFO L274 CegarLoopResult]: For program point L1116(lines 1116 1120) no Hoare annotation was computed. [2020-11-29 20:16:55,886 INFO L274 CegarLoopResult]: For program point L1116-1(lines 1111 1152) no Hoare annotation was computed. [2020-11-29 20:16:55,886 INFO L274 CegarLoopResult]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2020-11-29 20:16:55,886 INFO L270 CegarLoopResult]: At program point L918(lines 911 955) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-11-29 20:16:55,887 INFO L274 CegarLoopResult]: For program point L522(lines 522 526) no Hoare annotation was computed. [2020-11-29 20:16:55,887 INFO L274 CegarLoopResult]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2020-11-29 20:16:55,887 INFO L270 CegarLoopResult]: At program point L126-2(lines 126 472) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse2 (<= 0 ~a_t~0)) (.cse3 (= ~c_req_type~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse11 (= ~c_req_a~0 0)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse12 (not (= ~s_run_st~0 0))) (.cse5 (not .cse13)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse10 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse12 .cse6 .cse13 (= ~m_run_pc~0 3) .cse10 (= ULTIMATE.start_s_memory_write_~v 50) .cse1 .cse4 (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) .cse8 (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2020-11-29 20:16:55,887 INFO L274 CegarLoopResult]: For program point L853(lines 853 865) no Hoare annotation was computed. [2020-11-29 20:16:55,887 INFO L270 CegarLoopResult]: At program point L787(lines 780 797) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-11-29 20:16:55,887 INFO L274 CegarLoopResult]: For program point L721(lines 721 725) no Hoare annotation was computed. [2020-11-29 20:16:55,887 INFO L274 CegarLoopResult]: For program point L589(lines 589 593) no Hoare annotation was computed. [2020-11-29 20:16:55,887 INFO L274 CegarLoopResult]: For program point L325(lines 325 329) no Hoare annotation was computed. [2020-11-29 20:16:55,887 INFO L270 CegarLoopResult]: At program point L1316(lines 1309 1326) the Hoare annotation is: (let ((.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse17 (= ~m_run_pc~0 6)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-11-29 20:16:55,887 INFO L274 CegarLoopResult]: For program point L127(lines 126 472) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L274 CegarLoopResult]: For program point L920(lines 920 924) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L274 CegarLoopResult]: For program point L788(lines 477 829) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L274 CegarLoopResult]: For program point L1317(lines 1247 1336) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L274 CegarLoopResult]: For program point L128(lines 128 132) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L274 CegarLoopResult]: For program point L789(lines 789 793) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L270 CegarLoopResult]: At program point L459(lines 452 469) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,888 INFO L274 CegarLoopResult]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L274 CegarLoopResult]: For program point L261(lines 261 265) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L270 CegarLoopResult]: At program point L63(lines 54 64) the Hoare annotation is: (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_memory_read_~i 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50)) [2020-11-29 20:16:55,888 INFO L274 CegarLoopResult]: For program point L856(lines 856 864) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L274 CegarLoopResult]: For program point L460(lines 452 469) no Hoare annotation was computed. [2020-11-29 20:16:55,888 INFO L270 CegarLoopResult]: At program point L857(lines 852 1103) the Hoare annotation is: false [2020-11-29 20:16:55,889 INFO L270 CegarLoopResult]: At program point L659(lines 629 660) the Hoare annotation is: (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50)) [2020-11-29 20:16:55,889 INFO L274 CegarLoopResult]: For program point L461(lines 461 465) no Hoare annotation was computed. [2020-11-29 20:16:55,889 INFO L270 CegarLoopResult]: At program point L1122(lines 1111 1152) the Hoare annotation is: (let ((.cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse0 (= ~m_run_pc~0 6)) (.cse17 (= ~req_tt_a~0 0)) (.cse18 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse20 (= ~s_memory0~0 50)) (.cse21 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse7 (= ~s_run_pc~0 0)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= 50 ~c_req_d~0)) (.cse25 (= ~c_req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse24 (<= ~c_req_d~0 50)) (.cse14 (<= 0 ~a_t~0)) (.cse19 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse8 (= ~m_run_st~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse3 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse22 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse4 .cse5 .cse18 .cse11 .cse1 .cse19 .cse20 .cse21 .cse6 .cse12) (and .cse15 .cse13 .cse14 .cse16 .cse3 .cse5 .cse4 .cse22 .cse18 .cse2 .cse8 .cse20 .cse23 .cse6 .cse12 .cse24) (and .cse7 .cse1 .cse3 (not .cse19) .cse5 .cse22 .cse11) (and .cse0 .cse13 .cse14 .cse3 .cse17 .cse4 .cse5 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse11 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse19 .cse2 .cse8 .cse20 .cse21 (= ULTIMATE.start_s_run_~req_a~1 0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) .cse12) (and .cse1 .cse2 .cse4 .cse5 .cse22) (and .cse7 .cse1 .cse14 .cse19 .cse2 .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse7 .cse1 .cse13 .cse14 .cse23 .cse5 .cse25 .cse22 .cse6 .cse12 .cse11 .cse24) (and .cse1 .cse13 .cse14 .cse23 .cse5 .cse4 .cse25 .cse22 .cse6 .cse12 .cse11 .cse24) (and .cse1 .cse14 .cse19 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse5 .cse4 .cse6 .cse22))) [2020-11-29 20:16:55,889 INFO L270 CegarLoopResult]: At program point L1056(lines 1049 1075) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-11-29 20:16:55,889 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-29 20:16:55,889 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,889 INFO L274 CegarLoopResult]: For program point L1255(lines 1255 1308) no Hoare annotation was computed. [2020-11-29 20:16:55,889 INFO L270 CegarLoopResult]: At program point L1189(lines 1182 1226) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-11-29 20:16:55,889 INFO L274 CegarLoopResult]: For program point L859(lines 859 863) no Hoare annotation was computed. [2020-11-29 20:16:55,890 INFO L270 CegarLoopResult]: At program point L727(lines 720 737) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-11-29 20:16:55,890 INFO L270 CegarLoopResult]: At program point L595(lines 588 605) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 0)) (and .cse0 (= ~m_run_pc~0 3)))) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-11-29 20:16:55,890 INFO L270 CegarLoopResult]: At program point L331(lines 324 368) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,890 INFO L274 CegarLoopResult]: For program point L1256(lines 1256 1260) no Hoare annotation was computed. [2020-11-29 20:16:55,890 INFO L270 CegarLoopResult]: At program point L199(lines 169 200) the Hoare annotation is: (let ((.cse6 (= ~s_run_pc~0 0)) (.cse0 (<= 0 ~a_t~0)) (.cse1 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 0)) (.cse9 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse14 .cse2 .cse10 .cse12 .cse4 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse1 .cse14 .cse2 (= 2 ~s_run_pc~0) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-11-29 20:16:55,890 INFO L274 CegarLoopResult]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2020-11-29 20:16:55,890 INFO L270 CegarLoopResult]: At program point L926(lines 919 954) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-11-29 20:16:55,891 INFO L270 CegarLoopResult]: At program point L860(lines 852 1103) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse5 (= ~c_req_a~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse9 (= ~m_run_pc~0 3))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v 50) .cse5 .cse6 (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_req_type~0 1) .cse9 .cse5 .cse6 (<= 50 ~c_req_d~0) .cse7 .cse8 (<= ~c_req_d~0 50)) (and .cse6 (= ~c_empty_req~0 1) .cse2 .cse3 .cse4 .cse9))) [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L728(lines 720 737) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L596(lines 477 829) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L398(lines 398 451) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L68(lines 68 71) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L993-1(lines 868 1098) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L729(lines 729 733) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L597(lines 597 601) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L399(lines 399 403) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L333(lines 333 337) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L270 CegarLoopResult]: At program point L267(lines 260 277) the Hoare annotation is: (let ((.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~s_run_pc~0 0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0)) (and .cse3 .cse0 .cse1 (not (= ~c_req_type~0 0)) .cse2 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_m_run_~req_d~0) .cse2 (= ~c_req_type~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_type~0 1) .cse0 .cse3 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~req_d~0 50) .cse4 .cse5 (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)))) [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L1126(lines 1126 1133) no Hoare annotation was computed. [2020-11-29 20:16:55,891 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L994(lines 993 1017) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L928(lines 928 932) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L3-4(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L268(lines 260 277) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L995(lines 995 999) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L269(lines 269 273) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L270 CegarLoopResult]: At program point L137-2(lines 137 165) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse3 (not (= ~s_run_st~0 0))) (.cse11 (<= 0 ~a_t~0)) (.cse12 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse14 (= ~c_req_a~0 0)) (.cse9 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse10 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse15 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse16 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (not .cse13)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse3 .cse12 .cse13 .cse6 .cse8 .cse14 .cse9 .cse15 .cse1 .cse16 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse11 .cse12 .cse6 .cse8 .cse14 .cse9 .cse10 .cse15 .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse5 .cse18 .cse7)))) [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L666(lines 666 719) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L138(lines 137 165) no Hoare annotation was computed. [2020-11-29 20:16:55,892 INFO L274 CegarLoopResult]: For program point L667(lines 667 671) no Hoare annotation was computed. [2020-11-29 20:16:55,893 INFO L270 CegarLoopResult]: At program point L1262(lines 1255 1308) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-11-29 20:16:55,893 INFO L274 CegarLoopResult]: For program point L139(lines 139 143) no Hoare annotation was computed. [2020-11-29 20:16:55,893 INFO L270 CegarLoopResult]: At program point L1064(lines 1057 1074) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-11-29 20:16:55,893 INFO L274 CegarLoopResult]: For program point L206(lines 206 259) no Hoare annotation was computed. [2020-11-29 20:16:55,893 INFO L270 CegarLoopResult]: At program point L1197(lines 1190 1225) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-11-29 20:16:55,893 INFO L274 CegarLoopResult]: For program point L1065(lines 868 1098) no Hoare annotation was computed. [2020-11-29 20:16:55,893 INFO L270 CegarLoopResult]: At program point L405(lines 398 451) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,893 INFO L270 CegarLoopResult]: At program point L339(lines 332 367) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,893 INFO L274 CegarLoopResult]: For program point L1330(lines 1330 1334) no Hoare annotation was computed. [2020-11-29 20:16:55,895 INFO L274 CegarLoopResult]: For program point L1330-1(lines 1162 1341) no Hoare annotation was computed. [2020-11-29 20:16:55,905 INFO L274 CegarLoopResult]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2020-11-29 20:16:55,905 INFO L274 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2020-11-29 20:16:55,905 INFO L274 CegarLoopResult]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2020-11-29 20:16:55,905 INFO L270 CegarLoopResult]: At program point L934(lines 927 953) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-11-29 20:16:55,906 INFO L270 CegarLoopResult]: At program point L868-1(lines 852 1103) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse6 (= ~s_memory0~0 50)) (.cse12 (= ~c_req_type~0 0)) (.cse5 (= ~c_empty_req~0 1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse11 (= ~c_req_a~0 0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse7 (<= 50 ~c_req_d~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse10 (<= ~c_req_d~0 50))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) .cse2 .cse4 .cse11 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse12 .cse5 .cse6 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse8 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse1 .cse12 .cse5 .cse14 .cse2 .cse8 (= ~m_run_pc~0 0) (not (= ~c_m_lock~0 1)) .cse11) (and .cse0 .cse1 .cse14 (= ~c_req_type~0 1) .cse2 .cse3 .cse11 (= ~s_run_pc~0 0) .cse13 .cse7 .cse8 .cse9 .cse10))) [2020-11-29 20:16:55,906 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,906 INFO L274 CegarLoopResult]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2020-11-29 20:16:55,906 INFO L274 CegarLoopResult]: For program point L803(lines 803 807) no Hoare annotation was computed. [2020-11-29 20:16:55,907 INFO L270 CegarLoopResult]: At program point L473(lines 125 474) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) [2020-11-29 20:16:55,907 INFO L274 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2020-11-29 20:16:55,907 INFO L274 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2020-11-29 20:16:55,907 INFO L274 CegarLoopResult]: For program point L936(lines 936 940) no Hoare annotation was computed. [2020-11-29 20:16:55,907 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-29 20:16:55,907 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-11-29 20:16:55,907 INFO L274 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-11-29 20:16:55,908 INFO L274 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-11-29 20:16:55,908 INFO L274 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-11-29 20:16:55,908 INFO L274 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-11-29 20:16:55,908 INFO L274 CegarLoopResult]: For program point L871-1(lines 868 1098) no Hoare annotation was computed. [2020-11-29 20:16:55,908 INFO L274 CegarLoopResult]: For program point L739(lines 739 745) no Hoare annotation was computed. [2020-11-29 20:16:55,908 INFO L270 CegarLoopResult]: At program point L739-1(lines 739 745) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-11-29 20:16:55,909 INFO L270 CegarLoopResult]: At program point L673(lines 666 719) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-11-29 20:16:55,909 INFO L270 CegarLoopResult]: At program point L13-3(lines 1 1368) the Hoare annotation is: (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_memory_read_~i 0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50)) [2020-11-29 20:16:55,909 INFO L270 CegarLoopResult]: At program point L13-4(lines 66 74) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse8 (= ULTIMATE.start_s_memory_write_~i 0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~s_run_st~0 0)) .cse4 (= ~c_req_type~0 1) .cse5 .cse6 .cse7 .cse8 (= ~s_run_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= 2 ~s_run_pc~0) .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-11-29 20:16:55,909 INFO L274 CegarLoopResult]: For program point L872(lines 871 895) no Hoare annotation was computed. [2020-11-29 20:16:55,910 INFO L270 CegarLoopResult]: At program point L1137(lines 1111 1152) the Hoare annotation is: (let ((.cse15 (= ~m_run_pc~0 6)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse17 (= ~req_tt_a~0 0)) (.cse8 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse10 (= ~s_memory0~0 50)) (.cse20 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse19 (= ~c_req_type~0 0)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse11 (<= 50 ~c_req_d~0)) (.cse24 (= ~c_req_type~0 1)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= ~c_req_d~0 50)) (.cse23 (= ~s_run_pc~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse21 (= ~m_run_pc~0 0)) (.cse22 (not (= ~c_m_lock~0 1))) (.cse18 (= ~c_req_a~0 0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse7 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse9 .cse4 .cse6 .cse5 .cse12) (and .cse15 .cse1 .cse2 .cse4 .cse17 .cse5 .cse6 .cse8 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse19 .cse9 .cse10 (= ULTIMATE.start_s_run_~req_a~1 0) .cse20 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse15 .cse16 .cse4 .cse6 .cse5 .cse12 .cse13) (and .cse16 .cse2 .cse19 .cse9 .cse4 .cse6 .cse5 .cse12 .cse21 .cse22 .cse18) (and .cse15 .cse1 .cse2 .cse0 .cse3 .cse17 .cse6 .cse5 .cse8 .cse18 .cse16 .cse19 .cse10 .cse20 .cse12 .cse13) (and .cse23 .cse16 .cse4 (not .cse19) .cse5 .cse7 .cse18) (and .cse16 .cse9 .cse6 .cse5 .cse7) (and .cse23 .cse16 .cse2 .cse19 .cse9 .cse5 .cse12 .cse21 .cse22 .cse18) (and .cse23 .cse16 .cse1 .cse2 .cse11 .cse5 .cse24 .cse7 .cse12 .cse13 .cse18 .cse14) (and .cse16 .cse1 .cse2 .cse11 .cse5 .cse6 .cse24 .cse7 .cse12 .cse13 .cse18 .cse14) (and .cse23 .cse16 .cse9 .cse4 .cse5 .cse21 .cse22 .cse18) (and .cse16 .cse4 .cse5 .cse6 .cse12 .cse7))) [2020-11-29 20:16:55,910 INFO L274 CegarLoopResult]: For program point L873(lines 873 877) no Hoare annotation was computed. [2020-11-29 20:16:55,910 INFO L274 CegarLoopResult]: For program point L675(lines 675 679) no Hoare annotation was computed. [2020-11-29 20:16:55,910 INFO L270 CegarLoopResult]: At program point L477-2(lines 477 829) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse7 (not (= ~c_m_lock~0 1))) (.cse0 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 .cse5 .cse4 (= ~m_run_pc~0 3) .cse7 (= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse2 (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (<= ~c_req_d~0 50)))) [2020-11-29 20:16:55,911 INFO L270 CegarLoopResult]: At program point L1270(lines 1263 1307) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-11-29 20:16:55,911 INFO L270 CegarLoopResult]: At program point L213(lines 206 259) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse0 (<= 0 ~a_t~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse1 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_req_a~0 0)) (.cse5 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~m_run_pc~0 0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 .cse15 (not (= ~c_req_type~0 0)) .cse3 .cse11 .cse12 .cse4 .cse5 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse15 .cse1 (= 2 ~s_run_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2020-11-29 20:16:55,911 INFO L274 CegarLoopResult]: For program point L478(lines 477 829) no Hoare annotation was computed. [2020-11-29 20:16:55,912 INFO L277 CegarLoopResult]: At program point L1337(lines 1159 1342) the Hoare annotation is: true [2020-11-29 20:16:55,912 INFO L270 CegarLoopResult]: At program point L280-2(lines 280 308) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0))) (let ((.cse13 (= ~c_empty_req~0 1)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (not (= ~s_run_st~0 0))) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse16 (not (= ~c_req_type~0 0))) (.cse6 (= ~c_req_type~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (<= 50 ~c_req_d~0)) (.cse15 (not .cse5)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse10 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse4 .cse5 .cse7) (and .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse11 .cse4 .cse5 .cse12 (= ULTIMATE.start_s_memory_write_~v 50) .cse13 (= ~s_memory0~0 50) .cse3 .cse7 .cse8 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse12) (and .cse14 .cse0 .cse11 .cse15 .cse16 .cse4 .cse9) (and .cse1 .cse2 .cse16 .cse6 .cse4 .cse9 .cse14 .cse0 .cse3 .cse15 .cse7 .cse8 .cse10)))) [2020-11-29 20:16:55,912 INFO L270 CegarLoopResult]: At program point L1205(lines 1198 1224) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-11-29 20:16:55,913 INFO L270 CegarLoopResult]: At program point L809(lines 802 819) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-11-29 20:16:55,913 INFO L274 CegarLoopResult]: For program point L611(lines 611 615) no Hoare annotation was computed. [2020-11-29 20:16:55,913 INFO L274 CegarLoopResult]: For program point L479(lines 479 483) no Hoare annotation was computed. [2020-11-29 20:16:55,913 INFO L270 CegarLoopResult]: At program point L413(lines 406 450) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,913 INFO L270 CegarLoopResult]: At program point L347(lines 340 366) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,914 INFO L274 CegarLoopResult]: For program point L281(lines 280 308) no Hoare annotation was computed. [2020-11-29 20:16:55,914 INFO L274 CegarLoopResult]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2020-11-29 20:16:55,914 INFO L274 CegarLoopResult]: For program point L215(lines 215 219) no Hoare annotation was computed. [2020-11-29 20:16:55,914 INFO L270 CegarLoopResult]: At program point L942(lines 935 952) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-11-29 20:16:55,914 INFO L274 CegarLoopResult]: For program point L810(lines 802 819) no Hoare annotation was computed. [2020-11-29 20:16:55,914 INFO L274 CegarLoopResult]: For program point L282(lines 282 286) no Hoare annotation was computed. [2020-11-29 20:16:55,915 INFO L274 CegarLoopResult]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2020-11-29 20:16:55,915 INFO L274 CegarLoopResult]: For program point L1141(lines 1141 1148) no Hoare annotation was computed. [2020-11-29 20:16:55,915 INFO L274 CegarLoopResult]: For program point L943(lines 868 1098) no Hoare annotation was computed. [2020-11-29 20:16:55,915 INFO L274 CegarLoopResult]: For program point L811(lines 811 815) no Hoare annotation was computed. [2020-11-29 20:16:55,915 INFO L274 CegarLoopResult]: For program point L415(lines 415 419) no Hoare annotation was computed. [2020-11-29 20:16:55,915 INFO L274 CegarLoopResult]: For program point L349(lines 349 353) no Hoare annotation was computed. [2020-11-29 20:16:55,915 INFO L274 CegarLoopResult]: For program point L944(lines 944 948) no Hoare annotation was computed. [2020-11-29 20:16:55,915 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-29 20:16:55,916 INFO L270 CegarLoopResult]: At program point L681(lines 674 718) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-11-29 20:16:55,916 INFO L270 CegarLoopResult]: At program point L549(lines 519 550) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,916 INFO L274 CegarLoopResult]: For program point L748(lines 748 801) no Hoare annotation was computed. [2020-11-29 20:16:55,916 INFO L274 CegarLoopResult]: For program point L749(lines 749 753) no Hoare annotation was computed. [2020-11-29 20:16:55,916 INFO L274 CegarLoopResult]: For program point L683(lines 683 687) no Hoare annotation was computed. [2020-11-29 20:16:55,917 INFO L270 CegarLoopResult]: At program point L617(lines 610 627) the Hoare annotation is: (and (= ~c_empty_rsp~0 1) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (<= 1 ~c_m_lock~0)) [2020-11-29 20:16:55,917 INFO L270 CegarLoopResult]: At program point L1278(lines 1271 1306) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-11-29 20:16:55,917 INFO L270 CegarLoopResult]: At program point L221(lines 214 258) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse0 (<= 0 ~a_t~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse1 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_req_a~0 0)) (.cse5 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~m_run_pc~0 0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 .cse15 (not (= ~c_req_type~0 0)) .cse3 .cse11 .cse12 .cse4 .cse5 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse15 .cse1 (= 2 ~s_run_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2020-11-29 20:16:55,918 INFO L274 CegarLoopResult]: For program point L1080(lines 1080 1084) no Hoare annotation was computed. [2020-11-29 20:16:55,918 INFO L274 CegarLoopResult]: For program point L618(lines 610 627) no Hoare annotation was computed. [2020-11-29 20:16:55,918 INFO L270 CegarLoopResult]: At program point L1213(lines 1206 1223) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-11-29 20:16:55,918 INFO L274 CegarLoopResult]: For program point L619(lines 619 623) no Hoare annotation was computed. [2020-11-29 20:16:55,918 INFO L270 CegarLoopResult]: At program point L421(lines 414 449) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,919 INFO L270 CegarLoopResult]: At program point L487-2(lines 487 515) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,919 INFO L270 CegarLoopResult]: At program point L355(lines 348 365) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,919 INFO L274 CegarLoopResult]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2020-11-29 20:16:55,919 INFO L274 CegarLoopResult]: For program point L223(lines 223 227) no Hoare annotation was computed. [2020-11-29 20:16:55,919 INFO L274 CegarLoopResult]: For program point L1214(lines 1162 1341) no Hoare annotation was computed. [2020-11-29 20:16:55,919 INFO L274 CegarLoopResult]: For program point L488(lines 487 515) no Hoare annotation was computed. [2020-11-29 20:16:55,919 INFO L274 CegarLoopResult]: For program point L356(lines 126 472) no Hoare annotation was computed. [2020-11-29 20:16:55,920 INFO L274 CegarLoopResult]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2020-11-29 20:16:55,920 INFO L274 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2020-11-29 20:16:55,920 INFO L274 CegarLoopResult]: For program point L423(lines 423 427) no Hoare annotation was computed. [2020-11-29 20:16:55,920 INFO L274 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2020-11-29 20:16:55,920 INFO L270 CegarLoopResult]: At program point L1018(lines 992 1019) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse13 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~s_run_st~0 0)) .cse4 (= ~c_req_type~0 1) .cse5 (= ULTIMATE.start_s_run_~req_type~1 1) .cse6 (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ~m_run_pc~0 6) .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 .cse13 .cse6 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ULTIMATE.start_s_run_~req_type~1 0) .cse14 (= ~c_req_type~0 0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse10 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2020-11-29 20:16:55,920 INFO L274 CegarLoopResult]: For program point L556(lines 556 609) no Hoare annotation was computed. [2020-11-29 20:16:55,921 INFO L274 CegarLoopResult]: For program point L94(lines 94 122) no Hoare annotation was computed. [2020-11-29 20:16:55,921 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-29 20:16:55,921 INFO L274 CegarLoopResult]: For program point L821(lines 821 827) no Hoare annotation was computed. [2020-11-29 20:16:55,921 INFO L270 CegarLoopResult]: At program point L821-1(lines 821 827) the Hoare annotation is: (and (= ~m_run_pc~0 6) (= ~c_empty_rsp~0 1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (<= 2 ~c_write_req_ev~0) (not (= ~c_m_lock~0 1))) [2020-11-29 20:16:55,921 INFO L270 CegarLoopResult]: At program point L755(lines 748 801) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-11-29 20:16:55,922 INFO L270 CegarLoopResult]: At program point L689(lines 682 717) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-11-29 20:16:55,922 INFO L274 CegarLoopResult]: For program point L557(lines 557 561) no Hoare annotation was computed. [2020-11-29 20:16:55,922 INFO L270 CegarLoopResult]: At program point L1086(lines 1079 1096) the Hoare annotation is: (let ((.cse4 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~s_run_pc~0)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and (let ((.cse8 (= ~m_run_pc~0 3))) (or (and (= ~s_run_pc~0 0) .cse4 (not (= ~s_run_st~0 0)) .cse8) (and .cse4 .cse2 .cse8))) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) (<= 50 ~c_req_d~0) .cse6 .cse7 .cse3 (<= ~c_req_d~0 50)))) [2020-11-29 20:16:55,925 INFO L270 CegarLoopResult]: At program point L1153(lines 1105 1158) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-11-29 20:16:55,925 INFO L274 CegarLoopResult]: For program point L1087(lines 1079 1096) no Hoare annotation was computed. [2020-11-29 20:16:55,925 INFO L274 CegarLoopResult]: For program point L757(lines 757 761) no Hoare annotation was computed. [2020-11-29 20:16:55,925 INFO L274 CegarLoopResult]: For program point L691(lines 691 695) no Hoare annotation was computed. [2020-11-29 20:16:55,926 INFO L270 CegarLoopResult]: At program point L1286(lines 1279 1305) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-11-29 20:16:55,926 INFO L270 CegarLoopResult]: At program point L229(lines 222 257) the Hoare annotation is: (let ((.cse2 (not (= ~s_run_st~0 0))) (.cse8 (<= 0 ~a_t~0)) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_type~0 1)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~m_run_pc~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 (not (= ~c_req_type~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse8 .cse2 .cse9 (or (and .cse1 .cse5) (and .cse1 (= ~m_run_pc~0 3))) .cse3 (= 2 ~s_run_pc~0) .cse10 .cse6 .cse7 .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (and .cse8 .cse9 .cse3 .cse10 .cse6 .cse7 .cse11 .cse1 .cse0 .cse12 .cse13 .cse4 .cse5 .cse14 .cse15))) [2020-11-29 20:16:55,926 INFO L274 CegarLoopResult]: For program point L97(lines 97 121) no Hoare annotation was computed. [2020-11-29 20:16:55,927 INFO L274 CegarLoopResult]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2020-11-29 20:16:55,927 INFO L270 CegarLoopResult]: At program point L98(lines 93 835) the Hoare annotation is: false [2020-11-29 20:16:55,927 INFO L270 CegarLoopResult]: At program point L429(lines 422 448) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-11-29 20:16:55,927 INFO L274 CegarLoopResult]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2020-11-29 20:16:55,927 INFO L274 CegarLoopResult]: For program point L231(lines 231 235) no Hoare annotation was computed. [2020-11-29 20:16:55,927 INFO L274 CegarLoopResult]: For program point L958(lines 958 962) no Hoare annotation was computed. [2020-11-29 20:16:55,928 INFO L270 CegarLoopResult]: At program point L166(lines 136 167) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse3 (not (= ~s_run_st~0 0))) (.cse11 (<= 0 ~a_t~0)) (.cse12 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse14 (= ~c_req_a~0 0)) (.cse9 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse10 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse15 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse16 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (not .cse13)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse3 .cse12 .cse13 .cse6 .cse8 .cse14 .cse9 .cse15 .cse1 .cse16 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse11 .cse12 .cse6 .cse8 .cse14 .cse9 .cse10 .cse15 .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse5 .cse18 .cse7)))) [2020-11-29 20:16:55,928 INFO L274 CegarLoopResult]: For program point L100(lines 100 120) no Hoare annotation was computed. [2020-11-29 20:16:55,928 INFO L274 CegarLoopResult]: For program point L1025(lines 1025 1078) no Hoare annotation was computed. [2020-11-29 20:16:55,928 INFO L270 CegarLoopResult]: At program point L563(lines 556 609) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-11-29 20:16:55,928 INFO L274 CegarLoopResult]: For program point L431(lines 431 435) no Hoare annotation was computed. [2020-11-29 20:16:55,928 INFO L270 CegarLoopResult]: At program point L101(lines 93 835) the Hoare annotation is: false [2020-11-29 20:16:55,928 INFO L274 CegarLoopResult]: For program point L1026(lines 1026 1030) no Hoare annotation was computed. [2020-11-29 20:16:56,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 08:16:56 BoogieIcfgContainer [2020-11-29 20:16:56,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 20:16:56,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:16:56,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:16:56,070 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:16:56,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:15:44" (3/4) ... [2020-11-29 20:16:56,080 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 20:16:56,106 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-11-29 20:16:56,107 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-11-29 20:16:56,109 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 20:16:56,111 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 20:16:56,137 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) [2020-11-29 20:16:56,138 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-11-29 20:16:56,138 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) [2020-11-29 20:16:56,138 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-11-29 20:16:56,139 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-11-29 20:16:56,139 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-11-29 20:16:56,139 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-11-29 20:16:56,139 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-11-29 20:16:56,140 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-11-29 20:16:56,140 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-11-29 20:16:56,141 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-11-29 20:16:56,142 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((m_run_pc == 6 && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((m_run_pc == 6 && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) [2020-11-29 20:16:56,143 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-11-29 20:16:56,144 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-11-29 20:16:56,144 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-11-29 20:16:56,144 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((s_run_pc == 0 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == 3) || ((c_empty_req == 1 && 2 == s_run_pc) && m_run_pc == 3)) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && v == 50) && c_req_d <= 50) [2020-11-29 20:16:56,145 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-11-29 20:16:56,145 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-11-29 20:16:56,146 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) [2020-11-29 20:16:56,146 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50 [2020-11-29 20:16:56,146 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && i == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50 [2020-11-29 20:16:56,148 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-11-29 20:16:56,148 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-11-29 20:16:56,148 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-11-29 20:16:56,149 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-11-29 20:16:56,149 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-11-29 20:16:56,149 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-11-29 20:16:56,149 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-11-29 20:16:56,150 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-11-29 20:16:56,150 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-11-29 20:16:56,150 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-11-29 20:16:56,151 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-11-29 20:16:56,151 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-11-29 20:16:56,151 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-11-29 20:16:56,278 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5a14b69e-c13b-4834-9626-0a10ea9735b2/bin/uautomizer/witness.graphml [2020-11-29 20:16:56,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:16:56,279 INFO L168 Benchmark]: Toolchain (without parser) took 73710.98 ms. Allocated memory was 98.6 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 66.9 MB in the beginning and 643.3 MB in the end (delta: -576.4 MB). Peak memory consumption was 769.3 MB. Max. memory is 16.1 GB. [2020-11-29 20:16:56,279 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 81.8 MB. Free memory was 52.9 MB in the beginning and 52.8 MB in the end (delta: 29.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:16:56,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.09 ms. Allocated memory is still 98.6 MB. Free memory was 66.4 MB in the beginning and 68.4 MB in the end (delta: -2.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 20:16:56,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.94 ms. Allocated memory is still 98.6 MB. Free memory was 68.4 MB in the beginning and 65.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 20:16:56,281 INFO L168 Benchmark]: Boogie Preprocessor took 68.65 ms. Allocated memory is still 98.6 MB. Free memory was 65.0 MB in the beginning and 61.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:16:56,282 INFO L168 Benchmark]: RCFGBuilder took 1595.94 ms. Allocated memory is still 98.6 MB. Free memory was 61.5 MB in the beginning and 57.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 35.0 MB. Max. memory is 16.1 GB. [2020-11-29 20:16:56,282 INFO L168 Benchmark]: TraceAbstraction took 71186.79 ms. Allocated memory was 98.6 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 57.0 MB in the beginning and 665.3 MB in the end (delta: -608.3 MB). Peak memory consumption was 921.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:16:56,283 INFO L168 Benchmark]: Witness Printer took 208.87 ms. Allocated memory is still 1.4 GB. Free memory was 665.3 MB in the beginning and 643.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:16:56,285 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 81.8 MB. Free memory was 52.9 MB in the beginning and 52.8 MB in the end (delta: 29.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 545.09 ms. Allocated memory is still 98.6 MB. Free memory was 66.4 MB in the beginning and 68.4 MB in the end (delta: -2.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.94 ms. Allocated memory is still 98.6 MB. Free memory was 68.4 MB in the beginning and 65.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 68.65 ms. Allocated memory is still 98.6 MB. Free memory was 65.0 MB in the beginning and 61.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1595.94 ms. Allocated memory is still 98.6 MB. Free memory was 61.5 MB in the beginning and 57.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 35.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 71186.79 ms. Allocated memory was 98.6 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 57.0 MB in the beginning and 665.3 MB in the end (delta: -608.3 MB). Peak memory consumption was 921.1 MB. Max. memory is 16.1 GB. * Witness Printer took 208.87 ms. Allocated memory is still 1.4 GB. Free memory was 665.3 MB in the beginning and 643.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: 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: 903]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: (((((((((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((s_run_pc == 0 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == 3) || ((c_empty_req == 1 && 2 == s_run_pc) && m_run_pc == 3)) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && v == 50) && c_req_d <= 50) - InvariantResult [Line: 556]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 911]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 852]: Loop Invariant Derived loop invariant: (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && req_type___0 == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 50 <= c_req_d) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 852]: Loop Invariant Derived loop invariant: ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0)) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((0 <= a_t && 50 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && 50 <= req_d) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1263]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: ((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && !(c_m_lock == 1) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && 50 <= req_d) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1271]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 748]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a_t) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 1 <= a) || (((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) || ((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 1343]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: (((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 1 <= c_m_lock - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 1279]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 1309]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 1287]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((((((m_run_pc == 6 && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((m_run_pc == 6 && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 720]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1174]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) || ((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 630]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 802]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) || ((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 1182]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50) && 1 <= a - InvariantResult [Line: 1190]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || (((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50) && 1 <= a)) || (((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && !(c_m_lock == 1)) - InvariantResult [Line: 1105]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0)) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) || ((((((((((c_empty_rsp == 1 && 0 <= a_t) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((0 <= a_t && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && req_a == 0) && !(req_type == 0)) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock)) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && i == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && v == 50) && i == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && i == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1033]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1159]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 452]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1198]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && i == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 1228]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: ((((((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50) || ((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && c_req_a == 0)) || ((((((((((((0 <= a && 0 <= a_t) && !(c_req_type == 0)) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 275 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.6s, OverallIterations: 22, TraceHistogramMax: 4, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 49.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12251 SDtfs, 15781 SDslu, 21939 SDs, 0 SdLazy, 3001 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 858 GetRequests, 712 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7429occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 40828 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 639 NumberOfFragments, 10680 HoareAnnotationTreeSize, 98 FomulaSimplifications, 25592519 FormulaSimplificationTreeSizeReduction, 11.6s HoareSimplificationTime, 98 FomulaSimplificationsInter, 4591601 FormulaSimplificationTreeSizeReductionInter, 37.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2640 NumberOfCodeBlocks, 2640 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2614 ConstructedInterpolants, 0 QuantifiedInterpolants, 1020917 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2151 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 323/447 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...