./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP --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 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:25:14,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:25:14,267 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:25:14,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:25:14,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:25:14,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:25:14,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:25:14,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:25:14,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:25:14,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:25:14,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:25:14,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:25:14,321 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:25:14,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:25:14,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:25:14,324 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:25:14,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:25:14,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:25:14,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:25:14,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:25:14,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:25:14,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:25:14,326 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:25:14,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:25:14,327 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:25:14,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:25:14,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:25:14,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:25:14,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:14,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:25:14,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:25:14,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:25:14,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:25:14,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:25:14,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:25:14,332 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:25:14,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:25:14,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:25:14,332 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:25:14,332 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/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_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP 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 -> 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 [2023-11-06 22:25:14,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:25:14,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:25:14,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:25:14,675 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:25:14,676 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:25:14,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2023-11-06 22:25:17,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:25:17,997 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:25:17,997 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2023-11-06 22:25:18,024 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/data/d19a8de47/8f5eb736eac34c10bb1553f42461a839/FLAGeea7f2ceb [2023-11-06 22:25:18,047 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/data/d19a8de47/8f5eb736eac34c10bb1553f42461a839 [2023-11-06 22:25:18,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:25:18,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:25:18,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:18,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:25:18,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:25:18,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673ac12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18, skipping insertion in model container [2023-11-06 22:25:18,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,122 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:25:18,269 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[646,659] [2023-11-06 22:25:18,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:18,404 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:25:18,416 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[646,659] [2023-11-06 22:25:18,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:18,542 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:25:18,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18 WrapperNode [2023-11-06 22:25:18,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:18,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:18,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:25:18,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:25:18,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,633 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 852 [2023-11-06 22:25:18,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:18,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:25:18,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:25:18,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:25:18,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:25:18,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:25:18,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:25:18,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:25:18,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (1/1) ... [2023-11-06 22:25:18,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:18,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:18,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:25:18,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:25:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:25:18,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:25:18,814 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-06 22:25:18,815 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-06 22:25:18,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:25:18,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:25:18,981 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:25:18,986 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:25:19,826 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:25:19,839 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:25:19,839 INFO L302 CfgBuilder]: Removed 13 assume(true) statements. [2023-11-06 22:25:19,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:19 BoogieIcfgContainer [2023-11-06 22:25:19,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:25:19,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:25:19,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:25:19,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:25:19,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:25:18" (1/3) ... [2023-11-06 22:25:19,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fd9315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:19, skipping insertion in model container [2023-11-06 22:25:19,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:18" (2/3) ... [2023-11-06 22:25:19,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fd9315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:19, skipping insertion in model container [2023-11-06 22:25:19,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:19" (3/3) ... [2023-11-06 22:25:19,851 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2023-11-06 22:25:19,872 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:25:19,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:25:19,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:25:19,944 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c2e66e5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:25:19,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:25:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 273 states, 265 states have (on average 1.8528301886792453) internal successors, (491), 271 states have internal predecessors, (491), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 22:25:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:25:19,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:19,965 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:25:19,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:19,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash 193086899, now seen corresponding path program 1 times [2023-11-06 22:25:19,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:19,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223720738] [2023-11-06 22:25:19,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:19,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:20,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:20,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223720738] [2023-11-06 22:25:20,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223720738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:20,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:20,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690744328] [2023-11-06 22:25:20,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:20,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:20,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:20,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:20,444 INFO L87 Difference]: Start difference. First operand has 273 states, 265 states have (on average 1.8528301886792453) internal successors, (491), 271 states have internal predecessors, (491), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:20,909 INFO L93 Difference]: Finished difference Result 718 states and 1317 transitions. [2023-11-06 22:25:20,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:20,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-06 22:25:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:20,936 INFO L225 Difference]: With dead ends: 718 [2023-11-06 22:25:20,936 INFO L226 Difference]: Without dead ends: 442 [2023-11-06 22:25:20,944 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:20,949 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 259 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:20,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 773 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-11-06 22:25:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 429. [2023-11-06 22:25:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 423 states have (on average 1.5933806146572105) internal successors, (674), 427 states have internal predecessors, (674), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 679 transitions. [2023-11-06 22:25:21,029 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 679 transitions. Word has length 29 [2023-11-06 22:25:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:21,030 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 679 transitions. [2023-11-06 22:25:21,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 679 transitions. [2023-11-06 22:25:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:25:21,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:21,033 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:25:21,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:25:21,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:21,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1317478755, now seen corresponding path program 1 times [2023-11-06 22:25:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449729888] [2023-11-06 22:25:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449729888] [2023-11-06 22:25:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449729888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:21,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:21,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:21,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504051339] [2023-11-06 22:25:21,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:21,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:21,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:21,140 INFO L87 Difference]: Start difference. First operand 429 states and 679 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:21,305 INFO L93 Difference]: Finished difference Result 1125 states and 1805 transitions. [2023-11-06 22:25:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:21,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-06 22:25:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:21,312 INFO L225 Difference]: With dead ends: 1125 [2023-11-06 22:25:21,312 INFO L226 Difference]: Without dead ends: 710 [2023-11-06 22:25:21,317 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:21,319 INFO L413 NwaCegarLoop]: 642 mSDtfsCounter, 322 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:21,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1016 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-11-06 22:25:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 697. [2023-11-06 22:25:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 691 states have (on average 1.6266280752532563) internal successors, (1124), 695 states have internal predecessors, (1124), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1129 transitions. [2023-11-06 22:25:21,413 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1129 transitions. Word has length 38 [2023-11-06 22:25:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:21,413 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 1129 transitions. [2023-11-06 22:25:21,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1129 transitions. [2023-11-06 22:25:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:25:21,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:21,423 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:25:21,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:25:21,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:21,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash 851929906, now seen corresponding path program 1 times [2023-11-06 22:25:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:21,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236353160] [2023-11-06 22:25:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236353160] [2023-11-06 22:25:21,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236353160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:21,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093554257] [2023-11-06 22:25:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:21,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:21,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:21,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:21,524 INFO L87 Difference]: Start difference. First operand 697 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:21,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:21,627 INFO L93 Difference]: Finished difference Result 1761 states and 2852 transitions. [2023-11-06 22:25:21,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:21,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-06 22:25:21,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:21,635 INFO L225 Difference]: With dead ends: 1761 [2023-11-06 22:25:21,636 INFO L226 Difference]: Without dead ends: 1089 [2023-11-06 22:25:21,638 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:21,639 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 349 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:21,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 809 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2023-11-06 22:25:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1078. [2023-11-06 22:25:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1072 states have (on average 1.617537313432836) internal successors, (1734), 1076 states have internal predecessors, (1734), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1739 transitions. [2023-11-06 22:25:21,727 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1739 transitions. Word has length 39 [2023-11-06 22:25:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:21,728 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 1739 transitions. [2023-11-06 22:25:21,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1739 transitions. [2023-11-06 22:25:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:25:21,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:21,731 INFO L195 NwaCegarLoop]: 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, 1, 1] [2023-11-06 22:25:21,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:25:21,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:21,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:21,733 INFO L85 PathProgramCache]: Analyzing trace with hash 18237494, now seen corresponding path program 1 times [2023-11-06 22:25:21,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:21,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875602224] [2023-11-06 22:25:21,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:21,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:21,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875602224] [2023-11-06 22:25:21,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875602224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:21,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:21,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:25:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506448061] [2023-11-06 22:25:21,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:21,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:25:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:21,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:25:21,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:25:21,871 INFO L87 Difference]: Start difference. First operand 1078 states and 1739 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:22,398 INFO L93 Difference]: Finished difference Result 2970 states and 4767 transitions. [2023-11-06 22:25:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:25:22,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-11-06 22:25:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:22,410 INFO L225 Difference]: With dead ends: 2970 [2023-11-06 22:25:22,411 INFO L226 Difference]: Without dead ends: 1917 [2023-11-06 22:25:22,412 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:22,414 INFO L413 NwaCegarLoop]: 686 mSDtfsCounter, 580 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:22,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1546 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2023-11-06 22:25:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1684. [2023-11-06 22:25:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1678 states have (on average 1.5911799761620977) internal successors, (2670), 1682 states have internal predecessors, (2670), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2675 transitions. [2023-11-06 22:25:22,534 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2675 transitions. Word has length 48 [2023-11-06 22:25:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:22,534 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 2675 transitions. [2023-11-06 22:25:22,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2675 transitions. [2023-11-06 22:25:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 22:25:22,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:22,536 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:25:22,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:25:22,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:22,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:22,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1086799520, now seen corresponding path program 1 times [2023-11-06 22:25:22,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:22,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060951031] [2023-11-06 22:25:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:22,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:22,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:22,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060951031] [2023-11-06 22:25:22,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060951031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:22,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:22,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:25:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532539822] [2023-11-06 22:25:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:22,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:25:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:25:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:25:22,622 INFO L87 Difference]: Start difference. First operand 1684 states and 2675 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:23,310 INFO L93 Difference]: Finished difference Result 4997 states and 7840 transitions. [2023-11-06 22:25:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:25:23,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-06 22:25:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:23,333 INFO L225 Difference]: With dead ends: 4997 [2023-11-06 22:25:23,333 INFO L226 Difference]: Without dead ends: 3332 [2023-11-06 22:25:23,336 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:23,338 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 734 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:23,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1045 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:25:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2023-11-06 22:25:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 2962. [2023-11-06 22:25:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2956 states have (on average 1.5639377537212449) internal successors, (4623), 2960 states have internal predecessors, (4623), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 4628 transitions. [2023-11-06 22:25:23,605 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 4628 transitions. Word has length 53 [2023-11-06 22:25:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:23,606 INFO L495 AbstractCegarLoop]: Abstraction has 2962 states and 4628 transitions. [2023-11-06 22:25:23,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 4628 transitions. [2023-11-06 22:25:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 22:25:23,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:23,608 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:25:23,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:25:23,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:23,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:23,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1057984617, now seen corresponding path program 1 times [2023-11-06 22:25:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644398295] [2023-11-06 22:25:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:23,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644398295] [2023-11-06 22:25:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644398295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:23,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:23,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:23,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787599052] [2023-11-06 22:25:23,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:23,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:23,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:23,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:23,686 INFO L87 Difference]: Start difference. First operand 2962 states and 4628 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:24,049 INFO L93 Difference]: Finished difference Result 6953 states and 10821 transitions. [2023-11-06 22:25:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-06 22:25:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:24,076 INFO L225 Difference]: With dead ends: 6953 [2023-11-06 22:25:24,076 INFO L226 Difference]: Without dead ends: 4014 [2023-11-06 22:25:24,083 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:24,088 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 364 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:24,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 704 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2023-11-06 22:25:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 3830. [2023-11-06 22:25:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3830 states, 3824 states have (on average 1.5431485355648535) internal successors, (5901), 3828 states have internal predecessors, (5901), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3830 states to 3830 states and 5906 transitions. [2023-11-06 22:25:24,425 INFO L78 Accepts]: Start accepts. Automaton has 3830 states and 5906 transitions. Word has length 53 [2023-11-06 22:25:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:24,426 INFO L495 AbstractCegarLoop]: Abstraction has 3830 states and 5906 transitions. [2023-11-06 22:25:24,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3830 states and 5906 transitions. [2023-11-06 22:25:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:25:24,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:24,435 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:25:24,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:25:24,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:24,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1793836096, now seen corresponding path program 1 times [2023-11-06 22:25:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:24,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330433114] [2023-11-06 22:25:24,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:24,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330433114] [2023-11-06 22:25:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330433114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:24,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:24,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815143105] [2023-11-06 22:25:24,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:24,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:24,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:24,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:24,564 INFO L87 Difference]: Start difference. First operand 3830 states and 5906 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:25,196 INFO L93 Difference]: Finished difference Result 9202 states and 14308 transitions. [2023-11-06 22:25:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:25,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-11-06 22:25:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:25,228 INFO L225 Difference]: With dead ends: 9202 [2023-11-06 22:25:25,228 INFO L226 Difference]: Without dead ends: 5395 [2023-11-06 22:25:25,234 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:25,235 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:25,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 873 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:25:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2023-11-06 22:25:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 4638. [2023-11-06 22:25:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4638 states, 4632 states have (on average 1.4853195164075994) internal successors, (6880), 4636 states have internal predecessors, (6880), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 6885 transitions. [2023-11-06 22:25:25,615 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 6885 transitions. Word has length 59 [2023-11-06 22:25:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:25,615 INFO L495 AbstractCegarLoop]: Abstraction has 4638 states and 6885 transitions. [2023-11-06 22:25:25,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 6885 transitions. [2023-11-06 22:25:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:25:25,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:25,618 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:25:25,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:25:25,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:25,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1530108436, now seen corresponding path program 1 times [2023-11-06 22:25:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284899394] [2023-11-06 22:25:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284899394] [2023-11-06 22:25:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284899394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:25,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:25,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499805456] [2023-11-06 22:25:25,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:25,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:25,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:25,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:25,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:25,729 INFO L87 Difference]: Start difference. First operand 4638 states and 6885 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:26,159 INFO L93 Difference]: Finished difference Result 9119 states and 13547 transitions. [2023-11-06 22:25:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-11-06 22:25:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:26,188 INFO L225 Difference]: With dead ends: 9119 [2023-11-06 22:25:26,189 INFO L226 Difference]: Without dead ends: 4504 [2023-11-06 22:25:26,197 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:26,198 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 341 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:26,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 439 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4504 states. [2023-11-06 22:25:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 4504. [2023-11-06 22:25:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4504 states, 4498 states have (on average 1.4626500666963094) internal successors, (6579), 4502 states have internal predecessors, (6579), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 6584 transitions. [2023-11-06 22:25:26,565 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 6584 transitions. Word has length 61 [2023-11-06 22:25:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:26,565 INFO L495 AbstractCegarLoop]: Abstraction has 4504 states and 6584 transitions. [2023-11-06 22:25:26,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 6584 transitions. [2023-11-06 22:25:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:25:26,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:26,568 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:25:26,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:25:26,569 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:26,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1072243498, now seen corresponding path program 1 times [2023-11-06 22:25:26,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:26,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586446978] [2023-11-06 22:25:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586446978] [2023-11-06 22:25:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586446978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:26,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310001671] [2023-11-06 22:25:26,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:26,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:26,628 INFO L87 Difference]: Start difference. First operand 4504 states and 6584 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:26,981 INFO L93 Difference]: Finished difference Result 8610 states and 12699 transitions. [2023-11-06 22:25:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-11-06 22:25:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:27,005 INFO L225 Difference]: With dead ends: 8610 [2023-11-06 22:25:27,005 INFO L226 Difference]: Without dead ends: 4129 [2023-11-06 22:25:27,011 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:27,012 INFO L413 NwaCegarLoop]: 483 mSDtfsCounter, 157 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:27,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 886 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2023-11-06 22:25:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3478. [2023-11-06 22:25:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3472 states have (on average 1.4818548387096775) internal successors, (5145), 3476 states have internal predecessors, (5145), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5150 transitions. [2023-11-06 22:25:27,281 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5150 transitions. Word has length 62 [2023-11-06 22:25:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:27,282 INFO L495 AbstractCegarLoop]: Abstraction has 3478 states and 5150 transitions. [2023-11-06 22:25:27,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5150 transitions. [2023-11-06 22:25:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:25:27,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:27,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:27,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:25:27,284 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:27,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1578233961, now seen corresponding path program 1 times [2023-11-06 22:25:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124833581] [2023-11-06 22:25:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:27,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:27,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:27,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124833581] [2023-11-06 22:25:27,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124833581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:27,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:27,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:25:27,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932885541] [2023-11-06 22:25:27,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:27,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:25:27,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:25:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:27,375 INFO L87 Difference]: Start difference. First operand 3478 states and 5150 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:28,325 INFO L93 Difference]: Finished difference Result 9559 states and 14060 transitions. [2023-11-06 22:25:28,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:25:28,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-11-06 22:25:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:28,361 INFO L225 Difference]: With dead ends: 9559 [2023-11-06 22:25:28,361 INFO L226 Difference]: Without dead ends: 6306 [2023-11-06 22:25:28,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:25:28,369 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 966 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:28,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 2408 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:25:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6306 states. [2023-11-06 22:25:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6306 to 4348. [2023-11-06 22:25:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4348 states, 4342 states have (on average 1.4755872869645326) internal successors, (6407), 4346 states have internal predecessors, (6407), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4348 states to 4348 states and 6412 transitions. [2023-11-06 22:25:28,886 INFO L78 Accepts]: Start accepts. Automaton has 4348 states and 6412 transitions. Word has length 64 [2023-11-06 22:25:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:28,886 INFO L495 AbstractCegarLoop]: Abstraction has 4348 states and 6412 transitions. [2023-11-06 22:25:28,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4348 states and 6412 transitions. [2023-11-06 22:25:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:25:28,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:28,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:28,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:25:28,889 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:28,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2113614342, now seen corresponding path program 1 times [2023-11-06 22:25:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945836890] [2023-11-06 22:25:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945836890] [2023-11-06 22:25:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945836890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:29,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:25:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731577414] [2023-11-06 22:25:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:29,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:25:29,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:29,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:25:29,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:29,002 INFO L87 Difference]: Start difference. First operand 4348 states and 6412 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:29,714 INFO L93 Difference]: Finished difference Result 10527 states and 15384 transitions. [2023-11-06 22:25:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:25:29,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-11-06 22:25:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:29,733 INFO L225 Difference]: With dead ends: 10527 [2023-11-06 22:25:29,733 INFO L226 Difference]: Without dead ends: 6404 [2023-11-06 22:25:29,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:25:29,742 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 859 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:29,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 2929 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6404 states. [2023-11-06 22:25:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6404 to 4658. [2023-11-06 22:25:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4658 states, 4652 states have (on average 1.4658211521926052) internal successors, (6819), 4656 states have internal predecessors, (6819), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 6824 transitions. [2023-11-06 22:25:30,203 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 6824 transitions. Word has length 65 [2023-11-06 22:25:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:30,203 INFO L495 AbstractCegarLoop]: Abstraction has 4658 states and 6824 transitions. [2023-11-06 22:25:30,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 6824 transitions. [2023-11-06 22:25:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 22:25:30,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:30,206 INFO L195 NwaCegarLoop]: 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, 1, 1] [2023-11-06 22:25:30,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:25:30,207 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:30,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash 142613235, now seen corresponding path program 1 times [2023-11-06 22:25:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:30,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896002744] [2023-11-06 22:25:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:30,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:30,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896002744] [2023-11-06 22:25:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896002744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:30,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:30,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:30,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850847707] [2023-11-06 22:25:30,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:30,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:30,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:30,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:30,278 INFO L87 Difference]: Start difference. First operand 4658 states and 6824 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:30,781 INFO L93 Difference]: Finished difference Result 9803 states and 14328 transitions. [2023-11-06 22:25:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2023-11-06 22:25:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:30,793 INFO L225 Difference]: With dead ends: 9803 [2023-11-06 22:25:30,794 INFO L226 Difference]: Without dead ends: 5166 [2023-11-06 22:25:30,802 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:30,802 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 131 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:30,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 810 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2023-11-06 22:25:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5092. [2023-11-06 22:25:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5092 states, 5086 states have (on average 1.4598898938261895) internal successors, (7425), 5090 states have internal predecessors, (7425), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5092 states to 5092 states and 7430 transitions. [2023-11-06 22:25:31,402 INFO L78 Accepts]: Start accepts. Automaton has 5092 states and 7430 transitions. Word has length 79 [2023-11-06 22:25:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:31,403 INFO L495 AbstractCegarLoop]: Abstraction has 5092 states and 7430 transitions. [2023-11-06 22:25:31,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5092 states and 7430 transitions. [2023-11-06 22:25:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-06 22:25:31,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:31,407 INFO L195 NwaCegarLoop]: 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] [2023-11-06 22:25:31,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:25:31,408 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:31,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1699220715, now seen corresponding path program 1 times [2023-11-06 22:25:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674327962] [2023-11-06 22:25:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:31,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:31,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674327962] [2023-11-06 22:25:31,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674327962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:31,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:31,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:25:31,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604262020] [2023-11-06 22:25:31,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:31,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:25:31,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:31,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:25:31,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:25:31,491 INFO L87 Difference]: Start difference. First operand 5092 states and 7430 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:32,666 INFO L93 Difference]: Finished difference Result 13610 states and 19696 transitions. [2023-11-06 22:25:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:25:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-11-06 22:25:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:32,697 INFO L225 Difference]: With dead ends: 13610 [2023-11-06 22:25:32,697 INFO L226 Difference]: Without dead ends: 8417 [2023-11-06 22:25:32,706 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:32,707 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 646 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:32,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1252 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8417 states. [2023-11-06 22:25:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8417 to 7555. [2023-11-06 22:25:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.4323751490263612) internal successors, (10813), 7553 states have internal predecessors, (10813), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10818 transitions. [2023-11-06 22:25:33,492 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10818 transitions. Word has length 91 [2023-11-06 22:25:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:33,493 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10818 transitions. [2023-11-06 22:25:33,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10818 transitions. [2023-11-06 22:25:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:25:33,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:33,497 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-06 22:25:33,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:25:33,497 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:33,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash -414205958, now seen corresponding path program 1 times [2023-11-06 22:25:33,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:33,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053957391] [2023-11-06 22:25:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:33,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:33,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053957391] [2023-11-06 22:25:33,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053957391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:33,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:33,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590959776] [2023-11-06 22:25:33,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:33,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:33,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:33,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:33,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:33,564 INFO L87 Difference]: Start difference. First operand 7555 states and 10818 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:33,976 INFO L93 Difference]: Finished difference Result 10913 states and 15666 transitions. [2023-11-06 22:25:33,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:33,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-11-06 22:25:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:33,985 INFO L225 Difference]: With dead ends: 10913 [2023-11-06 22:25:33,986 INFO L226 Difference]: Without dead ends: 3361 [2023-11-06 22:25:33,995 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:33,996 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 335 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:33,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 517 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2023-11-06 22:25:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3308. [2023-11-06 22:25:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3302 states have (on average 1.3452453058752272) internal successors, (4442), 3306 states have internal predecessors, (4442), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4447 transitions. [2023-11-06 22:25:34,308 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4447 transitions. Word has length 99 [2023-11-06 22:25:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:34,309 INFO L495 AbstractCegarLoop]: Abstraction has 3308 states and 4447 transitions. [2023-11-06 22:25:34,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4447 transitions. [2023-11-06 22:25:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:25:34,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:34,311 INFO L195 NwaCegarLoop]: 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, 1] [2023-11-06 22:25:34,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:25:34,312 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:34,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1527373171, now seen corresponding path program 1 times [2023-11-06 22:25:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674828519] [2023-11-06 22:25:34,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:34,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674828519] [2023-11-06 22:25:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674828519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:34,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:34,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:25:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483305554] [2023-11-06 22:25:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:34,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:25:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:25:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:25:34,397 INFO L87 Difference]: Start difference. First operand 3308 states and 4447 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:34,916 INFO L93 Difference]: Finished difference Result 7572 states and 10165 transitions. [2023-11-06 22:25:34,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:25:34,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-11-06 22:25:34,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:34,928 INFO L225 Difference]: With dead ends: 7572 [2023-11-06 22:25:34,928 INFO L226 Difference]: Without dead ends: 4441 [2023-11-06 22:25:34,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:34,934 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 549 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:34,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 2357 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4441 states. [2023-11-06 22:25:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4441 to 3310. [2023-11-06 22:25:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3310 states, 3304 states have (on average 1.3432203389830508) internal successors, (4438), 3308 states have internal predecessors, (4438), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4443 transitions. [2023-11-06 22:25:35,403 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4443 transitions. Word has length 101 [2023-11-06 22:25:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:35,403 INFO L495 AbstractCegarLoop]: Abstraction has 3310 states and 4443 transitions. [2023-11-06 22:25:35,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4443 transitions. [2023-11-06 22:25:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:25:35,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:35,409 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2023-11-06 22:25:35,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:25:35,409 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:35,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:35,410 INFO L85 PathProgramCache]: Analyzing trace with hash -653251672, now seen corresponding path program 1 times [2023-11-06 22:25:35,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:35,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573230376] [2023-11-06 22:25:35,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:35,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:35,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:35,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573230376] [2023-11-06 22:25:35,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573230376] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:35,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732616307] [2023-11-06 22:25:35,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:35,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:35,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:35,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:35,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:25:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:35,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:25:35,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:25:35,878 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:35,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732616307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:35,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:25:35,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 22:25:35,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040083688] [2023-11-06 22:25:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:35,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:35,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:35,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:35,881 INFO L87 Difference]: Start difference. First operand 3310 states and 4443 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:36,512 INFO L93 Difference]: Finished difference Result 3945 states and 5288 transitions. [2023-11-06 22:25:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:36,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-11-06 22:25:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:36,523 INFO L225 Difference]: With dead ends: 3945 [2023-11-06 22:25:36,524 INFO L226 Difference]: Without dead ends: 3941 [2023-11-06 22:25:36,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:36,527 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 229 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:36,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 795 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2023-11-06 22:25:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3891. [2023-11-06 22:25:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 3885 states have (on average 1.3397683397683398) internal successors, (5205), 3889 states have internal predecessors, (5205), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 5210 transitions. [2023-11-06 22:25:37,118 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 5210 transitions. Word has length 103 [2023-11-06 22:25:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:37,118 INFO L495 AbstractCegarLoop]: Abstraction has 3891 states and 5210 transitions. [2023-11-06 22:25:37,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 5210 transitions. [2023-11-06 22:25:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-06 22:25:37,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:37,123 INFO L195 NwaCegarLoop]: 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, 1, 1] [2023-11-06 22:25:37,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:25:37,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:25:37,330 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:37,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash -182113054, now seen corresponding path program 1 times [2023-11-06 22:25:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549313767] [2023-11-06 22:25:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:37,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:37,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549313767] [2023-11-06 22:25:37,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549313767] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:37,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29349639] [2023-11-06 22:25:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:37,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:37,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:37,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:37,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:25:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:37,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:25:37,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:25:37,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29349639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:37,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:25:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 22:25:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465684910] [2023-11-06 22:25:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:37,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:37,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:37,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:37,814 INFO L87 Difference]: Start difference. First operand 3891 states and 5210 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:38,213 INFO L93 Difference]: Finished difference Result 6926 states and 9320 transitions. [2023-11-06 22:25:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:38,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2023-11-06 22:25:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:38,222 INFO L225 Difference]: With dead ends: 6926 [2023-11-06 22:25:38,222 INFO L226 Difference]: Without dead ends: 3040 [2023-11-06 22:25:38,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:38,229 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 260 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:38,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2023-11-06 22:25:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 2818. [2023-11-06 22:25:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2812 states have (on average 1.3182788051209104) internal successors, (3707), 2816 states have internal predecessors, (3707), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3712 transitions. [2023-11-06 22:25:38,571 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3712 transitions. Word has length 157 [2023-11-06 22:25:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:38,571 INFO L495 AbstractCegarLoop]: Abstraction has 2818 states and 3712 transitions. [2023-11-06 22:25:38,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3712 transitions. [2023-11-06 22:25:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 22:25:38,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:38,575 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 22:25:38,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:38,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:38,781 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:38,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1837024668, now seen corresponding path program 1 times [2023-11-06 22:25:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:38,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777343526] [2023-11-06 22:25:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:25:38,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:38,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777343526] [2023-11-06 22:25:38,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777343526] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:38,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255524709] [2023-11-06 22:25:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:38,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:38,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:38,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:38,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:25:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:39,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:25:39,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:25:39,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:39,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255524709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:39,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:25:39,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 22:25:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004622731] [2023-11-06 22:25:39,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:39,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:39,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:39,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:39,166 INFO L87 Difference]: Start difference. First operand 2818 states and 3712 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:39,546 INFO L93 Difference]: Finished difference Result 5464 states and 7237 transitions. [2023-11-06 22:25:39,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:39,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2023-11-06 22:25:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:39,554 INFO L225 Difference]: With dead ends: 5464 [2023-11-06 22:25:39,554 INFO L226 Difference]: Without dead ends: 2818 [2023-11-06 22:25:39,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:39,559 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 270 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:39,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 390 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2023-11-06 22:25:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2023-11-06 22:25:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2812 states have (on average 1.2841394025604551) internal successors, (3611), 2816 states have internal predecessors, (3611), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3616 transitions. [2023-11-06 22:25:39,892 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3616 transitions. Word has length 160 [2023-11-06 22:25:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:39,892 INFO L495 AbstractCegarLoop]: Abstraction has 2818 states and 3616 transitions. [2023-11-06 22:25:39,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3616 transitions. [2023-11-06 22:25:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-06 22:25:39,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:39,896 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:39,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:40,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:25:40,102 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:40,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash -321422549, now seen corresponding path program 1 times [2023-11-06 22:25:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:40,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561838670] [2023-11-06 22:25:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:25:40,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:40,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561838670] [2023-11-06 22:25:40,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561838670] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:40,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401096503] [2023-11-06 22:25:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:40,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:40,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:40,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:40,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:25:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:40,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:25:40,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:25:40,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:40,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401096503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:40,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:25:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 22:25:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122495628] [2023-11-06 22:25:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:40,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:40,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:40,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:40,448 INFO L87 Difference]: Start difference. First operand 2818 states and 3616 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:41,147 INFO L93 Difference]: Finished difference Result 6367 states and 8330 transitions. [2023-11-06 22:25:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:41,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2023-11-06 22:25:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:41,156 INFO L225 Difference]: With dead ends: 6367 [2023-11-06 22:25:41,156 INFO L226 Difference]: Without dead ends: 3721 [2023-11-06 22:25:41,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:41,161 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 201 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:41,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 654 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:25:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2023-11-06 22:25:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3633. [2023-11-06 22:25:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3627 states have (on average 1.2514474772539288) internal successors, (4539), 3631 states have internal predecessors, (4539), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 4544 transitions. [2023-11-06 22:25:41,535 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 4544 transitions. Word has length 161 [2023-11-06 22:25:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:41,535 INFO L495 AbstractCegarLoop]: Abstraction has 3633 states and 4544 transitions. [2023-11-06 22:25:41,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 4544 transitions. [2023-11-06 22:25:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-06 22:25:41,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:41,539 INFO L195 NwaCegarLoop]: 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, 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] [2023-11-06 22:25:41,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:41,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:41,745 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:41,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash 920589941, now seen corresponding path program 1 times [2023-11-06 22:25:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:41,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240520854] [2023-11-06 22:25:41,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:25:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240520854] [2023-11-06 22:25:42,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240520854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:42,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989713944] [2023-11-06 22:25:42,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:42,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:42,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:42,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:42,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:25:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:42,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:25:42,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:25:42,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:25:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:25:42,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989713944] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:25:42,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:25:42,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2023-11-06 22:25:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100832946] [2023-11-06 22:25:42,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:25:42,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:25:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:42,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:25:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:25:42,654 INFO L87 Difference]: Start difference. First operand 3633 states and 4544 transitions. Second operand has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:44,014 INFO L93 Difference]: Finished difference Result 9805 states and 12280 transitions. [2023-11-06 22:25:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:25:44,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2023-11-06 22:25:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:44,029 INFO L225 Difference]: With dead ends: 9805 [2023-11-06 22:25:44,029 INFO L226 Difference]: Without dead ends: 6344 [2023-11-06 22:25:44,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:25:44,038 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 941 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 4304 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:44,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 4304 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:25:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6344 states. [2023-11-06 22:25:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6344 to 5146. [2023-11-06 22:25:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5140 states have (on average 1.2560311284046692) internal successors, (6456), 5144 states have internal predecessors, (6456), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 6461 transitions. [2023-11-06 22:25:44,686 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 6461 transitions. Word has length 163 [2023-11-06 22:25:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:44,686 INFO L495 AbstractCegarLoop]: Abstraction has 5146 states and 6461 transitions. [2023-11-06 22:25:44,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 6461 transitions. [2023-11-06 22:25:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2023-11-06 22:25:44,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:44,692 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:44,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:44,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:44,898 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:44,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -763703227, now seen corresponding path program 1 times [2023-11-06 22:25:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:44,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694930761] [2023-11-06 22:25:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 103 proven. 103 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:25:45,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:45,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694930761] [2023-11-06 22:25:45,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694930761] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146961926] [2023-11-06 22:25:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:45,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:45,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:45,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:45,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:25:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:25:45,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:25:45,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146961926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:45,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:25:45,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2023-11-06 22:25:45,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902684868] [2023-11-06 22:25:45,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:45,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:25:45,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:45,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:25:45,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:25:45,711 INFO L87 Difference]: Start difference. First operand 5146 states and 6461 transitions. Second operand has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:46,848 INFO L93 Difference]: Finished difference Result 10813 states and 13574 transitions. [2023-11-06 22:25:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:25:46,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2023-11-06 22:25:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:46,865 INFO L225 Difference]: With dead ends: 10813 [2023-11-06 22:25:46,865 INFO L226 Difference]: Without dead ends: 5836 [2023-11-06 22:25:46,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:25:46,874 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 1048 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:46,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 2423 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5836 states. [2023-11-06 22:25:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5836 to 5015. [2023-11-06 22:25:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5015 states, 5009 states have (on average 1.2537432621281692) internal successors, (6280), 5013 states have internal predecessors, (6280), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 6285 transitions. [2023-11-06 22:25:47,618 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 6285 transitions. Word has length 263 [2023-11-06 22:25:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:47,618 INFO L495 AbstractCegarLoop]: Abstraction has 5015 states and 6285 transitions. [2023-11-06 22:25:47,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 6285 transitions. [2023-11-06 22:25:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2023-11-06 22:25:47,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:47,624 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:25:47,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-06 22:25:47,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:47,834 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:47,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:47,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1019295115, now seen corresponding path program 1 times [2023-11-06 22:25:47,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:47,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993410027] [2023-11-06 22:25:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:47,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-06 22:25:47,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993410027] [2023-11-06 22:25:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993410027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:47,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:47,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848888473] [2023-11-06 22:25:47,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:47,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:47,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:47,940 INFO L87 Difference]: Start difference. First operand 5015 states and 6285 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:48,240 INFO L93 Difference]: Finished difference Result 5886 states and 7262 transitions. [2023-11-06 22:25:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:48,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2023-11-06 22:25:48,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:48,244 INFO L225 Difference]: With dead ends: 5886 [2023-11-06 22:25:48,244 INFO L226 Difference]: Without dead ends: 924 [2023-11-06 22:25:48,248 INFO L412 NwaCegarLoop]: 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 [2023-11-06 22:25:48,249 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 130 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:48,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 388 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2023-11-06 22:25:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 921. [2023-11-06 22:25:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 917 states have (on average 1.0828789531079608) internal successors, (993), 919 states have internal predecessors, (993), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 996 transitions. [2023-11-06 22:25:48,408 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 996 transitions. Word has length 264 [2023-11-06 22:25:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:48,409 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 996 transitions. [2023-11-06 22:25:48,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 996 transitions. [2023-11-06 22:25:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2023-11-06 22:25:48,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:48,412 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:25:48,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:25:48,412 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:48,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1686235295, now seen corresponding path program 1 times [2023-11-06 22:25:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:48,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394065765] [2023-11-06 22:25:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-06 22:25:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:48,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394065765] [2023-11-06 22:25:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394065765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:48,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:48,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:25:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613751372] [2023-11-06 22:25:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:48,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:25:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:48,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:25:48,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:48,628 INFO L87 Difference]: Start difference. First operand 921 states and 996 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:48,903 INFO L93 Difference]: Finished difference Result 1240 states and 1339 transitions. [2023-11-06 22:25:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:25:48,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2023-11-06 22:25:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:48,907 INFO L225 Difference]: With dead ends: 1240 [2023-11-06 22:25:48,907 INFO L226 Difference]: Without dead ends: 939 [2023-11-06 22:25:48,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:25:48,909 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 230 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:48,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1455 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2023-11-06 22:25:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 919. [2023-11-06 22:25:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 915 states have (on average 1.0786885245901638) internal successors, (987), 917 states have internal predecessors, (987), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 990 transitions. [2023-11-06 22:25:49,070 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 990 transitions. Word has length 265 [2023-11-06 22:25:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:49,071 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 990 transitions. [2023-11-06 22:25:49,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 990 transitions. [2023-11-06 22:25:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-11-06 22:25:49,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:49,074 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:49,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:25:49,074 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:49,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash -232946174, now seen corresponding path program 1 times [2023-11-06 22:25:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:49,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096804411] [2023-11-06 22:25:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-06 22:25:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:49,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096804411] [2023-11-06 22:25:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096804411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:49,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:25:49,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177943226] [2023-11-06 22:25:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:49,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:25:49,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:49,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:25:49,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:25:49,296 INFO L87 Difference]: Start difference. First operand 919 states and 990 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:49,508 INFO L93 Difference]: Finished difference Result 1213 states and 1303 transitions. [2023-11-06 22:25:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:25:49,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2023-11-06 22:25:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:49,511 INFO L225 Difference]: With dead ends: 1213 [2023-11-06 22:25:49,512 INFO L226 Difference]: Without dead ends: 910 [2023-11-06 22:25:49,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:49,513 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 180 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:49,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 851 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2023-11-06 22:25:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 902. [2023-11-06 22:25:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 899 states have (on average 1.0622914349276975) internal successors, (955), 900 states have internal predecessors, (955), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 957 transitions. [2023-11-06 22:25:49,670 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 957 transitions. Word has length 266 [2023-11-06 22:25:49,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:49,670 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 957 transitions. [2023-11-06 22:25:49,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 957 transitions. [2023-11-06 22:25:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-11-06 22:25:49,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:49,674 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:49,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:25:49,674 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:49,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1219154648, now seen corresponding path program 1 times [2023-11-06 22:25:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:49,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261283249] [2023-11-06 22:25:49,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 38 proven. 142 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-06 22:25:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:51,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261283249] [2023-11-06 22:25:51,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261283249] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:51,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822710824] [2023-11-06 22:25:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:51,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:51,221 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:51,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:25:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:51,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:25:51,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 40 proven. 123 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-06 22:25:52,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:25:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 148 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-06 22:25:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822710824] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:25:52,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:25:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 30 [2023-11-06 22:25:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277248244] [2023-11-06 22:25:52,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:25:52,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 22:25:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:52,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:25:52,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:25:52,745 INFO L87 Difference]: Start difference. First operand 902 states and 957 transitions. Second operand has 30 states, 30 states have (on average 13.766666666666667) internal successors, (413), 30 states have internal predecessors, (413), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:53,612 INFO L93 Difference]: Finished difference Result 920 states and 974 transitions. [2023-11-06 22:25:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:25:53,612 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 13.766666666666667) internal successors, (413), 30 states have internal predecessors, (413), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2023-11-06 22:25:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:53,615 INFO L225 Difference]: With dead ends: 920 [2023-11-06 22:25:53,615 INFO L226 Difference]: Without dead ends: 917 [2023-11-06 22:25:53,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=1842, Unknown=0, NotChecked=0, Total=2070 [2023-11-06 22:25:53,617 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 669 mSDsluCounter, 7396 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 7785 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:53,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 7785 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2023-11-06 22:25:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 902. [2023-11-06 22:25:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 899 states have (on average 1.061179087875417) internal successors, (954), 900 states have internal predecessors, (954), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 956 transitions. [2023-11-06 22:25:53,794 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 956 transitions. Word has length 325 [2023-11-06 22:25:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:53,795 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 956 transitions. [2023-11-06 22:25:53,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 13.766666666666667) internal successors, (413), 30 states have internal predecessors, (413), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 956 transitions. [2023-11-06 22:25:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2023-11-06 22:25:53,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:53,798 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:25:53,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:53,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:54,000 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:54,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:54,000 INFO L85 PathProgramCache]: Analyzing trace with hash 200109303, now seen corresponding path program 1 times [2023-11-06 22:25:54,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:54,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796747627] [2023-11-06 22:25:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 139 proven. 48 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-06 22:25:54,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:54,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796747627] [2023-11-06 22:25:54,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796747627] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:54,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473522477] [2023-11-06 22:25:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:54,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:54,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:54,602 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:54,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:25:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:25:54,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 139 proven. 48 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-06 22:25:55,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:25:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 139 proven. 48 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-06 22:25:55,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473522477] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:25:55,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:25:55,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2023-11-06 22:25:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497120093] [2023-11-06 22:25:55,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:25:55,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:25:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:25:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:25:55,208 INFO L87 Difference]: Start difference. First operand 902 states and 956 transitions. Second operand has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:55,583 INFO L93 Difference]: Finished difference Result 1016 states and 1073 transitions. [2023-11-06 22:25:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:25:55,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372 [2023-11-06 22:25:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:55,587 INFO L225 Difference]: With dead ends: 1016 [2023-11-06 22:25:55,587 INFO L226 Difference]: Without dead ends: 912 [2023-11-06 22:25:55,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:25:55,589 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 447 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:55,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2346 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2023-11-06 22:25:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 901. [2023-11-06 22:25:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 899 states have (on average 1.0567296996662958) internal successors, (950), 899 states have internal predecessors, (950), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 951 transitions. [2023-11-06 22:25:55,726 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 951 transitions. Word has length 372 [2023-11-06 22:25:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:55,726 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 951 transitions. [2023-11-06 22:25:55,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:25:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 951 transitions. [2023-11-06 22:25:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2023-11-06 22:25:55,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:55,730 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:55,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:55,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:55,935 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:55,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2022630306, now seen corresponding path program 1 times [2023-11-06 22:25:55,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:55,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593160865] [2023-11-06 22:25:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 73 proven. 357 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:25:57,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593160865] [2023-11-06 22:25:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593160865] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395824987] [2023-11-06 22:25:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:57,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:57,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:57,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:57,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:25:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:57,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 22:25:57,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 91 proven. 339 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:25:58,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:25:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 20 proven. 410 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:25:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395824987] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:25:59,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:25:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 35 [2023-11-06 22:25:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536371097] [2023-11-06 22:25:59,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:25:59,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 22:25:59,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:25:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1099, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:25:59,603 INFO L87 Difference]: Start difference. First operand 901 states and 951 transitions. Second operand has 35 states, 35 states have (on average 18.914285714285715) internal successors, (662), 35 states have internal predecessors, (662), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:26:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:00,717 INFO L93 Difference]: Finished difference Result 912 states and 962 transitions. [2023-11-06 22:26:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-06 22:26:00,717 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 18.914285714285715) internal successors, (662), 35 states have internal predecessors, (662), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2023-11-06 22:26:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:00,718 INFO L225 Difference]: With dead ends: 912 [2023-11-06 22:26:00,718 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:26:00,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=3225, Unknown=0, NotChecked=0, Total=3540 [2023-11-06 22:26:00,721 INFO L413 NwaCegarLoop]: 524 mSDtfsCounter, 908 mSDsluCounter, 10503 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 11027 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:00,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 11027 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:26:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:26:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:26:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:26:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:26:00,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 433 [2023-11-06 22:26:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:00,723 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:26:00,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 18.914285714285715) internal successors, (662), 35 states have internal predecessors, (662), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:26:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:26:00,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:26:00,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:26:00,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:00,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-06 22:26:00,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:26:05,974 WARN L293 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 205 DAG size of output: 230 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:26:21,567 WARN L293 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 249 DAG size of output: 365 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:27:16,286 WARN L293 SmtUtils]: Spent 46.88s on a formula simplification. DAG size of input: 190 DAG size of output: 278 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:27:49,670 INFO L899 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2023-11-06 22:27:49,671 INFO L895 garLoopResultBuilder]: At program point $Ultimate##406(lines 769 813) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse2 (= ~req_tt_a~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10))) [2023-11-06 22:27:49,671 INFO L899 garLoopResultBuilder]: For program point L696(lines 696 700) no Hoare annotation was computed. [2023-11-06 22:27:49,672 INFO L895 garLoopResultBuilder]: At program point $Ultimate##412(lines 777 812) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse2 (= ~req_tt_a~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10))) [2023-11-06 22:27:49,672 INFO L899 garLoopResultBuilder]: For program point L1093(lines 1093 1097) no Hoare annotation was computed. [2023-11-06 22:27:49,673 INFO L895 garLoopResultBuilder]: At program point $Ultimate##418(lines 785 811) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse2 (= ~req_tt_a~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10))) [2023-11-06 22:27:49,673 INFO L899 garLoopResultBuilder]: For program point L631(lines 623 640) no Hoare annotation was computed. [2023-11-06 22:27:49,673 INFO L895 garLoopResultBuilder]: At program point $Ultimate##424(lines 793 810) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse2 (= ~req_tt_a~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10))) [2023-11-06 22:27:49,674 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2023-11-06 22:27:49,674 INFO L895 garLoopResultBuilder]: At program point L500-2(lines 500 528) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 .cse10) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res#1| 50) (= ~c_req_type~0 0) .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse9 .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,675 INFO L895 garLoopResultBuilder]: At program point s_run_returnLabel#1(lines 856 1117) the Hoare annotation is: (let ((.cse7 (= ~m_run_pc~0 6)) (.cse13 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse11 (<= 1 ~a_t~0)) (.cse12 (= ~s_memory0~0 50)) (.cse9 (= ~m_run_pc~0 3)) (.cse14 (= ~s_memory1~0 51)) (.cse10 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~c_req_a~0 0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse16 (= ~a_t~0 0)) (.cse8 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse10 .cse0 .cse1 .cse11 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse2 (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse12 .cse3 .cse4 .cse5 .cse7 .cse13 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse14) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse10 .cse0 .cse15 .cse1 (= ~c_rsp_d~0 50) .cse2 (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse12 .cse3 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse4 .cse5 .cse7 .cse16 .cse13 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse5 .cse9 .cse16 .cse8 (= ~c_req_d~0 50)) (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse11 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse2 .cse12 .cse3 .cse4 .cse5 .cse9 .cse8 .cse14) (and .cse10 .cse0 .cse15 .cse2 (not (= ~c_m_lock~0 1)) .cse3 .cse4 .cse5 .cse6 .cse16 .cse8 (= ~m_run_pc~0 0)))) [2023-11-06 22:27:49,675 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2023-11-06 22:27:49,675 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2023-11-06 22:27:49,675 INFO L899 garLoopResultBuilder]: For program point L1227(lines 1175 1354) no Hoare annotation was computed. [2023-11-06 22:27:49,676 INFO L895 garLoopResultBuilder]: At program point $Ultimate##430(lines 801 809) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse2 (= ~req_tt_a~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10))) [2023-11-06 22:27:49,676 INFO L899 garLoopResultBuilder]: For program point L501(lines 500 528) no Hoare annotation was computed. [2023-11-06 22:27:49,676 INFO L899 garLoopResultBuilder]: For program point L369(lines 139 485) no Hoare annotation was computed. [2023-11-06 22:27:49,676 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1232) no Hoare annotation was computed. [2023-11-06 22:27:49,677 INFO L895 garLoopResultBuilder]: At program point $Ultimate##200(lines 369 377) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse9 (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,677 INFO L895 garLoopResultBuilder]: At program point $Ultimate##442(lines 823 831) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse2 (= ~req_tt_a~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10))) [2023-11-06 22:27:49,678 INFO L895 garLoopResultBuilder]: At program point $Ultimate##606(lines 1276 1320) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~c_req_a~0 0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse4 (= ~c_empty_rsp~0 1)) (.cse18 (= ~a_t~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse15 (= ~s_memory0~0 50)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse16 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse10 .cse11 .cse0 .cse1 (<= 0 ~a_t~0) .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13) (and (= 51 ~c_req_d~0) .cse10 .cse11 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse13 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse17 .cse10 .cse6 .cse11 (= ~c_rsp_d~0 50) .cse0 (= ~req_tt_a~0 0) .cse15 .cse1 .cse2 .cse3 .cse12 .cse18 .cse13 .cse16) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse10 .cse11 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse18 .cse13 (= ~c_req_d~0 50)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse18 .cse13 .cse9) (and .cse17 .cse10 .cse11 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse0 (= ~req_tt_a~0 1) .cse15 .cse1 .cse2 .cse3 .cse12 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse16))) [2023-11-06 22:27:49,678 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 506) no Hoare annotation was computed. [2023-11-06 22:27:49,679 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-11-06 22:27:49,679 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2023-11-06 22:27:49,679 INFO L895 garLoopResultBuilder]: At program point L1031(lines 1005 1032) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= ~m_run_pc~0 6)) (.cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse16 (<= 1 ~a_t~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse12 (= ~s_memory1~0 51)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~s_memory0~0 50)) (.cse5 (= ~c_empty_req~0 1)) (.cse13 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~m_run_pc~0 3)) (.cse9 (= ~a_t~0 0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse15 (= ~c_req_d~0 50))) (or (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse3 .cse4 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse14 .cse9 .cse11 .cse15) (and .cse0 .cse1 .cse2 .cse16 (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse12) (and (= 51 ~c_req_d~0) .cse1 .cse2 .cse16 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse11 .cse12) (and .cse1 .cse2 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse3 .cse5 .cse13 .cse6 .cse14 .cse9 .cse11 .cse15))) [2023-11-06 22:27:49,680 INFO L895 garLoopResultBuilder]: At program point $Ultimate##612(lines 1284 1319) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~c_req_a~0 0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse4 (= ~c_empty_rsp~0 1)) (.cse18 (= ~a_t~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse15 (= ~s_memory0~0 50)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse16 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse10 .cse11 .cse0 .cse1 (<= 0 ~a_t~0) .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13) (and (= 51 ~c_req_d~0) .cse10 .cse11 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse13 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse17 .cse10 .cse6 .cse11 (= ~c_rsp_d~0 50) .cse0 (= ~req_tt_a~0 0) .cse15 .cse1 .cse2 .cse3 .cse12 .cse18 .cse13 .cse16) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse10 .cse11 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse18 .cse13 (= ~c_req_d~0 50)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse18 .cse13 .cse9) (and .cse17 .cse10 .cse11 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse0 (= ~req_tt_a~0 1) .cse15 .cse1 .cse2 .cse3 .cse12 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse16))) [2023-11-06 22:27:49,681 INFO L895 garLoopResultBuilder]: At program point $Ultimate##618(lines 1292 1318) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~c_req_a~0 0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse4 (= ~c_empty_rsp~0 1)) (.cse18 (= ~a_t~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse15 (= ~s_memory0~0 50)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse16 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse10 .cse11 .cse0 .cse1 (<= 0 ~a_t~0) .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13) (and (= 51 ~c_req_d~0) .cse10 .cse11 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse13 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse17 .cse10 .cse6 .cse11 (= ~c_rsp_d~0 50) .cse0 (= ~req_tt_a~0 0) .cse15 .cse1 .cse2 .cse3 .cse12 .cse18 .cse13 .cse16) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse10 .cse11 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse18 .cse13 (= ~c_req_d~0 50)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse18 .cse13 .cse9) (and .cse17 .cse10 .cse11 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse0 (= ~req_tt_a~0 1) .cse15 .cse1 .cse2 .cse3 .cse12 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse16))) [2023-11-06 22:27:49,681 INFO L899 garLoopResultBuilder]: For program point L569(lines 569 622) no Hoare annotation was computed. [2023-11-06 22:27:49,681 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 135) no Hoare annotation was computed. [2023-11-06 22:27:49,681 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 840) no Hoare annotation was computed. [2023-11-06 22:27:49,681 INFO L899 garLoopResultBuilder]: For program point L834-1(lines 834 840) no Hoare annotation was computed. [2023-11-06 22:27:49,682 INFO L895 garLoopResultBuilder]: At program point $Ultimate##624(lines 1300 1317) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~c_req_a~0 0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse4 (= ~c_empty_rsp~0 1)) (.cse18 (= ~a_t~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse15 (= ~s_memory0~0 50)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse16 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse10 .cse11 .cse0 .cse1 (<= 0 ~a_t~0) .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13) (and (= 51 ~c_req_d~0) .cse10 .cse11 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse13 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse17 .cse10 .cse6 .cse11 (= ~c_rsp_d~0 50) .cse0 (= ~req_tt_a~0 0) .cse15 .cse1 .cse2 .cse3 .cse12 .cse18 .cse13 .cse16) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse10 .cse11 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse18 .cse13 (= ~c_req_d~0 50)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse18 .cse13 .cse9) (and .cse17 .cse10 .cse11 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse0 (= ~req_tt_a~0 1) .cse15 .cse1 .cse2 .cse3 .cse12 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse16))) [2023-11-06 22:27:49,682 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 574) no Hoare annotation was computed. [2023-11-06 22:27:49,683 INFO L895 garLoopResultBuilder]: At program point m_run_returnLabel#1(lines 90 849) the Hoare annotation is: (let ((.cse4 (= ~c_req_a~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse14 (= ~s_memory1~0 51)) (.cse20 (= ~s_run_pc~0 0)) (.cse12 (= ~c_req_type~0 0)) (.cse17 (= ~c_req_a~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (= ~c_req_type~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse18 (= ~a_t~0 0)) (.cse19 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse21 (= ~c_req_d~0 50)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~a_t~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse13 (= ~m_run_pc~0 6)) (.cse10 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse11 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse3 .cse4 (= ~req_tt_a~0 1) .cse5 .cse6 .cse7 .cse8 .cse13 .cse10 .cse11 .cse14 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and .cse6 .cse15 .cse7 .cse8 .cse9) (and .cse0 .cse16 .cse6 .cse7 .cse8 .cse9) (and .cse0 (<= 0 |ULTIMATE.start_m_run_~a~0#1|) .cse1 .cse16 .cse6 (<= 0 ~a_t~0) .cse7 .cse8 .cse13 .cse11) (and .cse12 .cse0 .cse17 .cse1 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse5 .cse6 .cse7 .cse8 .cse13 .cse18 .cse19 .cse11 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse20 .cse7 .cse8 .cse9 .cse18 .cse19 .cse11 .cse21) (and .cse17 .cse16 .cse20 .cse7 .cse8 .cse9 (not .cse12)) (and .cse0 .cse17 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse18 .cse19 .cse11 .cse21) (and .cse0 .cse3 .cse16 .cse6 .cse15 .cse7 .cse8 .cse13 .cse10 .cse11))) [2023-11-06 22:27:49,683 INFO L895 garLoopResultBuilder]: At program point $Ultimate##630(lines 1308 1316) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~c_req_a~0 0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse4 (= ~c_empty_rsp~0 1)) (.cse18 (= ~a_t~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse15 (= ~s_memory0~0 50)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse16 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse10 .cse11 .cse0 .cse1 (<= 0 ~a_t~0) .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13) (and (= 51 ~c_req_d~0) .cse10 .cse11 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse13 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse17 .cse10 .cse6 .cse11 (= ~c_rsp_d~0 50) .cse0 (= ~req_tt_a~0 0) .cse15 .cse1 .cse2 .cse3 .cse12 .cse18 .cse13 .cse16) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse10 .cse11 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse18 .cse13 (= ~c_req_d~0 50)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse18 .cse13 .cse9) (and .cse17 .cse10 .cse11 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse0 (= ~req_tt_a~0 1) .cse15 .cse1 .cse2 .cse3 .cse12 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse16))) [2023-11-06 22:27:49,684 INFO L899 garLoopResultBuilder]: For program point L1100(lines 1092 1109) no Hoare annotation was computed. [2023-11-06 22:27:49,684 INFO L895 garLoopResultBuilder]: At program point L836(line 836) the Hoare annotation is: false [2023-11-06 22:27:49,684 INFO L895 garLoopResultBuilder]: At program point $Ultimate##642(lines 1330 1338) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~c_req_a~0 0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse4 (= ~c_empty_rsp~0 1)) (.cse18 (= ~a_t~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse15 (= ~s_memory0~0 50)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse16 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse10 .cse11 .cse0 .cse1 (<= 0 ~a_t~0) .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13) (and (= 51 ~c_req_d~0) .cse10 .cse11 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse13 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse17 .cse10 .cse6 .cse11 (= ~c_rsp_d~0 50) .cse0 (= ~req_tt_a~0 0) .cse15 .cse1 .cse2 .cse3 .cse12 .cse18 .cse13 .cse16) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse10 .cse11 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse18 .cse13 (= ~c_req_d~0 50)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse18 .cse13 .cse9) (and .cse17 .cse10 .cse11 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse0 (= ~req_tt_a~0 1) .cse15 .cse1 .cse2 .cse3 .cse12 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse16))) [2023-11-06 22:27:49,684 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 774) no Hoare annotation was computed. [2023-11-06 22:27:49,685 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 708) no Hoare annotation was computed. [2023-11-06 22:27:49,685 INFO L899 garLoopResultBuilder]: For program point L110(lines 110 134) no Hoare annotation was computed. [2023-11-06 22:27:49,685 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1105) no Hoare annotation was computed. [2023-11-06 22:27:49,685 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1356 1381) the Hoare annotation is: true [2023-11-06 22:27:49,685 INFO L899 garLoopResultBuilder]: For program point L1301(lines 1301 1305) no Hoare annotation was computed. [2023-11-06 22:27:49,685 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 248) no Hoare annotation was computed. [2023-11-06 22:27:49,685 INFO L899 garLoopResultBuilder]: For program point L971(lines 971 975) no Hoare annotation was computed. [2023-11-06 22:27:49,686 INFO L895 garLoopResultBuilder]: At program point L179(lines 149 180) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse3 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse13 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse15 (= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_m_lock~0 1))) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse3 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse16 .cse5 .cse9 .cse10 .cse11 .cse13 .cse15) (and .cse1 .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) .cse5 (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_run_pc~0 3) .cse12 .cse14 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)))) [2023-11-06 22:27:49,686 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 133) no Hoare annotation was computed. [2023-11-06 22:27:49,686 INFO L899 garLoopResultBuilder]: For program point L1038(lines 1038 1091) no Hoare annotation was computed. [2023-11-06 22:27:49,686 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-11-06 22:27:49,686 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2023-11-06 22:27:49,687 INFO L895 garLoopResultBuilder]: At program point L643-2(lines 643 671) the Hoare annotation is: (let ((.cse11 (= ~a_t~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse12 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (= ~c_req_type~0 0)) (.cse16 (= ~c_req_a~0 1)) (.cse17 (= ~req_tt_a~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse14 (= ~s_memory1~0 51)) (.cse19 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (.cse15 (<= 1 ~a_t~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse10 (= ~m_run_pc~0 6)) (.cse18 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse7 (= 2 ~s_run_pc~0)) (.cse21 (<= 0 ~a_t~0)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_m_ev~0))) (or (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 .cse2 .cse3 (= ~c_rsp_d~0 50) .cse4 .cse5 (= ~req_tt_a~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse15 (= 51 ~c_rsp_d~0) .cse16 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse14 .cse19) (and .cse0 .cse1 .cse3 .cse16 .cse6 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse7 .cse9 .cse20 .cse10 .cse11 .cse13 .cse14 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse21 .cse9 .cse20 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse16 .cse17 .cse6 .cse7 .cse21 .cse9 .cse20 .cse10 .cse18 .cse13 .cse14 .cse19) (and .cse1 .cse15 .cse4 .cse7 .cse8 .cse9 .cse20 .cse10 .cse18 .cse13) (and .cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|) .cse3 .cse4 .cse7 .cse21 .cse9 .cse20 .cse13))) [2023-11-06 22:27:49,687 INFO L899 garLoopResultBuilder]: For program point L644(lines 643 671) no Hoare annotation was computed. [2023-11-06 22:27:49,687 INFO L899 garLoopResultBuilder]: For program point L578(lines 578 582) no Hoare annotation was computed. [2023-11-06 22:27:49,687 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 132) no Hoare annotation was computed. [2023-11-06 22:27:49,687 INFO L895 garLoopResultBuilder]: At program point L909(lines 883 910) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse14 (<= 1 ~a_t~0)) (.cse15 (= ~c_req_a~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= 2 ~s_run_pc~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory1~0 51)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse13 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 3)) (.cse10 (= ~a_t~0 0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse17 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= 51 ~c_req_d~0) .cse1 .cse3 .cse13 .cse14 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse11) (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse17) (and .cse0 .cse1 .cse3 .cse14 .cse15 .cse4 (= ~req_tt_a~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse13 .cse4 (= ~s_run_pc~0 0) .cse7 .cse8 .cse16 .cse10 .cse11 .cse17))) [2023-11-06 22:27:49,688 INFO L899 garLoopResultBuilder]: For program point L645(lines 645 649) no Hoare annotation was computed. [2023-11-06 22:27:49,688 INFO L895 garLoopResultBuilder]: At program point L183-2(lines 183 211) the Hoare annotation is: (let ((.cse2 (= ~s_run_pc~0 0)) (.cse14 (= ~c_req_type~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~c_req_a~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse0 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse16 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse10 .cse11 .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse12 .cse13 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)) (and .cse14 .cse8 .cse15 .cse9 .cse0 .cse2 .cse16 .cse11 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7) (and .cse14 .cse8 .cse15 .cse9 .cse0 .cse1 .cse16 .cse10 .cse11 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7))) [2023-11-06 22:27:49,688 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 782) no Hoare annotation was computed. [2023-11-06 22:27:49,688 INFO L899 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2023-11-06 22:27:49,688 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_MUTEX2#1(lines 106 848) the Hoare annotation is: false [2023-11-06 22:27:49,689 INFO L899 garLoopResultBuilder]: For program point L184(lines 183 211) no Hoare annotation was computed. [2023-11-06 22:27:49,689 INFO L899 garLoopResultBuilder]: For program point L1308(lines 1260 1349) no Hoare annotation was computed. [2023-11-06 22:27:49,689 INFO L899 garLoopResultBuilder]: For program point L1242(lines 1242 1246) no Hoare annotation was computed. [2023-11-06 22:27:49,689 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 189) no Hoare annotation was computed. [2023-11-06 22:27:49,689 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 131) no Hoare annotation was computed. [2023-11-06 22:27:49,689 INFO L899 garLoopResultBuilder]: For program point L978(lines 970 987) no Hoare annotation was computed. [2023-11-06 22:27:49,689 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 388) no Hoare annotation was computed. [2023-11-06 22:27:49,690 INFO L899 garLoopResultBuilder]: For program point L1309(lines 1309 1313) no Hoare annotation was computed. [2023-11-06 22:27:49,690 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2023-11-06 22:27:49,690 INFO L899 garLoopResultBuilder]: For program point L1177(lines 1177 1181) no Hoare annotation was computed. [2023-11-06 22:27:49,690 INFO L899 garLoopResultBuilder]: For program point L1177-2(lines 1175 1354) no Hoare annotation was computed. [2023-11-06 22:27:49,690 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 983) no Hoare annotation was computed. [2023-11-06 22:27:49,690 INFO L899 garLoopResultBuilder]: For program point L451(lines 139 485) no Hoare annotation was computed. [2023-11-06 22:27:49,690 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2023-11-06 22:27:49,691 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_GET2#1(lines 106 848) the Hoare annotation is: (let ((.cse8 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_req_a~0 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse10 (= ~a_t~0 0)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse16 (= ~c_req_a~0 1)) (.cse13 (not (= ~s_run_st~0 0))) (.cse17 (= ~req_tt_a~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= 2 ~s_run_pc~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse3 .cse13 .cse6 (<= 0 ~a_t~0) .cse7 .cse8 .cse9 .cse11) (and .cse1 .cse14 .cse13 .cse6 .cse15 .cse7 .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse14 .cse16 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 .cse2 .cse3 (= ~c_rsp_d~0 50) .cse13 .cse4 .cse5 .cse6 .cse15 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse14 (= 51 ~c_rsp_d~0) .cse16 .cse13 .cse17 .cse5 .cse6 .cse15 .cse7 .cse9 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse12))) [2023-11-06 22:27:49,691 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 130) no Hoare annotation was computed. [2023-11-06 22:27:49,691 INFO L899 garLoopResultBuilder]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2023-11-06 22:27:49,691 INFO L895 garLoopResultBuilder]: At program point $Ultimate##299(lines 577 621) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (<= 1 ~a_t~0) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse8 .cse9) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse1 .cse2 (= ~c_rsp_d~0 50) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 0) .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse8 .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,691 INFO L899 garLoopResultBuilder]: For program point L916(lines 916 969) no Hoare annotation was computed. [2023-11-06 22:27:49,692 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2023-11-06 22:27:49,692 INFO L895 garLoopResultBuilder]: At program point s_memory_read_returnLabel#1(lines 63 75) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) (= ~c_req_a~0 1) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_s_memory_read_~i#1| 1) (= |ULTIMATE.start_s_memory_read_~x~0#1| 51) .cse9 .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse11) (and (= |ULTIMATE.start_s_memory_read_~i#1| 0) (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= |ULTIMATE.start_s_memory_read_~x~0#1| 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) .cse9 .cse10 .cse11))) [2023-11-06 22:27:49,692 INFO L895 garLoopResultBuilder]: At program point L322(lines 292 323) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse8 (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse8 (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:27:49,693 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2023-11-06 22:27:49,693 INFO L899 garLoopResultBuilder]: For program point L719(lines 490 842) no Hoare annotation was computed. [2023-11-06 22:27:49,693 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_GET#1(lines 106 848) the Hoare annotation is: (let ((.cse11 (= 51 ~c_req_d~0)) (.cse12 (<= 1 ~a_t~0)) (.cse4 (= ~s_run_pc~0 0)) (.cse13 (not (= ~s_run_st~0 0))) (.cse14 (= ~s_memory0~0 50)) (.cse16 (= ~c_empty_req~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse15 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ~a_t~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse12 .cse13 .cse14 .cse15 .cse16 .cse5 .cse7 .cse9 (= ~s_memory1~0 51)) (and .cse11 .cse0 .cse2 .cse3 .cse12 (= ~c_req_a~0 1) .cse14 .cse15 .cse5 .cse6 .cse7 .cse9) (and .cse15 .cse16 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse15 .cse5 .cse6 .cse7) (and .cse1 .cse13 .cse4 .cse5 .cse6 .cse7 (not (= ~c_req_type~0 0))) (and .cse0 .cse2 .cse13 .cse14 .cse15 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-06 22:27:49,693 INFO L895 garLoopResultBuilder]: At program point s_run_L_SLAVE_RUN_PUT#1(lines 865 1116) the Hoare annotation is: false [2023-11-06 22:27:49,693 INFO L899 garLoopResultBuilder]: For program point L1182-1(lines 1175 1354) no Hoare annotation was computed. [2023-11-06 22:27:49,693 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 129) no Hoare annotation was computed. [2023-11-06 22:27:49,694 INFO L899 garLoopResultBuilder]: For program point L786(lines 786 790) no Hoare annotation was computed. [2023-11-06 22:27:49,694 INFO L899 garLoopResultBuilder]: For program point L720(lines 720 724) no Hoare annotation was computed. [2023-11-06 22:27:49,694 INFO L899 garLoopResultBuilder]: For program point L391(lines 383 400) no Hoare annotation was computed. [2023-11-06 22:27:49,694 INFO L895 garLoopResultBuilder]: At program point $Ultimate##494(lines 940 966) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse4 (= |ULTIMATE.start_s_run_~req_type~1#1| 1)) (.cse17 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse13 (= ~m_run_pc~0 3)) (.cse19 (= ~c_req_d~0 50)) (.cse15 (= ~c_req_a~0 0)) (.cse16 (= |ULTIMATE.start_s_run_~req_a~1#1| 0)) (.cse18 (= ~a_t~0 0)) (.cse20 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (<= 1 ~a_t~0)) (.cse5 (= ~c_req_a~0 1)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= |ULTIMATE.start_s_run_~req_a~1#1| 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse23 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 (= ~s_run_pc~0 0) .cse16 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 .cse16 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse20 .cse0 .cse15 .cse1 .cse6 (= ~req_tt_a~0 0) .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse18 .cse22 .cse14 .cse23) (and .cse20 .cse0 .cse1 .cse3 .cse5 .cse6 (= ~req_tt_a~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23))) [2023-11-06 22:27:49,694 INFO L895 garLoopResultBuilder]: At program point $Ultimate##251(lines 451 459) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3))) (or (and (= 51 ~c_req_d~0) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,695 INFO L899 garLoopResultBuilder]: For program point L259(lines 139 485) no Hoare annotation was computed. [2023-11-06 22:27:49,695 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1254) no Hoare annotation was computed. [2023-11-06 22:27:49,695 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 396) no Hoare annotation was computed. [2023-11-06 22:27:49,695 INFO L895 garLoopResultBuilder]: At program point $Ultimate##263(lines 473 481) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3))) (or (and (= 51 ~c_req_d~0) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,695 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-11-06 22:27:49,695 INFO L899 garLoopResultBuilder]: For program point L1055(lines 1055 1059) no Hoare annotation was computed. [2023-11-06 22:27:49,696 INFO L899 garLoopResultBuilder]: For program point L329(lines 329 382) no Hoare annotation was computed. [2023-11-06 22:27:49,696 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1192) no Hoare annotation was computed. [2023-11-06 22:27:49,696 INFO L895 garLoopResultBuilder]: At program point $Ultimate##212(lines 391 399) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse9 (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,696 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:27:49,696 INFO L899 garLoopResultBuilder]: For program point L990(lines 990 1004) no Hoare annotation was computed. [2023-11-06 22:27:49,696 INFO L899 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2023-11-06 22:27:49,697 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2023-11-06 22:27:49,697 INFO L895 garLoopResultBuilder]: At program point $Ultimate##227(lines 419 463) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3))) (or (and (= 51 ~c_req_d~0) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,697 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 929) no Hoare annotation was computed. [2023-11-06 22:27:49,697 INFO L895 garLoopResultBuilder]: At program point L529(lines 499 530) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 .cse10) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res#1| 50) (= ~c_req_type~0 0) .cse1 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse9 .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,697 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2023-11-06 22:27:49,698 INFO L895 garLoopResultBuilder]: At program point $Ultimate##233(lines 427 462) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3))) (or (and (= 51 ~c_req_d~0) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,698 INFO L895 garLoopResultBuilder]: At program point $Ultimate##239(lines 435 461) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3))) (or (and (= 51 ~c_req_d~0) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,698 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2023-11-06 22:27:49,698 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1327) no Hoare annotation was computed. [2023-11-06 22:27:49,699 INFO L895 garLoopResultBuilder]: At program point $Ultimate##482(lines 924 968) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse4 (= |ULTIMATE.start_s_run_~req_type~1#1| 1)) (.cse17 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse13 (= ~m_run_pc~0 3)) (.cse19 (= ~c_req_d~0 50)) (.cse15 (= ~c_req_a~0 0)) (.cse16 (= |ULTIMATE.start_s_run_~req_a~1#1| 0)) (.cse18 (= ~a_t~0 0)) (.cse20 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (<= 1 ~a_t~0)) (.cse5 (= ~c_req_a~0 1)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= |ULTIMATE.start_s_run_~req_a~1#1| 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse23 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 (= ~s_run_pc~0 0) .cse16 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 .cse16 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse20 .cse0 .cse15 .cse1 .cse6 (= ~req_tt_a~0 0) .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse18 .cse22 .cse14 .cse23) (and .cse20 .cse0 .cse1 .cse3 .cse5 .cse6 (= ~req_tt_a~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23))) [2023-11-06 22:27:49,699 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1124 1165) no Hoare annotation was computed. [2023-11-06 22:27:49,699 INFO L895 garLoopResultBuilder]: At program point $Ultimate##488(lines 932 967) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse4 (= |ULTIMATE.start_s_run_~req_type~1#1| 1)) (.cse17 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse13 (= ~m_run_pc~0 3)) (.cse19 (= ~c_req_d~0 50)) (.cse15 (= ~c_req_a~0 0)) (.cse16 (= |ULTIMATE.start_s_run_~req_a~1#1| 0)) (.cse18 (= ~a_t~0 0)) (.cse20 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (<= 1 ~a_t~0)) (.cse5 (= ~c_req_a~0 1)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= |ULTIMATE.start_s_run_~req_a~1#1| 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse23 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 (= ~s_run_pc~0 0) .cse16 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 .cse16 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse20 .cse0 .cse15 .cse1 .cse6 (= ~req_tt_a~0 0) .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse18 .cse22 .cse14 .cse23) (and .cse20 .cse0 .cse1 .cse3 .cse5 .cse6 (= ~req_tt_a~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23))) [2023-11-06 22:27:49,699 INFO L895 garLoopResultBuilder]: At program point $Ultimate##245(lines 443 460) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3))) (or (and (= 51 ~c_req_d~0) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,700 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_PUT2#1(lines 106 848) the Hoare annotation is: false [2023-11-06 22:27:49,700 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 72) no Hoare annotation was computed. [2023-11-06 22:27:49,700 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 470) no Hoare annotation was computed. [2023-11-06 22:27:49,700 INFO L895 garLoopResultBuilder]: At program point L136(lines 106 848) the Hoare annotation is: (let ((.cse1 (= ~s_run_pc~0 0)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse10 (= ~a_t~0 0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse6 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse2 (= 2 ~s_run_pc~0) .cse3 .cse4 .cse5 .cse10 .cse11 .cse6))) [2023-11-06 22:27:49,700 INFO L895 garLoopResultBuilder]: At program point $Ultimate##305(lines 585 620) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (<= 1 ~a_t~0) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse8 .cse9) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse1 .cse2 (= ~c_rsp_d~0 50) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 0) .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse8 .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,701 INFO L895 garLoopResultBuilder]: At program point L533-2(lines 533 561) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 (<= 1 ~a_t~0) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 .cse10) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res#1| 50) (= ~c_req_type~0 0) .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) .cse3 (= ~req_tt_a~0 0) .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse9 .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,701 INFO L899 garLoopResultBuilder]: For program point L996(lines 996 1003) no Hoare annotation was computed. [2023-11-06 22:27:49,701 INFO L895 garLoopResultBuilder]: At program point $Ultimate##311(lines 593 619) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4 .cse5 (<= 0 ~a_t~0) .cse6 (or (and .cse7 (= ~m_run_pc~0 0)) (and .cse7 (= ~m_run_pc~0 3))) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse8 .cse9) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse1 .cse2 (= ~c_rsp_d~0 50) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 0) .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse8 .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,701 INFO L895 garLoopResultBuilder]: At program point $Ultimate##317(lines 601 618) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4 .cse5 (<= 0 ~a_t~0) .cse6 (or (and .cse7 (= ~m_run_pc~0 0)) (and .cse7 (= ~m_run_pc~0 3))) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse8 .cse9) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse1 .cse2 (= ~c_rsp_d~0 50) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 0) .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse8 .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,702 INFO L895 garLoopResultBuilder]: At program point $Ultimate##556(lines 1046 1090) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse8 (= ~c_req_d~0 50)) (.cse6 (= ~a_t~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse10 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse2 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse13 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse10 .cse0 (= ~c_req_a~0 0) .cse1 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse2 .cse9 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse3 .cse11 .cse6 .cse12 .cse7 .cse13) (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse14 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse10 .cse0 .cse1 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse2 .cse9 .cse3 .cse11 .cse12 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse13))) [2023-11-06 22:27:49,702 INFO L899 garLoopResultBuilder]: For program point L534(lines 533 561) no Hoare annotation was computed. [2023-11-06 22:27:49,702 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 408) no Hoare annotation was computed. [2023-11-06 22:27:49,702 INFO L899 garLoopResultBuilder]: For program point L402-1(lines 402 408) no Hoare annotation was computed. [2023-11-06 22:27:49,702 INFO L899 garLoopResultBuilder]: For program point L1261(line 1261) no Hoare annotation was computed. [2023-11-06 22:27:49,703 INFO L899 garLoopResultBuilder]: For program point L1129(lines 1129 1133) no Hoare annotation was computed. [2023-11-06 22:27:49,703 INFO L895 garLoopResultBuilder]: At program point $Ultimate##562(lines 1054 1089) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse8 (= ~c_req_d~0 50)) (.cse6 (= ~a_t~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse10 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse2 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse13 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse10 .cse0 (= ~c_req_a~0 0) .cse1 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse2 .cse9 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse3 .cse11 .cse6 .cse12 .cse7 .cse13) (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse14 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse10 .cse0 .cse1 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse2 .cse9 .cse3 .cse11 .cse12 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse13))) [2023-11-06 22:27:49,703 INFO L899 garLoopResultBuilder]: For program point L1129-1(lines 1124 1165) no Hoare annotation was computed. [2023-11-06 22:27:49,703 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: false [2023-11-06 22:27:49,703 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 67 72) no Hoare annotation was computed. [2023-11-06 22:27:49,704 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2023-11-06 22:27:49,704 INFO L895 garLoopResultBuilder]: At program point $Ultimate##323(lines 609 617) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4 .cse5 (<= 0 ~a_t~0) .cse6 (or (and .cse7 (= ~m_run_pc~0 0)) (and .cse7 (= ~m_run_pc~0 3))) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse8 .cse9) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse1 .cse2 (= ~c_rsp_d~0 50) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 0) .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse8 .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,704 INFO L899 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2023-11-06 22:27:49,704 INFO L899 garLoopResultBuilder]: For program point L1196(lines 1196 1200) no Hoare annotation was computed. [2023-11-06 22:27:49,704 INFO L895 garLoopResultBuilder]: At program point L139-2(lines 139 485) the Hoare annotation is: (let ((.cse3 (= ~s_memory0~0 50)) (.cse8 (= ~m_run_pc~0 3)) (.cse13 (= ~s_run_pc~0 0)) (.cse11 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~c_req_a~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (= ~a_t~0 0)) (.cse14 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse15 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~c_req_d~0 50)) (and .cse11 .cse0 .cse12 .cse13 .cse2 .cse5 .cse6 .cse7 .cse9 .cse14 .cse10 .cse15) (and (= 51 ~c_req_d~0) .cse0 (<= 1 ~a_t~0) .cse1 (<= 2 |ULTIMATE.start_m_run_~a~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ~s_memory1~0 51)) (and .cse1 .cse13 .cse2 .cse5 .cse6 .cse7 .cse14 .cse15) (and .cse11 .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse14 .cse10 .cse15))) [2023-11-06 22:27:49,705 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 878) no Hoare annotation was computed. [2023-11-06 22:27:49,705 INFO L899 garLoopResultBuilder]: For program point L734(lines 734 738) no Hoare annotation was computed. [2023-11-06 22:27:49,705 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 606) no Hoare annotation was computed. [2023-11-06 22:27:49,705 INFO L895 garLoopResultBuilder]: At program point L404(line 404) the Hoare annotation is: false [2023-11-06 22:27:49,705 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-11-06 22:27:49,705 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 485) no Hoare annotation was computed. [2023-11-06 22:27:49,705 INFO L899 garLoopResultBuilder]: For program point L933(lines 933 937) no Hoare annotation was computed. [2023-11-06 22:27:49,706 INFO L895 garLoopResultBuilder]: At program point $Ultimate##500(lines 948 965) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse4 (= |ULTIMATE.start_s_run_~req_type~1#1| 1)) (.cse17 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse13 (= ~m_run_pc~0 3)) (.cse19 (= ~c_req_d~0 50)) (.cse15 (= ~c_req_a~0 0)) (.cse16 (= |ULTIMATE.start_s_run_~req_a~1#1| 0)) (.cse18 (= ~a_t~0 0)) (.cse20 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (<= 1 ~a_t~0)) (.cse5 (= ~c_req_a~0 1)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= |ULTIMATE.start_s_run_~req_a~1#1| 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse23 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 (= ~s_run_pc~0 0) .cse16 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 .cse16 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse20 .cse0 .cse15 .cse1 .cse6 (= ~req_tt_a~0 0) .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse18 .cse22 .cse14 .cse23) (and .cse20 .cse0 .cse1 .cse3 .cse5 .cse6 (= ~req_tt_a~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23))) [2023-11-06 22:27:49,706 INFO L899 garLoopResultBuilder]: For program point L801(lines 490 842) no Hoare annotation was computed. [2023-11-06 22:27:49,706 INFO L895 garLoopResultBuilder]: At program point $Ultimate##506(lines 956 964) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse4 (= |ULTIMATE.start_s_run_~req_type~1#1| 1)) (.cse17 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse13 (= ~m_run_pc~0 3)) (.cse19 (= ~c_req_d~0 50)) (.cse15 (= ~c_req_a~0 0)) (.cse16 (= |ULTIMATE.start_s_run_~req_a~1#1| 0)) (.cse18 (= ~a_t~0 0)) (.cse20 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (<= 1 ~a_t~0)) (.cse5 (= ~c_req_a~0 1)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= |ULTIMATE.start_s_run_~req_a~1#1| 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse23 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 (= ~s_run_pc~0 0) .cse16 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 .cse16 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse20 .cse0 .cse15 .cse1 .cse6 (= ~req_tt_a~0 0) .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse18 .cse22 .cse14 .cse23) (and .cse20 .cse0 .cse1 .cse3 .cse5 .cse6 (= ~req_tt_a~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23))) [2023-11-06 22:27:49,706 INFO L899 garLoopResultBuilder]: For program point L1330(lines 1260 1349) no Hoare annotation was computed. [2023-11-06 22:27:49,707 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 145) no Hoare annotation was computed. [2023-11-06 22:27:49,707 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 806) no Hoare annotation was computed. [2023-11-06 22:27:49,707 INFO L895 garLoopResultBuilder]: At program point $Ultimate##518(lines 978 986) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse4 (= |ULTIMATE.start_s_run_~req_type~1#1| 1)) (.cse17 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse13 (= ~m_run_pc~0 3)) (.cse19 (= ~c_req_d~0 50)) (.cse15 (= ~c_req_a~0 0)) (.cse16 (= |ULTIMATE.start_s_run_~req_a~1#1| 0)) (.cse18 (= ~a_t~0 0)) (.cse20 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (<= 1 ~a_t~0)) (.cse5 (= ~c_req_a~0 1)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= |ULTIMATE.start_s_run_~req_a~1#1| 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse23 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 (= ~s_run_pc~0 0) .cse16 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse6 .cse16 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19) (and .cse20 .cse0 .cse15 .cse1 .cse6 (= ~req_tt_a~0 0) .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse18 .cse22 .cse14 .cse23) (and .cse20 .cse0 .cse1 .cse3 .cse5 .cse6 (= ~req_tt_a~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23))) [2023-11-06 22:27:49,707 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1335) no Hoare annotation was computed. [2023-11-06 22:27:49,707 INFO L899 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2023-11-06 22:27:49,708 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 877) no Hoare annotation was computed. [2023-11-06 22:27:49,708 INFO L899 garLoopResultBuilder]: For program point L473(lines 465 482) no Hoare annotation was computed. [2023-11-06 22:27:49,708 INFO L895 garLoopResultBuilder]: At program point L672(lines 642 673) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~s_memory1~0 51))) (or (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 .cse10) (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse9 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,708 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2023-11-06 22:27:49,708 INFO L899 garLoopResultBuilder]: For program point L1135(lines 1124 1165) no Hoare annotation was computed. [2023-11-06 22:27:49,708 INFO L899 garLoopResultBuilder]: For program point L1268(lines 1268 1321) no Hoare annotation was computed. [2023-11-06 22:27:49,709 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 84) no Hoare annotation was computed. [2023-11-06 22:27:49,709 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 876) no Hoare annotation was computed. [2023-11-06 22:27:49,709 INFO L899 garLoopResultBuilder]: For program point L1269(lines 1269 1273) no Hoare annotation was computed. [2023-11-06 22:27:49,709 INFO L895 garLoopResultBuilder]: At program point L212(lines 182 213) the Hoare annotation is: (let ((.cse7 (= 2 ~s_run_pc~0)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse6 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse11 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse4 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse15 (= ~s_run_pc~0 0)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse12 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse14 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse3 .cse5 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse7 .cse8 .cse9 .cse10 (= ~m_run_pc~0 3) .cse11 .cse13 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse4 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse5 .cse15 .cse9 .cse10 .cse12 .cse14))) [2023-11-06 22:27:49,709 INFO L899 garLoopResultBuilder]: For program point L1071(lines 1071 1075) no Hoare annotation was computed. [2023-11-06 22:27:49,709 INFO L899 garLoopResultBuilder]: For program point L741(lines 733 750) no Hoare annotation was computed. [2023-11-06 22:27:49,710 INFO L899 garLoopResultBuilder]: For program point L609(lines 490 842) no Hoare annotation was computed. [2023-11-06 22:27:49,710 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 464) no Hoare annotation was computed. [2023-11-06 22:27:49,710 INFO L899 garLoopResultBuilder]: For program point L1204(lines 1204 1208) no Hoare annotation was computed. [2023-11-06 22:27:49,710 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 84) no Hoare annotation was computed. [2023-11-06 22:27:49,710 INFO L895 garLoopResultBuilder]: At program point L1006-1(lines 1006 1030) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse9 (= ~a_t~0 0)) (.cse15 (= ~c_req_d~0 50)) (.cse0 (= ~c_req_type~0 0)) (.cse8 (= ~m_run_pc~0 6)) (.cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse16 (<= 1 ~a_t~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ~s_memory1~0 51))) (or (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse3 .cse4 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse3 .cse5 .cse13 .cse6 .cse7 .cse14 .cse9 .cse11 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse14 .cse9 .cse11 .cse15) (and .cse0 .cse1 .cse2 .cse16 (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse12) (and (= 51 ~c_req_d~0) .cse1 .cse2 .cse16 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse11 .cse12))) [2023-11-06 22:27:49,710 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 746) no Hoare annotation was computed. [2023-11-06 22:27:49,711 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 614) no Hoare annotation was computed. [2023-11-06 22:27:49,711 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 416) no Hoare annotation was computed. [2023-11-06 22:27:49,711 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2023-11-06 22:27:49,711 INFO L899 garLoopResultBuilder]: For program point L1139(lines 1139 1146) no Hoare annotation was computed. [2023-11-06 22:27:49,711 INFO L899 garLoopResultBuilder]: For program point L1007(lines 1006 1030) no Hoare annotation was computed. [2023-11-06 22:27:49,711 INFO L899 garLoopResultBuilder]: For program point L941(lines 941 945) no Hoare annotation was computed. [2023-11-06 22:27:49,712 INFO L899 garLoopResultBuilder]: For program point L281(lines 273 290) no Hoare annotation was computed. [2023-11-06 22:27:49,712 INFO L899 garLoopResultBuilder]: For program point L1008(lines 1008 1012) no Hoare annotation was computed. [2023-11-06 22:27:49,712 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2023-11-06 22:27:49,712 INFO L895 garLoopResultBuilder]: At program point L150-2(lines 150 178) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse3 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse13 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse15 (= ~m_run_pc~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_m_lock~0 1))) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse3 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse16 .cse5 .cse9 .cse10 .cse11 .cse13 .cse15) (and .cse1 .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) .cse5 (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_run_pc~0 3) .cse12 .cse14 (= ~c_req_d~0 50) (= |ULTIMATE.start_m_run_~req_a~0#1| 1)))) [2023-11-06 22:27:49,712 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: false [2023-11-06 22:27:49,713 INFO L895 garLoopResultBuilder]: At program point L84-1(lines 77 87) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_s_memory_write_~v#1| 50)) (.cse6 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse10 (= ~a_t~0 0)) (.cse12 (= ~c_req_d~0 50)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 1)) (.cse4 (= ~s_memory0~0 50)) (.cse13 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 .cse3 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) (= 51 |ULTIMATE.start_s_memory_write_~v#1|) .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse11 (= ~s_memory1~0 51)))) [2023-11-06 22:27:49,713 INFO L899 garLoopResultBuilder]: For program point L679(lines 679 732) no Hoare annotation was computed. [2023-11-06 22:27:49,713 INFO L899 garLoopResultBuilder]: For program point L151(lines 150 178) no Hoare annotation was computed. [2023-11-06 22:27:49,713 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 684) no Hoare annotation was computed. [2023-11-06 22:27:49,713 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2023-11-06 22:27:49,713 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 1172 1355) the Hoare annotation is: true [2023-11-06 22:27:49,713 INFO L899 garLoopResultBuilder]: For program point L219(lines 219 272) no Hoare annotation was computed. [2023-11-06 22:27:49,714 INFO L899 garLoopResultBuilder]: For program point L1078(lines 881 1111) no Hoare annotation was computed. [2023-11-06 22:27:49,714 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1347) no Hoare annotation was computed. [2023-11-06 22:27:49,714 INFO L895 garLoopResultBuilder]: At program point L1343-1(lines 1260 1349) the Hoare annotation is: (let ((.cse1 (<= 1 ~c_m_lock~0)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (= ~s_memory1~0 51)) (.cse14 (not (= ~c_m_lock~0 1))) (.cse16 (= ~a_t~0 0)) (.cse17 (= ~m_run_pc~0 0)) (.cse13 (= ~c_req_a~0 0)) (.cse18 (= ~s_run_pc~0 0)) (.cse12 (= ~c_req_type~0 0)) (.cse2 (<= 1 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~m_run_st~0 0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse15 .cse16 .cse10 .cse17) (and .cse13 .cse3 .cse18 .cse14 .cse7 .cse8 .cse15 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 (= ~c_req_d~0 50)) (and .cse0 .cse1 .cse3 .cse4 .cse6 (<= 0 ~a_t~0) .cse8 .cse15 .cse19 .cse10) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse12 .cse0 .cse13 .cse1 (= ~c_rsp_d~0 50) .cse3 (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse16 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse11) (and .cse12 .cse0 .cse13 .cse18 .cse14 .cse7 .cse8 .cse15 .cse16 .cse10 .cse17) (and .cse13 .cse3 .cse18 .cse4 .cse8 .cse15 .cse9 (not .cse12)) (and .cse6 .cse7 .cse8 .cse15 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse15 .cse19 .cse10) (and .cse0 .cse3 .cse4 .cse6 .cse8 .cse15 .cse9))) [2023-11-06 22:27:49,714 INFO L899 garLoopResultBuilder]: For program point L1277(lines 1277 1281) no Hoare annotation was computed. [2023-11-06 22:27:49,714 INFO L899 garLoopResultBuilder]: For program point L220(lines 220 224) no Hoare annotation was computed. [2023-11-06 22:27:49,715 INFO L899 garLoopResultBuilder]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2023-11-06 22:27:49,715 INFO L895 garLoopResultBuilder]: At program point L881-1(lines 881 1111) the Hoare annotation is: (let ((.cse2 (<= 1 ~a_t~0)) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse14 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse8 (= ~s_memory1~0 51)) (.cse9 (= ~c_req_type~0 0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse13 (= ~a_t~0 0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse17 (= ~c_req_d~0 50))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse9 .cse0 .cse10 .cse1 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse3 .cse11 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse4 .cse5 .cse12 .cse13 .cse14 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse3 .cse11 .cse4 .cse5 .cse12 .cse14 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse8) (and .cse9 .cse0 .cse10 .cse15 (not (= ~c_m_lock~0 1)) .cse4 .cse5 .cse16 .cse13 .cse7 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse3 .cse4 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse5 .cse6 .cse13 .cse7 .cse17) (and .cse0 .cse10 .cse1 (= ~c_req_type~0 1) .cse15 (= ~s_run_pc~0 0) .cse5 .cse16 .cse6 .cse13 .cse7 .cse17))) [2023-11-06 22:27:49,715 INFO L899 garLoopResultBuilder]: For program point L1212(lines 1212 1216) no Hoare annotation was computed. [2023-11-06 22:27:49,715 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 820) no Hoare annotation was computed. [2023-11-06 22:27:49,716 INFO L895 garLoopResultBuilder]: At program point $Ultimate##176(lines 337 381) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse9 (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,716 INFO L895 garLoopResultBuilder]: At program point L486(lines 138 487) the Hoare annotation is: (and (= 51 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 2 |ULTIMATE.start_m_run_~a~0#1|) (not (= ~c_m_lock~0 1)) (= ~s_memory0~0 50) (= 2 ~s_run_pc~0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= 2 ~c_m_ev~0) (= ~s_memory1~0 51)) [2023-11-06 22:27:49,716 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2023-11-06 22:27:49,716 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2023-11-06 22:27:49,716 INFO L899 garLoopResultBuilder]: For program point L949(lines 949 953) no Hoare annotation was computed. [2023-11-06 22:27:49,716 INFO L895 garLoopResultBuilder]: At program point $Ultimate##182(lines 345 380) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse9 (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,717 INFO L895 garLoopResultBuilder]: At program point $Ultimate##188(lines 353 379) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse9 (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,717 INFO L895 garLoopResultBuilder]: At program point $Ultimate##50(lines 1249 1257) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= ~c_m_lock~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) (<= 2 ~c_m_ev~0) .cse6))) [2023-11-06 22:27:49,717 INFO L895 garLoopResultBuilder]: At program point s_run_L_SLAVE_RUN_GET#1(lines 865 1116) the Hoare annotation is: (let ((.cse7 (= ~c_req_a~0 0)) (.cse14 (= ~c_req_type~0 1)) (.cse4 (= ~m_run_pc~0 3)) (.cse11 (= ~a_t~0 0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse15 (<= 1 ~a_t~0)) (.cse16 (= ~c_req_a~0 1)) (.cse0 (not (= ~s_run_st~0 0))) (.cse9 (= ~s_memory0~0 50)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 6)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_empty_req~0 1) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse0 (= ~req_tt_a~0 0) .cse9 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13) (and (= 51 ~c_req_d~0) .cse6 .cse8 .cse14 .cse15 .cse16 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse12) (and .cse6 .cse7 .cse8 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 (= ~c_req_d~0 50)) (and .cse5 .cse6 .cse8 .cse15 .cse16 .cse0 (= ~req_tt_a~0 1) .cse9 .cse1 .cse2 .cse3 .cse10 .cse12 .cse13))) [2023-11-06 22:27:49,718 INFO L895 garLoopResultBuilder]: At program point L884-1(lines 884 908) the Hoare annotation is: (let ((.cse6 (= 51 ~c_req_d~0)) (.cse15 (= ~req_tt_a~0 0)) (.cse9 (<= 1 ~a_t~0)) (.cse19 (= ~c_req_a~0 1)) (.cse21 (= ~req_tt_a~0 1)) (.cse1 (= 2 ~s_run_pc~0)) (.cse16 (= ~m_run_pc~0 6)) (.cse22 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~c_req_type~0 0)) (.cse10 (= ~s_memory0~0 50)) (.cse2 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse14 (= ~c_req_a~0 0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse18 (= ~c_req_type~0 1)) (.cse0 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse17 (= ~a_t~0 0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse20 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse10 .cse2 .cse3 .cse5 .cse11 .cse12) (and .cse13 .cse7 .cse14 .cse8 .cse0 .cse15 .cse10 .cse1 .cse3 .cse4 .cse16 .cse17 .cse11 .cse12) (and .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse14 .cse8 .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse17 .cse11 .cse20) (and .cse13 .cse7 .cse8 .cse9 .cse19 .cse0 .cse21 .cse10 .cse1 .cse3 .cse4 .cse16 .cse11 .cse12) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse13 .cse7 .cse14 .cse8 (= ~c_rsp_d~0 50) .cse15 (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse10 .cse1 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse2 .cse3 .cse16 .cse17 .cse22 .cse11 .cse12) (and .cse13 .cse7 .cse8 .cse9 (= 51 ~c_rsp_d~0) .cse19 (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) .cse21 (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse10 .cse1 .cse2 .cse3 .cse16 .cse22 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse12) (and .cse13 .cse7 .cse14 .cse0 (not (= ~c_m_lock~0 1)) .cse2 .cse3 .cse4 .cse17 .cse11 (= ~m_run_pc~0 0)) (and .cse7 .cse8 .cse10 .cse2 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse3 .cse5 .cse17 .cse11 .cse20) (and .cse7 .cse14 .cse8 .cse18 .cse0 (= ~s_run_pc~0 0) .cse3 .cse4 .cse5 .cse17 .cse11 .cse20))) [2023-11-06 22:27:49,718 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 758) no Hoare annotation was computed. [2023-11-06 22:27:49,718 INFO L899 garLoopResultBuilder]: For program point L752-1(lines 752 758) no Hoare annotation was computed. [2023-11-06 22:27:49,718 INFO L895 garLoopResultBuilder]: At program point $Ultimate##194(lines 361 378) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse9 (= ~s_memory1~0 51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9 (= ~c_req_d~0 50)))) [2023-11-06 22:27:49,718 INFO L899 garLoopResultBuilder]: For program point L885(lines 884 908) no Hoare annotation was computed. [2023-11-06 22:27:49,719 INFO L895 garLoopResultBuilder]: At program point L1150(lines 1124 1165) the Hoare annotation is: (let ((.cse22 (= 51 ~c_req_d~0)) (.cse16 (= ~req_tt_a~0 0)) (.cse2 (= ~s_run_pc~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse7 (= ~m_run_pc~0 0)) (.cse15 (= ~c_req_type~0 0)) (.cse21 (<= 1 ~a_t~0)) (.cse23 (= ~c_req_a~0 1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse24 (= ~req_tt_a~0 1)) (.cse17 (= ~s_memory0~0 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse20 (= ~s_memory1~0 51)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (= ~c_req_a~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse10 (= ~c_req_type~0 1)) (.cse18 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse12 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse14 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse5 .cse6 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse8 .cse0 .cse9 .cse16 .cse17 .cse18 .cse5 .cse6 .cse19 .cse12 .cse13 .cse20) (and .cse8 .cse9 .cse1 .cse18 (<= 0 ~a_t~0) .cse5 .cse6 .cse19 .cse13) (and .cse8 .cse21 .cse1 .cse18 .cse4 .cse5 .cse6 .cse19 .cse13) (and .cse22 .cse8 .cse9 .cse21 .cse1 .cse17 .cse18 .cse4 .cse5 .cse11 .cse13 .cse20) (and .cse15 .cse8 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse7) (and .cse22 .cse8 .cse9 .cse10 .cse21 .cse23 .cse17 .cse18 .cse5 .cse6 .cse11 .cse13) (and .cse18 .cse4 .cse5 .cse6 .cse11) (and .cse15 .cse8 .cse9 .cse21 .cse23 .cse24 .cse17 .cse18 .cse5 .cse6 .cse19 .cse13 .cse20) (and .cse8 .cse1 .cse18 .cse5 .cse6 .cse11) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse15 .cse8 .cse0 .cse9 (= ~c_rsp_d~0 50) .cse1 .cse16 .cse17 .cse18 .cse4 .cse5 .cse19 .cse12 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse11 (not .cse15)) (and .cse8 .cse9 .cse1 .cse17 .cse18 .cse4 .cse5 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse8 .cse0 .cse1 .cse3 .cse18 .cse4 .cse5 .cse6 .cse12 .cse13 .cse7) (and .cse15 .cse8 .cse9 .cse21 (= 51 ~c_rsp_d~0) .cse23 .cse1 .cse24 .cse17 .cse18 .cse4 .cse5 .cse19 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse20) (and .cse8 .cse0 .cse9 .cse10 .cse18 .cse5 .cse6 .cse11 .cse12 .cse13 .cse14))) [2023-11-06 22:27:49,719 INFO L899 garLoopResultBuilder]: For program point L886(lines 886 890) no Hoare annotation was computed. [2023-11-06 22:27:49,719 INFO L895 garLoopResultBuilder]: At program point L754(line 754) the Hoare annotation is: false [2023-11-06 22:27:49,719 INFO L899 garLoopResultBuilder]: For program point L688(lines 688 692) no Hoare annotation was computed. [2023-11-06 22:27:49,720 INFO L895 garLoopResultBuilder]: At program point $Ultimate##38(lines 1227 1235) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= ~c_m_lock~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) (<= 2 ~c_m_ev~0) .cse6))) [2023-11-06 22:27:49,720 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 1219 1236) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= ~c_m_lock~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) (<= 2 ~c_m_ev~0) .cse6))) [2023-11-06 22:27:49,720 INFO L895 garLoopResultBuilder]: At program point $Ultimate##132(lines 243 269) the Hoare annotation is: (let ((.cse16 (= ~m_run_pc~0 0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse0 (= ~c_req_a~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse13 (= ~c_req_d~0 50)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (or (and .cse15 .cse16) (and .cse15 (= ~m_run_pc~0 3)))) (.cse10 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse14 .cse8 .cse15 .cse11 .cse16 (not (= ~c_req_type~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse13 .cse16) (and (= 51 ~c_req_d~0) .cse1 .cse3 (= ~c_req_a~0 1) .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (= |ULTIMATE.start_m_run_~req_a~0#1| 1))))) [2023-11-06 22:27:49,720 INFO L895 garLoopResultBuilder]: At program point L490-2(lines 490 842) the Hoare annotation is: (let ((.cse4 (= ~s_memory0~0 50)) (.cse6 (= ~c_empty_req~0 1)) (.cse13 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory1~0 51)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~a_t~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse12 (<= 2 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse10) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse3 .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse13 (= ~a_t~0 0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10))) [2023-11-06 22:27:49,721 INFO L895 garLoopResultBuilder]: At program point $Ultimate##373(lines 711 728) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse11 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10 .cse11))) [2023-11-06 22:27:49,721 INFO L895 garLoopResultBuilder]: At program point $Ultimate##379(lines 719 727) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse11 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10 .cse11))) [2023-11-06 22:27:49,721 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_PUT#1(lines 106 848) the Hoare annotation is: false [2023-11-06 22:27:49,722 INFO L895 garLoopResultBuilder]: At program point $Ultimate##138(lines 251 268) the Hoare annotation is: (let ((.cse16 (= ~m_run_pc~0 0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse0 (= ~c_req_a~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse13 (= ~c_req_d~0 50)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (or (and .cse15 .cse16) (and .cse15 (= ~m_run_pc~0 3)))) (.cse10 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse14 .cse8 .cse15 .cse11 .cse16 (not (= ~c_req_type~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse13 .cse16) (and (= 51 ~c_req_d~0) .cse1 .cse3 (= ~c_req_a~0 1) .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (= |ULTIMATE.start_m_run_~req_a~0#1| 1))))) [2023-11-06 22:27:49,722 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:27:49,722 INFO L895 garLoopResultBuilder]: At program point $Ultimate##26(lines 1211 1237) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= ~c_m_lock~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) (<= 2 ~c_m_ev~0) .cse6))) [2023-11-06 22:27:49,722 INFO L899 garLoopResultBuilder]: For program point L491(lines 490 842) no Hoare annotation was computed. [2023-11-06 22:27:49,722 INFO L895 garLoopResultBuilder]: At program point $Ultimate##144(lines 259 267) the Hoare annotation is: (let ((.cse16 (= ~m_run_pc~0 0)) (.cse15 (= ~c_empty_rsp~0 1))) (let ((.cse0 (= ~c_req_a~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse13 (= ~c_req_d~0 50)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (or (and .cse15 .cse16) (and .cse15 (= ~m_run_pc~0 3)))) (.cse10 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse14 .cse8 .cse15 .cse11 .cse16 (not (= ~c_req_type~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse13 .cse16) (and (= 51 ~c_req_d~0) .cse1 .cse3 (= ~c_req_a~0 1) .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (= |ULTIMATE.start_m_run_~req_a~0#1| 1))))) [2023-11-06 22:27:49,723 INFO L895 garLoopResultBuilder]: At program point $Ultimate##20(lines 1203 1238) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= ~c_m_lock~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) (<= 2 ~c_m_ev~0) .cse6))) [2023-11-06 22:27:49,723 INFO L895 garLoopResultBuilder]: At program point L293-2(lines 293 321) the Hoare annotation is: (let ((.cse11 (= 51 ~c_req_d~0)) (.cse13 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse12 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse16 (= ~m_run_pc~0 3)) (.cse14 (not (= ~s_run_st~0 0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse17 (= ~s_run_pc~0 0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse3 (= ~c_req_a~0 1) .cse12 .cse4 (<= 0 ~a_t~0) .cse5 .cse6 .cse13 .cse9) (and .cse0 .cse14 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse2 (<= 1 ~a_t~0) .cse14 .cse12 .cse4 .cse15 .cse5 .cse16 .cse13 .cse9 (= ~s_memory1~0 51)) (and .cse0 .cse2 .cse14 .cse12 .cse4 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10) (and .cse4 .cse15 .cse5 .cse6 .cse16) (and .cse1 .cse14 .cse17 .cse5 .cse6 (not (= ~c_req_type~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-06 22:27:49,723 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 628) no Hoare annotation was computed. [2023-11-06 22:27:49,723 INFO L899 garLoopResultBuilder]: For program point L492(lines 492 496) no Hoare annotation was computed. [2023-11-06 22:27:49,724 INFO L895 garLoopResultBuilder]: At program point $Ultimate##391(lines 741 749) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse11 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10 .cse11))) [2023-11-06 22:27:49,724 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:27:49,724 INFO L899 garLoopResultBuilder]: For program point L294(lines 293 321) no Hoare annotation was computed. [2023-11-06 22:27:49,724 INFO L895 garLoopResultBuilder]: At program point $Ultimate##14(lines 1195 1239) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= ~c_m_lock~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) (<= 2 ~c_m_ev~0) .cse6))) [2023-11-06 22:27:49,724 INFO L899 garLoopResultBuilder]: For program point L1285(lines 1285 1289) no Hoare annotation was computed. [2023-11-06 22:27:49,724 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 232) no Hoare annotation was computed. [2023-11-06 22:27:49,725 INFO L895 garLoopResultBuilder]: At program point $Ultimate##156(lines 281 289) the Hoare annotation is: (let ((.cse2 (not (= ~s_run_st~0 0))) (.cse0 (= ~c_req_a~0 0)) (.cse1 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse3 (= ~s_run_pc~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~c_req_type~0 0))) (and .cse2 (= 2 ~s_run_pc~0) .cse4 .cse5) (and .cse0 (<= 1 ~c_m_lock~0) .cse1 (= ~c_req_type~0 1) .cse3 (= |ULTIMATE.start_m_run_~req_d~0#1| 50) (= |ULTIMATE.start_m_run_~req_type~0#1| 1) .cse4 .cse5 (= ~a_t~0 0) .cse6 (<= 2 ~c_m_ev~0) (= ~c_req_d~0 50) .cse7))) [2023-11-06 22:27:49,725 INFO L899 garLoopResultBuilder]: For program point L823(lines 815 832) no Hoare annotation was computed. [2023-11-06 22:27:49,725 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2023-11-06 22:27:49,725 INFO L899 garLoopResultBuilder]: For program point L1220(lines 1220 1224) no Hoare annotation was computed. [2023-11-06 22:27:49,725 INFO L899 garLoopResultBuilder]: For program point L1154(lines 1154 1161) no Hoare annotation was computed. [2023-11-06 22:27:49,726 INFO L895 garLoopResultBuilder]: At program point $Ultimate##568(lines 1062 1088) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse8 (= ~c_req_d~0 50)) (.cse6 (= ~a_t~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse10 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse2 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse13 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse10 .cse0 (= ~c_req_a~0 0) .cse1 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse2 .cse9 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse3 .cse11 .cse6 .cse12 .cse7 .cse13) (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse14 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse10 .cse0 .cse1 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse2 .cse9 .cse3 .cse11 .cse12 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse13))) [2023-11-06 22:27:49,726 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 1118 1171) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~c_req_a~0 0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse4 (= ~c_empty_rsp~0 1)) (.cse18 (= ~a_t~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse15 (= ~s_memory0~0 50)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse16 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse10 .cse11 .cse0 .cse1 (<= 0 ~a_t~0) .cse3 .cse4 .cse12 .cse13) (and .cse10 .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13) (and (= 51 ~c_req_d~0) .cse10 .cse11 .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse13 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse17 .cse10 .cse6 .cse11 (= ~c_rsp_d~0 50) .cse0 (= ~req_tt_a~0 0) .cse15 .cse1 .cse2 .cse3 .cse12 .cse18 .cse13 .cse16) (and .cse6 .cse0 .cse7 .cse3 .cse4 .cse5 (not .cse17)) (and .cse10 .cse11 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse18 .cse13 (= ~c_req_d~0 50)) (and .cse17 .cse10 .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse18 .cse13 .cse9) (and .cse17 .cse10 .cse11 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse0 (= ~req_tt_a~0 1) .cse15 .cse1 .cse2 .cse3 .cse12 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse16))) [2023-11-06 22:27:49,726 INFO L899 garLoopResultBuilder]: For program point L956(lines 881 1111) no Hoare annotation was computed. [2023-11-06 22:27:49,726 INFO L899 garLoopResultBuilder]: For program point L824(lines 824 828) no Hoare annotation was computed. [2023-11-06 22:27:49,726 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2023-11-06 22:27:49,727 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2023-11-06 22:27:49,727 INFO L895 garLoopResultBuilder]: At program point $Ultimate##335(lines 631 639) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_m_run_~a~0#1|) (<= 1 ~c_m_lock~0) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (<= 2 ~c_m_ev~0)) [2023-11-06 22:27:49,727 INFO L895 garLoopResultBuilder]: At program point $Ultimate##574(lines 1070 1087) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse8 (= ~c_req_d~0 50)) (.cse6 (= ~a_t~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse10 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse2 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse13 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse10 .cse0 (= ~c_req_a~0 0) .cse1 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse2 .cse9 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse3 .cse11 .cse6 .cse12 .cse7 .cse13) (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse14 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse10 .cse0 .cse1 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse2 .cse9 .cse3 .cse11 .cse12 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse13))) [2023-11-06 22:27:49,727 INFO L899 garLoopResultBuilder]: For program point L957(lines 957 961) no Hoare annotation was computed. [2023-11-06 22:27:49,728 INFO L895 garLoopResultBuilder]: At program point $Ultimate##580(lines 1078 1086) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_s_run_~req_d~1#1| 50)) (.cse8 (= ~c_req_d~0 50)) (.cse6 (= ~a_t~0 0)) (.cse5 (= ~m_run_pc~0 3)) (.cse10 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ~a_t~0)) (.cse2 (= ~s_memory0~0 50)) (.cse9 (= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse13 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse10 .cse0 (= ~c_req_a~0 0) .cse1 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse2 .cse9 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse3 .cse11 .cse6 .cse12 .cse7 .cse13) (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse14 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse10 .cse0 .cse1 .cse14 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse2 .cse9 .cse3 .cse11 .cse12 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse13))) [2023-11-06 22:27:49,728 INFO L895 garLoopResultBuilder]: At program point L562(lines 532 563) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 (<= 1 ~a_t~0) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse8 .cse9) (and .cse0 (= |ULTIMATE.start_s_memory_read_#res#1| 50) (= ~c_req_type~0 0) .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) .cse3 (= ~req_tt_a~0 0) .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse5 .cse6 .cse7 (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse8 .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)))) [2023-11-06 22:27:49,728 INFO L895 garLoopResultBuilder]: At program point $Ultimate##592(lines 1100 1108) the Hoare annotation is: (let ((.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1))) (let ((.cse4 (let ((.cse13 (= ~m_run_pc~0 3))) (or (and (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse10 .cse13) (and .cse9 .cse10 .cse13)))) (.cse7 (= ~a_t~0 0)) (.cse8 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 1 ~a_t~0)) (.cse3 (= ~s_memory0~0 50)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (.cse5 (<= 2 ~c_m_ev~0)) (.cse6 (= ~s_memory1~0 51))) (or (and (= 51 ~c_req_d~0) .cse0 .cse1 .cse2 (= 51 |ULTIMATE.start_s_run_~req_d~1#1|) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 (= |ULTIMATE.start_s_run_~req_d~1#1| 50) .cse7 .cse5 (= ~c_req_d~0 50)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse8 .cse0 (= ~c_req_a~0 0) .cse1 (= ~c_rsp_d~0 50) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_a~1#1| 0) .cse3 .cse9 (= |ULTIMATE.start_s_run_~rsp_d~1#1| 50) .cse10 .cse11 .cse7 .cse12 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_run_~rsp_d~1#1|) (= ~req_tt_a~0 1) (= |ULTIMATE.start_s_run_~req_a~1#1| 1) .cse3 .cse9 .cse10 .cse11 .cse12 .cse5 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse6)))) [2023-11-06 22:27:49,729 INFO L895 garLoopResultBuilder]: At program point $Ultimate##355(lines 687 731) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse11 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10 .cse11))) [2023-11-06 22:27:49,729 INFO L899 garLoopResultBuilder]: For program point L761(lines 761 814) no Hoare annotation was computed. [2023-11-06 22:27:49,729 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_MUTEX#1(lines 106 848) the Hoare annotation is: false [2023-11-06 22:27:49,729 INFO L895 garLoopResultBuilder]: At program point $Ultimate##120(lines 227 271) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse15 (= ~s_run_pc~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse13 (= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse15 .cse8 .cse9 .cse11 .cse14 (not (= ~c_req_type~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (= 51 ~c_req_d~0) .cse1 .cse3 (= ~c_req_a~0 1) .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse6 .cse7 .cse8 .cse9 (= ~m_run_pc~0 3) .cse10 .cse12 (= |ULTIMATE.start_m_run_~req_a~0#1| 1)))) [2023-11-06 22:27:49,730 INFO L895 garLoopResultBuilder]: At program point $Ultimate##361(lines 695 730) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse11 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10 .cse11))) [2023-11-06 22:27:49,730 INFO L895 garLoopResultBuilder]: At program point $Ultimate##126(lines 235 270) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a~0#1| 0)) (.cse15 (= ~s_run_pc~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~req_d~0#1| 50)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse13 (= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 (not (= |ULTIMATE.start_m_run_~req_type~0#1| 0)) .cse4 .cse15 .cse8 .cse9 .cse11 .cse14 (not (= ~c_req_type~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (= 51 ~c_req_d~0) .cse1 .cse3 (= ~c_req_a~0 1) .cse4 (= 51 |ULTIMATE.start_m_run_~req_d~0#1|) (= ~s_memory0~0 50) (= |ULTIMATE.start_m_run_~a~0#1| 1) .cse6 .cse7 .cse8 .cse9 (= ~m_run_pc~0 3) .cse10 .cse12 (= |ULTIMATE.start_m_run_~req_a~0#1| 1)))) [2023-11-06 22:27:49,730 INFO L895 garLoopResultBuilder]: At program point $Ultimate##367(lines 703 729) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~s_memory0~0 50)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) (= 51 ~c_rsp_d~0) (= ~c_req_a~0 1) .cse3 (= ~req_tt_a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 51) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res#1|) .cse11 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 1)) (and (= |ULTIMATE.start_s_memory_read_#res#1| 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (= ~c_rsp_d~0 50) (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| 50) .cse3 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse10 .cse11))) [2023-11-06 22:27:49,731 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-11-06 22:27:49,731 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-11-06 22:27:49,731 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-11-06 22:27:49,731 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2023-11-06 22:27:49,735 INFO L445 BasicCegarLoop]: Path program 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] [2023-11-06 22:27:49,737 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:27:49,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:27:49 BoogieIcfgContainer [2023-11-06 22:27:49,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:27:49,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:27:49,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:27:49,982 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:27:49,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:19" (3/4) ... [2023-11-06 22:27:49,984 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:27:49,989 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-06 22:27:50,017 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-11-06 22:27:50,018 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-06 22:27:50,020 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:27:50,022 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:27:50,057 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) [2023-11-06 22:27:50,058 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) [2023-11-06 22:27:50,058 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,061 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,061 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,062 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) [2023-11-06 22:27:50,062 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) [2023-11-06 22:27:50,062 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) || (((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) [2023-11-06 22:27:50,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,067 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) [2023-11-06 22:27:50,067 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) [2023-11-06 22:27:50,071 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,071 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,072 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,072 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,074 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && ((((!((s_run_st == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (m_run_pc == 3)) || (((2 == s_run_pc) && (c_empty_req == 1)) && (m_run_pc == 3)))) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && ((((!((s_run_st == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (m_run_pc == 3)) || (((2 == s_run_pc) && (c_empty_req == 1)) && (m_run_pc == 3)))) && (req_d == 50)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,076 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,076 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev))) [2023-11-06 22:27:50,076 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,076 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,077 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,077 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (i == 1)) && (x == 51)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) || (((((((((((((((((((i == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (x == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,077 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,077 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,078 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,078 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,078 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,078 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,079 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,079 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,079 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,079 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,080 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,080 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,080 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,080 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,081 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,191 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) [2023-11-06 22:27:50,191 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) [2023-11-06 22:27:50,192 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,192 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,192 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,192 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,193 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,193 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,193 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,194 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) [2023-11-06 22:27:50,194 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) [2023-11-06 22:27:50,194 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) || (((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) [2023-11-06 22:27:50,196 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,197 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) [2023-11-06 22:27:50,197 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) [2023-11-06 22:27:50,201 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,202 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,203 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,203 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,203 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,203 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,203 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,204 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,204 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && ((((!((s_run_st == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (m_run_pc == 3)) || (((2 == s_run_pc) && (c_empty_req == 1)) && (m_run_pc == 3)))) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && ((((!((s_run_st == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (m_run_pc == 3)) || (((2 == s_run_pc) && (c_empty_req == 1)) && (m_run_pc == 3)))) && (req_d == 50)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,204 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,204 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) [2023-11-06 22:27:50,205 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev))) [2023-11-06 22:27:50,205 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,205 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,205 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,206 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (i == 1)) && (x == 51)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) || (((((((((((((((((((i == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (x == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,206 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,206 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,207 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) [2023-11-06 22:27:50,207 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,208 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,208 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,208 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,209 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,209 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,209 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,209 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,209 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) [2023-11-06 22:27:50,210 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,210 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,210 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) [2023-11-06 22:27:50,283 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:27:50,284 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:27:50,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:27:50,285 INFO L158 Benchmark]: Toolchain (without parser) took 152232.91ms. Allocated memory was 155.2MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 109.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 733.0MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,285 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 111.1MB. Free memory was 61.4MB in the beginning and 61.3MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:27:50,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.72ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 87.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.57ms. Allocated memory is still 155.2MB. Free memory was 87.7MB in the beginning and 84.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,287 INFO L158 Benchmark]: Boogie Preprocessor took 83.42ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 81.0MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,289 INFO L158 Benchmark]: RCFGBuilder took 1124.20ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 86.0MB in the end (delta: -5.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,290 INFO L158 Benchmark]: TraceAbstraction took 150136.33ms. Allocated memory was 155.2MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 85.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-06 22:27:50,290 INFO L158 Benchmark]: Witness Printer took 303.07ms. Allocated memory is still 2.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,299 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 111.1MB. Free memory was 61.4MB in the beginning and 61.3MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.72ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 87.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.57ms. Allocated memory is still 155.2MB. Free memory was 87.7MB in the beginning and 84.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.42ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 81.0MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1124.20ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 86.0MB in the end (delta: -5.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 150136.33ms. Allocated memory was 155.2MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 85.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 303.07ms. Allocated memory is still 2.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 273 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 149.8s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 108.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12351 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12351 mSDsluCounter, 51200 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38493 mSDsCounter, 520 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4685 IncrementalHoareTripleChecker+Invalid, 5205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 520 mSolverCounterUnsat, 12707 mSDtfsCounter, 4685 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3691 GetRequests, 3468 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7555occurred in iteration=13, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 10492 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 104 LocationsWithAnnotation, 220 PreInvPairs, 823 NumberOfFragments, 16121 HoareAnnotationTreeSize, 220 FomulaSimplifications, 3430804 FormulaSimplificationTreeSizeReduction, 77.4s HoareSimplificationTime, 104 FomulaSimplificationsInter, 159593 FormulaSimplificationTreeSizeReductionInter, 31.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 6010 NumberOfCodeBlocks, 6010 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 7263 ConstructedInterpolants, 0 QuantifiedInterpolants, 19592 SizeOfPredicates, 50 NumberOfNonLiveVariables, 6449 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 2348/4270 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (1 <= a)) && (2 <= c_m_ev))) || (((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 1062]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 924]: Loop Invariant Derived loop invariant: (((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (req_type == 1)) && (c_req_a == 1)) && (51 == req_d)) && !((s_run_st == 0))) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (req_a == 0)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (req_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: ((((((((0 <= a) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: (((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (req_type == 1)) && (c_req_a == 1)) && (51 == req_d)) && !((s_run_st == 0))) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (req_a == 0)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (req_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: ((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: (((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (req_type == 1)) && (c_req_a == 1)) && (51 == req_d)) && !((s_run_st == 0))) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (req_a == 0)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (req_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 856]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) || (((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: (((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (req_type == 1)) && (c_req_a == 1)) && (51 == req_d)) && !((s_run_st == 0))) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (req_a == 0)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (req_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 1070]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: (((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (req_type == 1)) && (c_req_a == 1)) && (51 == req_d)) && !((s_run_st == 0))) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (req_a == 0)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (req_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 1284]: Loop Invariant Derived loop invariant: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1100]: Loop Invariant Derived loop invariant: ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && ((((!((s_run_st == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (m_run_pc == 3)) || (((2 == s_run_pc) && (c_empty_req == 1)) && (m_run_pc == 3)))) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && ((((!((s_run_st == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (m_run_pc == 3)) || (((2 == s_run_pc) && (c_empty_req == 1)) && (m_run_pc == 3)))) && (req_d == 50)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: (((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (m_run_pc == 0)) || ((((((((((c_req_a == 0) && (req_a == 0)) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) && !((c_req_type == 0)))) || ((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (m_run_pc == 0))) || ((((((((((((((((51 == c_req_d) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (req_a == 1))) - InvariantResult [Line: 1046]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 1308]: Loop Invariant Derived loop invariant: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 695]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 1211]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 1219]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 609]: Loop Invariant Derived loop invariant: (((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((c_req_a == 0) && (req_a == 0)) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) && !((c_req_type == 0)))) || ((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (m_run_pc == 0))) || (((((((((((((((51 == c_req_d) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a_t == 0)) && (2 <= c_m_ev)) && (req_a == 1))) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 719]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 1227]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 703]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((c_req_a == 0) && (req_a == 0)) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) && !((c_req_type == 0)))) || ((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (m_run_pc == 0))) || (((((((((((((((51 == c_req_d) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a_t == 0)) && (2 <= c_m_ev)) && (req_a == 1))) - InvariantResult [Line: 1356]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 601]: Loop Invariant Derived loop invariant: (((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 777]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) - InvariantResult [Line: 1276]: Loop Invariant Derived loop invariant: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev))) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0)) || (((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (i == 1)) && (x == 51)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) || (((((((((((((((((((i == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (x == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (m_run_pc == 0)) || ((((((((((c_req_a == 0) && (req_a == 0)) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) && !((c_req_type == 0)))) || ((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (m_run_pc == 0))) || ((((((((((((((((51 == c_req_d) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (req_a == 1))) - InvariantResult [Line: 793]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) - InvariantResult [Line: 532]: Loop Invariant Derived loop invariant: ((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 1118]: Loop Invariant Derived loop invariant: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 1203]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (51 == req_d)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 1172]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1005]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 1300]: Loop Invariant Derived loop invariant: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (2 <= a)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 801]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (s_memory1 == 51))) - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 642]: Loop Invariant Derived loop invariant: (((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 741]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (rsp_d___0 == 51)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1)) || ((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (rsp_d___0 == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 643]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51)) && (req_a___0 == 1))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev))) - InvariantResult [Line: 1292]: Loop Invariant Derived loop invariant: (((((((((((((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) || ((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 1195]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 1006]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && (req_a___0 == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && !((s_run_st == 0))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((c_req_a == 0) && (req_a == 0)) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) && !((c_req_type == 0)))) || ((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (m_run_pc == 0))) || (((((((((((((((51 == c_req_d) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && !((s_run_st == 0))) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a_t == 0)) && (2 <= c_m_ev)) && (req_a == 1))) - InvariantResult [Line: 956]: Loop Invariant Derived loop invariant: (((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (req_type == 1)) && (c_req_a == 1)) && (51 == req_d)) && !((s_run_st == 0))) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (req_a == 0)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (req_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && !((c_m_lock == 1))) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (51 == req_d)) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && (v == 50)) && !((s_run_st == 0))) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (req_type == 1)) && (v == 50)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (req_type == 1)) && (51 == req_d)) && (51 == v)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (s_memory1 == 51)) || ((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (c_req_d == 50))) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((c_req_a == 0) && (req_a == 0)) && !((req_type == 0))) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) && !((c_req_type == 0))) || (((!((s_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || ((((((((((((((c_req_a == 0) && (1 <= c_m_lock)) && (req_a == 0)) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (m_run_pc == 0))) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 1249]: Loop Invariant Derived loop invariant: (((((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((\result == 50) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (51 == \result)) && (s_memory1 == 51))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (c_req_a == 0)) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (((c_empty_rsp == 1) && (m_run_pc == 0)) || ((c_empty_rsp == 1) && (m_run_pc == 3)))) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((((((((((((req_type___0 == 0) && (\result == 50)) && (c_req_type == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (c_req_a == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((c_req_a == 0) && !((s_run_st == 0))) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && !((c_req_type == 0)))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && !((s_run_st == 0))) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:27:50,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776dfa2-4916-4260-9513-d019fd1944b2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE