/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 06:04:29,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 06:04:29,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 06:04:29,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 06:04:29,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 06:04:29,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 06:04:29,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 06:04:29,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 06:04:29,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 06:04:29,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 06:04:29,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 06:04:29,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 06:04:29,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 06:04:29,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 06:04:29,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 06:04:29,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 06:04:29,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 06:04:29,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 06:04:29,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 06:04:29,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 06:04:29,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 06:04:29,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 06:04:29,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 06:04:29,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 06:04:29,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 06:04:29,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 06:04:29,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 06:04:29,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 06:04:29,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 06:04:29,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 06:04:29,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 06:04:29,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 06:04:29,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 06:04:29,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 06:04:29,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 06:04:29,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 06:04:29,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 06:04:29,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 06:04:29,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 06:04:29,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 06:04:29,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 06:04:29,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 06:04:29,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 06:04:29,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 06:04:29,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 06:04:29,622 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 06:04:29,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 06:04:29,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 06:04:29,623 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 06:04:29,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 06:04:29,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 06:04:29,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 06:04:29,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 06:04:29,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 06:04:29,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 06:04:29,625 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 06:04:29,625 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 06:04:29,625 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 06:04:29,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 06:04:29,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 06:04:29,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 06:04:29,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 06:04:29,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 06:04:29,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:04:29,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 06:04:29,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 06:04:29,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 06:04:29,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 06:04:29,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 06:04:29,628 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 06:04:29,628 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 06:04:29,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 06:04:29,628 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 06:04:29,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 06:04:29,629 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 06:04:29,630 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 06:04:29,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 06:04:29,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 06:04:29,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 06:04:29,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 06:04:29,883 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 06:04:29,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2022-01-11 06:04:29,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36e0d767/95869814b45948a7aee376fe43f63e6a/FLAGd3c0f0469 [2022-01-11 06:04:30,329 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 06:04:30,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2022-01-11 06:04:30,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36e0d767/95869814b45948a7aee376fe43f63e6a/FLAGd3c0f0469 [2022-01-11 06:04:30,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36e0d767/95869814b45948a7aee376fe43f63e6a [2022-01-11 06:04:30,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 06:04:30,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 06:04:30,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 06:04:30,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 06:04:30,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 06:04:30,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40aa3124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30, skipping insertion in model container [2022-01-11 06:04:30,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 06:04:30,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 06:04:30,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-01-11 06:04:30,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:04:30,636 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 06:04:30,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-01-11 06:04:30,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:04:30,677 INFO L208 MainTranslator]: Completed translation [2022-01-11 06:04:30,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30 WrapperNode [2022-01-11 06:04:30,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 06:04:30,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 06:04:30,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 06:04:30,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 06:04:30,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,713 INFO L137 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 26, calls inlined = 27, statements flattened = 303 [2022-01-11 06:04:30,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 06:04:30,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 06:04:30,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 06:04:30,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 06:04:30,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 06:04:30,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 06:04:30,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 06:04:30,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 06:04:30,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (1/1) ... [2022-01-11 06:04:30,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:04:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:04:30,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 06:04:30,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 06:04:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 06:04:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 06:04:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 06:04:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 06:04:30,912 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 06:04:30,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 06:04:31,236 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 06:04:31,243 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 06:04:31,244 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-11 06:04:31,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:04:31 BoogieIcfgContainer [2022-01-11 06:04:31,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 06:04:31,246 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 06:04:31,246 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 06:04:31,252 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 06:04:31,254 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:04:31" (1/1) ... [2022-01-11 06:04:31,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:04:31 BasicIcfg [2022-01-11 06:04:31,349 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 06:04:31,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 06:04:31,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 06:04:31,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 06:04:31,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 06:04:30" (1/4) ... [2022-01-11 06:04:31,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f7320c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:04:31, skipping insertion in model container [2022-01-11 06:04:31,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:04:30" (2/4) ... [2022-01-11 06:04:31,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f7320c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:04:31, skipping insertion in model container [2022-01-11 06:04:31,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:04:31" (3/4) ... [2022-01-11 06:04:31,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f7320c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:04:31, skipping insertion in model container [2022-01-11 06:04:31,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:04:31" (4/4) ... [2022-01-11 06:04:31,357 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.cTransformedIcfg [2022-01-11 06:04:31,361 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 06:04:31,361 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-11 06:04:31,400 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 06:04:31,406 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 06:04:31,406 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-11 06:04:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 102 states have (on average 1.5588235294117647) internal successors, (159), 104 states have internal predecessors, (159), 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) [2022-01-11 06:04:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 06:04:31,426 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:31,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:31,427 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1962611745, now seen corresponding path program 1 times [2022-01-11 06:04:31,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:31,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029418509] [2022-01-11 06:04:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:31,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:31,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:31,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029418509] [2022-01-11 06:04:31,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029418509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:31,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:31,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:31,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503303054] [2022-01-11 06:04:31,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:31,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:31,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:31,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:31,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:31,778 INFO L87 Difference]: Start difference. First operand has 105 states, 102 states have (on average 1.5588235294117647) internal successors, (159), 104 states have internal predecessors, (159), 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) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-01-11 06:04:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:31,954 INFO L93 Difference]: Finished difference Result 293 states and 447 transitions. [2022-01-11 06:04:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:31,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2022-01-11 06:04:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:31,972 INFO L225 Difference]: With dead ends: 293 [2022-01-11 06:04:31,972 INFO L226 Difference]: Without dead ends: 193 [2022-01-11 06:04:31,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:31,979 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 123 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:31,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 256 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 06:04:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-11 06:04:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2022-01-11 06:04:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 187 states have (on average 1.4171122994652405) internal successors, (265), 188 states have internal predecessors, (265), 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) [2022-01-11 06:04:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 265 transitions. [2022-01-11 06:04:32,034 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 265 transitions. Word has length 43 [2022-01-11 06:04:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:32,035 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 265 transitions. [2022-01-11 06:04:32,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-01-11 06:04:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 265 transitions. [2022-01-11 06:04:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 06:04:32,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:32,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:32,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 06:04:32,038 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1601870495, now seen corresponding path program 1 times [2022-01-11 06:04:32,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:32,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192709769] [2022-01-11 06:04:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:32,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:32,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:32,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192709769] [2022-01-11 06:04:32,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192709769] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:32,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:32,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:32,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120849102] [2022-01-11 06:04:32,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:32,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:32,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:32,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:32,146 INFO L87 Difference]: Start difference. First operand 189 states and 265 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-01-11 06:04:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:32,201 INFO L93 Difference]: Finished difference Result 475 states and 663 transitions. [2022-01-11 06:04:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:32,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2022-01-11 06:04:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:32,204 INFO L225 Difference]: With dead ends: 475 [2022-01-11 06:04:32,204 INFO L226 Difference]: Without dead ends: 345 [2022-01-11 06:04:32,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:32,206 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 103 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:32,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 258 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-01-11 06:04:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2022-01-11 06:04:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 339 states have (on average 1.3893805309734513) internal successors, (471), 340 states have internal predecessors, (471), 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) [2022-01-11 06:04:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 471 transitions. [2022-01-11 06:04:32,252 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 471 transitions. Word has length 43 [2022-01-11 06:04:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:32,253 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 471 transitions. [2022-01-11 06:04:32,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-01-11 06:04:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 471 transitions. [2022-01-11 06:04:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 06:04:32,260 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:32,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:32,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 06:04:32,260 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1501537699, now seen corresponding path program 1 times [2022-01-11 06:04:32,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:32,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608761157] [2022-01-11 06:04:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:32,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:32,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:32,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608761157] [2022-01-11 06:04:32,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608761157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:32,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:32,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:32,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959853266] [2022-01-11 06:04:32,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:32,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:32,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:32,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:32,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:32,344 INFO L87 Difference]: Start difference. First operand 341 states and 471 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-11 06:04:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:32,409 INFO L93 Difference]: Finished difference Result 889 states and 1231 transitions. [2022-01-11 06:04:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2022-01-11 06:04:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:32,413 INFO L225 Difference]: With dead ends: 889 [2022-01-11 06:04:32,413 INFO L226 Difference]: Without dead ends: 554 [2022-01-11 06:04:32,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:32,422 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 94 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:32,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 214 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-01-11 06:04:32,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 540. [2022-01-11 06:04:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 538 states have (on average 1.3736059479553904) internal successors, (739), 539 states have internal predecessors, (739), 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) [2022-01-11 06:04:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 739 transitions. [2022-01-11 06:04:32,471 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 739 transitions. Word has length 44 [2022-01-11 06:04:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:32,472 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 739 transitions. [2022-01-11 06:04:32,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-11 06:04:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 739 transitions. [2022-01-11 06:04:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 06:04:32,475 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:32,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:32,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 06:04:32,475 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:32,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1531120162, now seen corresponding path program 1 times [2022-01-11 06:04:32,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:32,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443251937] [2022-01-11 06:04:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:32,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:32,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:32,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443251937] [2022-01-11 06:04:32,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443251937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:32,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:32,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:32,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658644511] [2022-01-11 06:04:32,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:32,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:32,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:32,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:32,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:32,564 INFO L87 Difference]: Start difference. First operand 540 states and 739 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-11 06:04:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:32,626 INFO L93 Difference]: Finished difference Result 1428 states and 1951 transitions. [2022-01-11 06:04:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:32,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2022-01-11 06:04:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:32,631 INFO L225 Difference]: With dead ends: 1428 [2022-01-11 06:04:32,631 INFO L226 Difference]: Without dead ends: 952 [2022-01-11 06:04:32,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:32,642 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 91 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:32,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 224 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-01-11 06:04:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 920. [2022-01-11 06:04:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 918 states have (on average 1.3496732026143792) internal successors, (1239), 919 states have internal predecessors, (1239), 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) [2022-01-11 06:04:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1239 transitions. [2022-01-11 06:04:32,691 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1239 transitions. Word has length 44 [2022-01-11 06:04:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:32,692 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1239 transitions. [2022-01-11 06:04:32,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-11 06:04:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1239 transitions. [2022-01-11 06:04:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-11 06:04:32,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:32,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:32,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 06:04:32,694 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1919833569, now seen corresponding path program 1 times [2022-01-11 06:04:32,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:32,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897459684] [2022-01-11 06:04:32,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:32,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:32,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:32,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897459684] [2022-01-11 06:04:32,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897459684] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:32,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:32,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:32,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715205985] [2022-01-11 06:04:32,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:32,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:32,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:32,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:32,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:32,760 INFO L87 Difference]: Start difference. First operand 920 states and 1239 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2022-01-11 06:04:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:32,842 INFO L93 Difference]: Finished difference Result 2123 states and 2852 transitions. [2022-01-11 06:04:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:32,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) Word has length 50 [2022-01-11 06:04:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:32,849 INFO L225 Difference]: With dead ends: 2123 [2022-01-11 06:04:32,849 INFO L226 Difference]: Without dead ends: 1239 [2022-01-11 06:04:32,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:32,852 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 88 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:32,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 228 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2022-01-11 06:04:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1217. [2022-01-11 06:04:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1215 states have (on average 1.3366255144032921) internal successors, (1624), 1216 states have internal predecessors, (1624), 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) [2022-01-11 06:04:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1624 transitions. [2022-01-11 06:04:32,903 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1624 transitions. Word has length 50 [2022-01-11 06:04:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:32,904 INFO L470 AbstractCegarLoop]: Abstraction has 1217 states and 1624 transitions. [2022-01-11 06:04:32,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2022-01-11 06:04:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1624 transitions. [2022-01-11 06:04:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 06:04:32,913 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:32,913 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 06:04:32,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 06:04:32,913 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:32,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash 6605477, now seen corresponding path program 1 times [2022-01-11 06:04:32,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:32,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111439060] [2022-01-11 06:04:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:32,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 06:04:33,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:33,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111439060] [2022-01-11 06:04:33,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111439060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:33,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:33,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:04:33,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115501725] [2022-01-11 06:04:33,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:33,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:04:33,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:33,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:04:33,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:04:33,015 INFO L87 Difference]: Start difference. First operand 1217 states and 1624 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-11 06:04:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:33,155 INFO L93 Difference]: Finished difference Result 2843 states and 3828 transitions. [2022-01-11 06:04:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:04:33,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) Word has length 51 [2022-01-11 06:04:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:33,165 INFO L225 Difference]: With dead ends: 2843 [2022-01-11 06:04:33,165 INFO L226 Difference]: Without dead ends: 1892 [2022-01-11 06:04:33,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 06:04:33,169 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 395 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:33,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 621 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-01-11 06:04:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1241. [2022-01-11 06:04:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1239 states have (on average 1.3155770782889427) internal successors, (1630), 1240 states have internal predecessors, (1630), 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) [2022-01-11 06:04:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1630 transitions. [2022-01-11 06:04:33,266 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1630 transitions. Word has length 51 [2022-01-11 06:04:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:33,266 INFO L470 AbstractCegarLoop]: Abstraction has 1241 states and 1630 transitions. [2022-01-11 06:04:33,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-11 06:04:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1630 transitions. [2022-01-11 06:04:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 06:04:33,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:33,268 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 06:04:33,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 06:04:33,269 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1956905732, now seen corresponding path program 1 times [2022-01-11 06:04:33,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:33,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867419304] [2022-01-11 06:04:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:33,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 06:04:33,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:33,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867419304] [2022-01-11 06:04:33,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867419304] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:33,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:33,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:04:33,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591057956] [2022-01-11 06:04:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:33,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:04:33,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:33,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:04:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:04:33,329 INFO L87 Difference]: Start difference. First operand 1241 states and 1630 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-11 06:04:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:33,531 INFO L93 Difference]: Finished difference Result 2996 states and 3979 transitions. [2022-01-11 06:04:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:04:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) Word has length 51 [2022-01-11 06:04:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:33,540 INFO L225 Difference]: With dead ends: 2996 [2022-01-11 06:04:33,540 INFO L226 Difference]: Without dead ends: 1831 [2022-01-11 06:04:33,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 06:04:33,544 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 354 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:33,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 637 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-01-11 06:04:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1259. [2022-01-11 06:04:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1257 states have (on average 1.2951471758154336) internal successors, (1628), 1258 states have internal predecessors, (1628), 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) [2022-01-11 06:04:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1628 transitions. [2022-01-11 06:04:33,667 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1628 transitions. Word has length 51 [2022-01-11 06:04:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:33,667 INFO L470 AbstractCegarLoop]: Abstraction has 1259 states and 1628 transitions. [2022-01-11 06:04:33,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-11 06:04:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1628 transitions. [2022-01-11 06:04:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 06:04:33,668 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:33,668 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 06:04:33,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 06:04:33,669 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:33,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1968221859, now seen corresponding path program 1 times [2022-01-11 06:04:33,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:33,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556370279] [2022-01-11 06:04:33,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:33,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:33,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:33,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556370279] [2022-01-11 06:04:33,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556370279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:33,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:33,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:04:33,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391574712] [2022-01-11 06:04:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:33,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:04:33,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:04:33,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:04:33,768 INFO L87 Difference]: Start difference. First operand 1259 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2022-01-11 06:04:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:33,942 INFO L93 Difference]: Finished difference Result 1491 states and 1928 transitions. [2022-01-11 06:04:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:04:33,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) Word has length 51 [2022-01-11 06:04:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:33,948 INFO L225 Difference]: With dead ends: 1491 [2022-01-11 06:04:33,948 INFO L226 Difference]: Without dead ends: 1489 [2022-01-11 06:04:33,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:04:33,950 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 315 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:33,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2022-01-11 06:04:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1257. [2022-01-11 06:04:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1256 states have (on average 1.289012738853503) internal successors, (1619), 1256 states have internal predecessors, (1619), 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) [2022-01-11 06:04:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1619 transitions. [2022-01-11 06:04:34,065 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1619 transitions. Word has length 51 [2022-01-11 06:04:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:34,065 INFO L470 AbstractCegarLoop]: Abstraction has 1257 states and 1619 transitions. [2022-01-11 06:04:34,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2022-01-11 06:04:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1619 transitions. [2022-01-11 06:04:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 06:04:34,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:34,067 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 06:04:34,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 06:04:34,067 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:34,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:34,067 INFO L85 PathProgramCache]: Analyzing trace with hash 885335038, now seen corresponding path program 1 times [2022-01-11 06:04:34,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:34,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201918695] [2022-01-11 06:04:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:34,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:34,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:34,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201918695] [2022-01-11 06:04:34,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201918695] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 06:04:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462800499] [2022-01-11 06:04:34,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:34,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 06:04:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:04:34,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 06:04:34,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 06:04:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:34,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 06:04:34,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 06:04:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:34,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 06:04:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:35,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462800499] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 06:04:35,122 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 06:04:35,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 06:04:35,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667079398] [2022-01-11 06:04:35,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 06:04:35,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 06:04:35,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:35,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 06:04:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 06:04:35,125 INFO L87 Difference]: Start difference. First operand 1257 states and 1619 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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) [2022-01-11 06:04:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:35,663 INFO L93 Difference]: Finished difference Result 3614 states and 4719 transitions. [2022-01-11 06:04:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 06:04:35,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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) Word has length 52 [2022-01-11 06:04:35,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:35,676 INFO L225 Difference]: With dead ends: 3614 [2022-01-11 06:04:35,676 INFO L226 Difference]: Without dead ends: 3612 [2022-01-11 06:04:35,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 06:04:35,677 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 890 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:35,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [890 Valid, 1256 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2022-01-11 06:04:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 2232. [2022-01-11 06:04:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2231 states have (on average 1.2998655311519498) internal successors, (2900), 2231 states have internal predecessors, (2900), 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) [2022-01-11 06:04:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 2900 transitions. [2022-01-11 06:04:35,925 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 2900 transitions. Word has length 52 [2022-01-11 06:04:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:35,926 INFO L470 AbstractCegarLoop]: Abstraction has 2232 states and 2900 transitions. [2022-01-11 06:04:35,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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) [2022-01-11 06:04:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2900 transitions. [2022-01-11 06:04:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 06:04:35,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:35,927 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-11 06:04:35,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 06:04:36,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 06:04:36,144 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash 592698231, now seen corresponding path program 2 times [2022-01-11 06:04:36,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:36,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154224362] [2022-01-11 06:04:36,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:36,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:36,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:36,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154224362] [2022-01-11 06:04:36,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154224362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:36,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:36,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:36,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478262539] [2022-01-11 06:04:36,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:36,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:36,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:36,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:36,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:36,193 INFO L87 Difference]: Start difference. First operand 2232 states and 2900 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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) [2022-01-11 06:04:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:36,356 INFO L93 Difference]: Finished difference Result 3326 states and 4345 transitions. [2022-01-11 06:04:36,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:36,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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) Word has length 55 [2022-01-11 06:04:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:36,363 INFO L225 Difference]: With dead ends: 3326 [2022-01-11 06:04:36,363 INFO L226 Difference]: Without dead ends: 1586 [2022-01-11 06:04:36,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:36,368 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 82 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:36,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 315 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2022-01-11 06:04:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1570. [2022-01-11 06:04:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1569 states have (on average 1.2721478648820905) internal successors, (1996), 1569 states have internal predecessors, (1996), 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) [2022-01-11 06:04:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1996 transitions. [2022-01-11 06:04:36,508 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1996 transitions. Word has length 55 [2022-01-11 06:04:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:36,508 INFO L470 AbstractCegarLoop]: Abstraction has 1570 states and 1996 transitions. [2022-01-11 06:04:36,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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) [2022-01-11 06:04:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1996 transitions. [2022-01-11 06:04:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-11 06:04:36,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:36,510 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 06:04:36,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 06:04:36,511 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:36,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash 262675101, now seen corresponding path program 1 times [2022-01-11 06:04:36,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:36,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483591554] [2022-01-11 06:04:36,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:36,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:04:36,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:36,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483591554] [2022-01-11 06:04:36,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483591554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:36,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:36,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:36,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300258463] [2022-01-11 06:04:36,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:36,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:36,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:36,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:36,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:36,564 INFO L87 Difference]: Start difference. First operand 1570 states and 1996 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-01-11 06:04:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:36,788 INFO L93 Difference]: Finished difference Result 4057 states and 5144 transitions. [2022-01-11 06:04:36,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:36,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) Word has length 59 [2022-01-11 06:04:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:36,796 INFO L225 Difference]: With dead ends: 4057 [2022-01-11 06:04:36,796 INFO L226 Difference]: Without dead ends: 1955 [2022-01-11 06:04:36,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:36,800 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 89 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:36,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 340 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2022-01-11 06:04:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1955. [2022-01-11 06:04:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1954 states have (on average 1.2563971340839304) internal successors, (2455), 1954 states have internal predecessors, (2455), 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) [2022-01-11 06:04:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2455 transitions. [2022-01-11 06:04:37,041 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2455 transitions. Word has length 59 [2022-01-11 06:04:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:37,042 INFO L470 AbstractCegarLoop]: Abstraction has 1955 states and 2455 transitions. [2022-01-11 06:04:37,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-01-11 06:04:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2455 transitions. [2022-01-11 06:04:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-11 06:04:37,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:37,044 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:37,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 06:04:37,044 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:37,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash 987637842, now seen corresponding path program 1 times [2022-01-11 06:04:37,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:37,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7006787] [2022-01-11 06:04:37,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:37,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 06:04:37,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:37,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7006787] [2022-01-11 06:04:37,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7006787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:37,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:37,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:37,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892222588] [2022-01-11 06:04:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:37,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:37,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:37,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:37,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:37,078 INFO L87 Difference]: Start difference. First operand 1955 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2022-01-11 06:04:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:37,262 INFO L93 Difference]: Finished difference Result 3818 states and 4807 transitions. [2022-01-11 06:04:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:37,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) Word has length 67 [2022-01-11 06:04:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:37,270 INFO L225 Difference]: With dead ends: 3818 [2022-01-11 06:04:37,270 INFO L226 Difference]: Without dead ends: 1955 [2022-01-11 06:04:37,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:37,274 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 74 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:37,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2022-01-11 06:04:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1955. [2022-01-11 06:04:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1954 states have (on average 1.235926305015353) internal successors, (2415), 1954 states have internal predecessors, (2415), 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) [2022-01-11 06:04:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2415 transitions. [2022-01-11 06:04:37,467 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2415 transitions. Word has length 67 [2022-01-11 06:04:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:37,467 INFO L470 AbstractCegarLoop]: Abstraction has 1955 states and 2415 transitions. [2022-01-11 06:04:37,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2022-01-11 06:04:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2415 transitions. [2022-01-11 06:04:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 06:04:37,474 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:37,474 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:37,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 06:04:37,474 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1811953015, now seen corresponding path program 1 times [2022-01-11 06:04:37,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:37,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390754565] [2022-01-11 06:04:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:37,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 06:04:37,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:37,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390754565] [2022-01-11 06:04:37,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390754565] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:37,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:37,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:37,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843803948] [2022-01-11 06:04:37,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:37,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:37,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:37,511 INFO L87 Difference]: Start difference. First operand 1955 states and 2415 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2022-01-11 06:04:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:37,656 INFO L93 Difference]: Finished difference Result 3254 states and 4049 transitions. [2022-01-11 06:04:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:37,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) Word has length 68 [2022-01-11 06:04:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:37,663 INFO L225 Difference]: With dead ends: 3254 [2022-01-11 06:04:37,663 INFO L226 Difference]: Without dead ends: 1629 [2022-01-11 06:04:37,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:37,666 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 99 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:37,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 327 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-01-11 06:04:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1627. [2022-01-11 06:04:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1626 states have (on average 1.2183271832718328) internal successors, (1981), 1626 states have internal predecessors, (1981), 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) [2022-01-11 06:04:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1981 transitions. [2022-01-11 06:04:37,837 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1981 transitions. Word has length 68 [2022-01-11 06:04:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:37,837 INFO L470 AbstractCegarLoop]: Abstraction has 1627 states and 1981 transitions. [2022-01-11 06:04:37,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2022-01-11 06:04:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1981 transitions. [2022-01-11 06:04:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 06:04:37,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:37,840 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:37,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 06:04:37,840 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:37,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:37,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1964864180, now seen corresponding path program 1 times [2022-01-11 06:04:37,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:37,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390223333] [2022-01-11 06:04:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:37,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-11 06:04:37,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:37,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390223333] [2022-01-11 06:04:37,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390223333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:37,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:37,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:04:37,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752668791] [2022-01-11 06:04:37,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:37,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:37,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:37,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:37,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:37,873 INFO L87 Difference]: Start difference. First operand 1627 states and 1981 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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) [2022-01-11 06:04:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:38,038 INFO L93 Difference]: Finished difference Result 3271 states and 4085 transitions. [2022-01-11 06:04:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:38,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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) Word has length 99 [2022-01-11 06:04:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:38,045 INFO L225 Difference]: With dead ends: 3271 [2022-01-11 06:04:38,045 INFO L226 Difference]: Without dead ends: 1903 [2022-01-11 06:04:38,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:38,047 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 106 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:38,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 213 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2022-01-11 06:04:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1864. [2022-01-11 06:04:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 1.2447665056360708) internal successors, (2319), 1863 states have internal predecessors, (2319), 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) [2022-01-11 06:04:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2319 transitions. [2022-01-11 06:04:38,217 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2319 transitions. Word has length 99 [2022-01-11 06:04:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:38,217 INFO L470 AbstractCegarLoop]: Abstraction has 1864 states and 2319 transitions. [2022-01-11 06:04:38,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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) [2022-01-11 06:04:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2319 transitions. [2022-01-11 06:04:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-11 06:04:38,219 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:38,220 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-11 06:04:38,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 06:04:38,220 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1403791632, now seen corresponding path program 1 times [2022-01-11 06:04:38,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:38,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053925529] [2022-01-11 06:04:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:38,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 06:04:38,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:38,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053925529] [2022-01-11 06:04:38,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053925529] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:38,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:38,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:38,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406286744] [2022-01-11 06:04:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:38,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:38,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:38,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:38,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:38,257 INFO L87 Difference]: Start difference. First operand 1864 states and 2319 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-11 06:04:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:38,462 INFO L93 Difference]: Finished difference Result 3473 states and 4364 transitions. [2022-01-11 06:04:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:38,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) Word has length 109 [2022-01-11 06:04:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:38,468 INFO L225 Difference]: With dead ends: 3473 [2022-01-11 06:04:38,469 INFO L226 Difference]: Without dead ends: 1872 [2022-01-11 06:04:38,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:38,473 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:38,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 116 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2022-01-11 06:04:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1872. [2022-01-11 06:04:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.2298236237306253) internal successors, (2301), 1871 states have internal predecessors, (2301), 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) [2022-01-11 06:04:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2301 transitions. [2022-01-11 06:04:38,669 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2301 transitions. Word has length 109 [2022-01-11 06:04:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:38,670 INFO L470 AbstractCegarLoop]: Abstraction has 1872 states and 2301 transitions. [2022-01-11 06:04:38,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-11 06:04:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2301 transitions. [2022-01-11 06:04:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-11 06:04:38,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:38,672 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-11 06:04:38,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 06:04:38,672 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1644331761, now seen corresponding path program 1 times [2022-01-11 06:04:38,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:38,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350437551] [2022-01-11 06:04:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:38,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 06:04:38,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:38,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350437551] [2022-01-11 06:04:38,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350437551] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:38,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:38,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:38,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067567147] [2022-01-11 06:04:38,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:38,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:38,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:38,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:38,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:38,727 INFO L87 Difference]: Start difference. First operand 1872 states and 2301 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-11 06:04:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:38,842 INFO L93 Difference]: Finished difference Result 2635 states and 3259 transitions. [2022-01-11 06:04:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:38,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) Word has length 109 [2022-01-11 06:04:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:38,846 INFO L225 Difference]: With dead ends: 2635 [2022-01-11 06:04:38,846 INFO L226 Difference]: Without dead ends: 1026 [2022-01-11 06:04:38,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:38,849 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:38,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 137 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2022-01-11 06:04:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2022-01-11 06:04:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.1882926829268292) internal successors, (1218), 1025 states have internal predecessors, (1218), 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) [2022-01-11 06:04:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1218 transitions. [2022-01-11 06:04:38,970 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1218 transitions. Word has length 109 [2022-01-11 06:04:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:38,970 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1218 transitions. [2022-01-11 06:04:38,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-11 06:04:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1218 transitions. [2022-01-11 06:04:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-11 06:04:38,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:38,972 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:38,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 06:04:38,973 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:38,973 INFO L85 PathProgramCache]: Analyzing trace with hash 963674917, now seen corresponding path program 1 times [2022-01-11 06:04:38,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:38,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817973779] [2022-01-11 06:04:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:38,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 06:04:39,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:39,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817973779] [2022-01-11 06:04:39,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817973779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:39,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:39,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:39,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844425736] [2022-01-11 06:04:39,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:39,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:39,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:39,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:39,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:39,017 INFO L87 Difference]: Start difference. First operand 1026 states and 1218 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-01-11 06:04:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:39,130 INFO L93 Difference]: Finished difference Result 1798 states and 2162 transitions. [2022-01-11 06:04:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:39,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) Word has length 112 [2022-01-11 06:04:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:39,134 INFO L225 Difference]: With dead ends: 1798 [2022-01-11 06:04:39,134 INFO L226 Difference]: Without dead ends: 1035 [2022-01-11 06:04:39,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:39,137 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:39,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 120 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-01-11 06:04:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2022-01-11 06:04:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1034 states have (on average 1.1731141199226305) internal successors, (1213), 1034 states have internal predecessors, (1213), 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) [2022-01-11 06:04:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1213 transitions. [2022-01-11 06:04:39,235 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1213 transitions. Word has length 112 [2022-01-11 06:04:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:39,235 INFO L470 AbstractCegarLoop]: Abstraction has 1035 states and 1213 transitions. [2022-01-11 06:04:39,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-01-11 06:04:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1213 transitions. [2022-01-11 06:04:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-11 06:04:39,237 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:39,238 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:39,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 06:04:39,238 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:04:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash 514978278, now seen corresponding path program 1 times [2022-01-11 06:04:39,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:39,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771634018] [2022-01-11 06:04:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:39,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:04:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 06:04:39,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:04:39,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771634018] [2022-01-11 06:04:39,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771634018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:04:39,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:04:39,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:04:39,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645875049] [2022-01-11 06:04:39,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:04:39,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:04:39,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:04:39,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:04:39,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:39,286 INFO L87 Difference]: Start difference. First operand 1035 states and 1213 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-01-11 06:04:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:39,364 INFO L93 Difference]: Finished difference Result 1430 states and 1676 transitions. [2022-01-11 06:04:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:04:39,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) Word has length 112 [2022-01-11 06:04:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:39,365 INFO L225 Difference]: With dead ends: 1430 [2022-01-11 06:04:39,365 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 06:04:39,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:04:39,367 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 63 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:39,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:04:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 06:04:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 06:04:39,368 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) [2022-01-11 06:04:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 06:04:39,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2022-01-11 06:04:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:39,368 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 06:04:39,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-01-11 06:04:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 06:04:39,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 06:04:39,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-11 06:04:39,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-11 06:04:39,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 06:04:39,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 06:04:55,407 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 06:04:55,408 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 06:04:55,408 INFO L854 garLoopResultBuilder]: At program point L462(lines 448 464) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= ~q_free~0Int 1) (<= ~p_last_write~0Int ~c_last_read~0Int) (= ~q_write_ev~0Int ~q_read_ev~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int) (<= 2 ~q_write_ev~0Int)) [2022-01-11 06:04:55,408 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 228) no Hoare annotation was computed. [2022-01-11 06:04:55,408 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2022-01-11 06:04:55,408 INFO L854 garLoopResultBuilder]: At program point L222-2(lines 218 232) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= ~q_free~0Int 1) (<= ~p_last_write~0Int ~c_last_read~0Int) (= ~q_write_ev~0Int ~q_read_ev~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int) (<= 2 ~q_write_ev~0Int)) [2022-01-11 06:04:55,408 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2022-01-11 06:04:55,408 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2022-01-11 06:04:55,408 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2022-01-11 06:04:55,409 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2022-01-11 06:04:55,409 INFO L854 garLoopResultBuilder]: At program point L48(lines 31 50) the Hoare annotation is: false [2022-01-11 06:04:55,409 INFO L854 garLoopResultBuilder]: At program point L242-1(lines 233 250) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= ~c_dr_st~0Int 0)) (.cse4 (= ~c_num_read~0Int 0)) (.cse5 (= ~p_num_write~0Int 0)) (.cse6 (= ~p_dw_pc~0Int 0)) (.cse7 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse10 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse11 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse12 (<= 2 ~q_write_ev~0Int))) (or (and .cse0 .cse1 .cse2 (= 0 ~p_dw_st~0Int) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~c_dr_st~0Int) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~p_dw_st~0Int) .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-01-11 06:04:55,409 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 279) no Hoare annotation was computed. [2022-01-11 06:04:55,409 INFO L858 garLoopResultBuilder]: For program point L275-2(lines 274 287) no Hoare annotation was computed. [2022-01-11 06:04:55,409 INFO L854 garLoopResultBuilder]: At program point L280-1(lines 271 288) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= ~c_dr_st~0Int 0)) (.cse4 (= ~c_num_read~0Int 0)) (.cse5 (= ~p_num_write~0Int 0)) (.cse6 (= ~p_dw_pc~0Int 0)) (.cse7 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse10 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse11 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse12 (<= 2 ~q_write_ev~0Int))) (or (and .cse0 .cse1 .cse2 (= 0 ~p_dw_st~0Int) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~c_dr_st~0Int) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~p_dw_st~0Int) .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-01-11 06:04:55,409 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2022-01-11 06:04:55,409 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2022-01-11 06:04:55,409 INFO L858 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2022-01-11 06:04:55,410 INFO L854 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse10 (<= ~q_req_up~0Int 0)) (.cse1 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse11 (= ~c_dr_st~0Int 0)) (.cse3 (= ~c_num_read~0Int 0)) (.cse4 (= ~p_num_write~0Int 0)) (.cse5 (= ~p_dw_pc~0Int 0)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= ~q_free~0Int 1)) (.cse8 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse12 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse9 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse13 (<= 2 ~q_write_ev~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~c_dr_st~0Int) .cse9) (and .cse0 .cse10 .cse1 (= 0 ~p_dw_st~0Int) .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse13) (and .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 (<= 2 ~p_dw_st~0Int) .cse7 .cse8 .cse12 .cse9 .cse13))) [2022-01-11 06:04:55,410 INFO L854 garLoopResultBuilder]: At program point L77(lines 61 79) the Hoare annotation is: (let ((.cse1 (<= ~q_req_up~0Int 0)) (.cse4 (= ~c_dr_st~0Int 0)) (.cse12 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse14 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse5 (= ~c_num_read~0Int 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse7 (= ~p_num_write~0Int 0)) (.cse8 (= ~p_dw_pc~0Int 0)) (.cse9 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse10 (= ~q_free~0Int 1)) (.cse11 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 (= 0 ~p_dw_st~0Int) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~p_dw_st~0Int) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 ~c_dr_st~0Int) .cse13))) [2022-01-11 06:04:55,410 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2022-01-11 06:04:55,410 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 319) no Hoare annotation was computed. [2022-01-11 06:04:55,410 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2022-01-11 06:04:55,410 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-01-11 06:04:55,410 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2022-01-11 06:04:55,410 INFO L854 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse1 (<= ~q_req_up~0Int 0)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse15 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse17 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse7 (= ~c_num_read~0Int 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse9 (= ~p_num_write~0Int 0)) (.cse10 (= ~p_dw_pc~0Int 0)) (.cse11 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse12 (= ~q_free~0Int 1)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse16 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 ~p_dw_st~0Int) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 ~c_dr_st~0Int) .cse16))) [2022-01-11 06:04:55,410 INFO L854 garLoopResultBuilder]: At program point L96(lines 80 98) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= ~p_dw_pc~0Int 0)) (.cse12 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse13 (= ~q_free~0Int 1)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse15 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse16 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse17 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse18 (<= 2 ~q_write_ev~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 2 ~p_dw_st~0Int) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 2 ~c_dr_st~0Int) .cse17) (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2022-01-11 06:04:55,411 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-01-11 06:04:55,411 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 307 331) the Hoare annotation is: (let ((.cse1 (<= ~q_req_up~0Int 0)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse17 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse20 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse14 (= ~q_free~0Int 1)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse16 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse19 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ~p_dw_st~0Int) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 2 ~c_dr_st~0Int) .cse18 .cse19))) [2022-01-11 06:04:55,411 INFO L858 garLoopResultBuilder]: For program point L293(lines 293 297) no Hoare annotation was computed. [2022-01-11 06:04:55,411 INFO L858 garLoopResultBuilder]: For program point L293-2(lines 292 305) no Hoare annotation was computed. [2022-01-11 06:04:55,411 INFO L854 garLoopResultBuilder]: At program point L298-1(lines 289 306) the Hoare annotation is: (let ((.cse1 (<= ~q_req_up~0Int 0)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse17 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse20 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse14 (= ~q_free~0Int 1)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse16 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse19 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ~p_dw_st~0Int) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 2 ~c_dr_st~0Int) .cse18 .cse19))) [2022-01-11 06:04:55,411 INFO L854 garLoopResultBuilder]: At program point L419-2(lines 419 441) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,411 INFO L861 garLoopResultBuilder]: At program point L442(lines 405 447) the Hoare annotation is: true [2022-01-11 06:04:55,411 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-11 06:04:55,412 INFO L861 garLoopResultBuilder]: At program point L474(lines 465 476) the Hoare annotation is: true [2022-01-11 06:04:55,412 INFO L854 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse20 .cse32) (and .cse30 .cse23 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,412 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 06:04:55,412 INFO L854 garLoopResultBuilder]: At program point L380(lines 332 385) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse20 .cse32) (and .cse30 .cse23 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,412 INFO L858 garLoopResultBuilder]: For program point L340(line 340) no Hoare annotation was computed. [2022-01-11 06:04:55,412 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 06:04:55,412 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 228) no Hoare annotation was computed. [2022-01-11 06:04:55,412 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2022-01-11 06:04:55,412 INFO L858 garLoopResultBuilder]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2022-01-11 06:04:55,413 INFO L854 garLoopResultBuilder]: At program point L222-5(lines 218 232) the Hoare annotation is: (let ((.cse35 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse34 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse32 (< .cse35 .cse34)) (.cse33 (<= ~p_num_write~0Int .cse35)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse30 (= ~q_free~0Int 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse31 (= ~p_num_write~0Int 1)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse34)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse29 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse26 (not (= ~q_write_ev~0Int 0))) (.cse27 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse28 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse23 .cse24 .cse25 .cse13 .cse14 .cse26 .cse27 .cse15 .cse28 .cse20) (and .cse23 .cse24 .cse25 .cse29 .cse13 .cse14 .cse26 .cse27 .cse15 .cse28 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse31 .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse29 .cse13 .cse14 .cse26 .cse27 .cse32 .cse20 .cse33) (and .cse30 .cse23 .cse29 .cse13 .cse14 .cse26 .cse27 .cse32 .cse28 .cse20 .cse33) (and .cse30 .cse1 .cse23 .cse29 .cse13 .cse14 .cse27 .cse32 .cse28 .cse20 .cse33) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse28 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse19 .cse20) (and .cse0 .cse30 .cse1 .cse3 .cse23 .cse6 .cse7 .cse8 .cse31 .cse11 .cse29 .cse13 .cse14 .cse27 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse29 .cse13 .cse26 .cse27 .cse15 .cse28 .cse20)))) [2022-01-11 06:04:55,413 INFO L854 garLoopResultBuilder]: At program point L267(lines 254 269) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse20 .cse32) (and .cse30 .cse23 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,413 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2022-01-11 06:04:55,413 INFO L858 garLoopResultBuilder]: For program point L35-5(lines 34 49) no Hoare annotation was computed. [2022-01-11 06:04:55,413 INFO L858 garLoopResultBuilder]: For program point L275-3(lines 275 279) no Hoare annotation was computed. [2022-01-11 06:04:55,413 INFO L854 garLoopResultBuilder]: At program point L268(lines 251 270) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse20 .cse32) (and .cse30 .cse23 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,413 INFO L858 garLoopResultBuilder]: For program point L40-3(lines 40 44) no Hoare annotation was computed. [2022-01-11 06:04:55,413 INFO L858 garLoopResultBuilder]: For program point L275-5(lines 274 287) no Hoare annotation was computed. [2022-01-11 06:04:55,413 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2022-01-11 06:04:55,414 INFO L854 garLoopResultBuilder]: At program point L48-1(lines 31 50) the Hoare annotation is: (let ((.cse2 (+ ~p_num_write~0Int 1)) (.cse6 (= ~q_free~0Int 1)) (.cse7 (<= 2 ~c_dr_st~0Int)) (.cse12 (= 0 ~c_dr_pc~0Int)) (.cse9 (= ~q_free~0Int 0)) (.cse0 (<= ~q_req_up~0Int 0)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse1 (not (= ~q_read_ev~0Int 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse10 (not (= ~q_read_ev~0Int 0))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (<= 2 ~p_dw_st~0Int)) (.cse5 (not (= ~q_write_ev~0Int 1))) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse8 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 (< ~c_num_read~0Int .cse2) (<= ~p_num_write~0Int ~c_num_read~0Int) .cse3 .cse4 (not (= ~q_write_ev~0Int 0)) .cse5 .cse6 .cse7 .cse8) (let ((.cse11 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse9 .cse0 .cse1 .cse10 .cse3 .cse4 .cse5 (< .cse11 .cse2) .cse7 .cse8 (<= ~p_num_write~0Int .cse11))) (and .cse12 .cse9 .cse13 .cse14 .cse15 .cse3 .cse7 .cse16 .cse8) (and .cse12 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) .cse13 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse14 .cse17 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (= ~p_num_write~0Int 0) .cse15 (= ~p_dw_pc~0Int 0) .cse3 .cse6 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (<= ~p_last_write~0Int ~c_last_read~0Int) .cse7 .cse16 .cse8) (and .cse12 .cse9 .cse0 .cse13 .cse1 .cse14 (= ~c_dr_st~0Int 0) .cse17 (= ~p_num_write~0Int 1) .cse15 .cse10 .cse3 .cse4 .cse5 .cse16 .cse8))) [2022-01-11 06:04:55,414 INFO L854 garLoopResultBuilder]: At program point L280-3(lines 271 288) the Hoare annotation is: (let ((.cse35 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse34 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse32 (< .cse35 .cse34)) (.cse33 (<= ~p_num_write~0Int .cse35)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse31 (= ~p_num_write~0Int 1)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse29 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse23 (< ~c_num_read~0Int .cse34)) (.cse24 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse25 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse26 (not (= ~q_write_ev~0Int 0))) (.cse27 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse28 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse23 .cse24 .cse25 .cse13 .cse14 .cse26 .cse27 .cse15 .cse28 .cse20) (and .cse29 .cse23 .cse24 .cse25 .cse13 .cse14 .cse26 .cse27 .cse15 .cse28 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse31 .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse29 .cse7 .cse25 .cse13 .cse14 .cse26 .cse27 .cse32 .cse20 .cse33) (and .cse30 .cse29 .cse25 .cse13 .cse14 .cse26 .cse27 .cse32 .cse28 .cse20 .cse33) (and .cse30 .cse1 .cse29 .cse25 .cse13 .cse14 .cse26 .cse32 .cse28 .cse20 .cse33) (and .cse0 .cse30 .cse1 .cse3 .cse29 .cse6 .cse7 .cse8 .cse31 .cse11 .cse25 .cse13 .cse14 .cse26 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse28 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse19 .cse20) (and .cse1 .cse29 .cse22 .cse23 .cse24 .cse25 .cse13 .cse26 .cse27 .cse15 .cse28 .cse20)))) [2022-01-11 06:04:55,414 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2022-01-11 06:04:55,414 INFO L858 garLoopResultBuilder]: For program point L65-3(lines 65 74) no Hoare annotation was computed. [2022-01-11 06:04:55,414 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2022-01-11 06:04:55,414 INFO L858 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2022-01-11 06:04:55,414 INFO L858 garLoopResultBuilder]: For program point L66-1(lines 66 71) no Hoare annotation was computed. [2022-01-11 06:04:55,414 INFO L858 garLoopResultBuilder]: For program point L65-5(lines 65 74) no Hoare annotation was computed. [2022-01-11 06:04:55,414 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2022-01-11 06:04:55,415 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2022-01-11 06:04:55,415 INFO L854 garLoopResultBuilder]: At program point L76-1(lines 64 78) the Hoare annotation is: (let ((.cse29 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse30 (+ ~p_num_write~0Int 1))) (let ((.cse4 (< ~c_num_read~0Int .cse30)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse19 (= ~p_num_write~0Int 1)) (.cse9 (not (= ~q_write_ev~0Int 1))) (.cse2 (= 0 ~p_dw_st~0Int)) (.cse17 (= ~c_dr_st~0Int 0)) (.cse23 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse24 (<= 2 ~q_write_ev~0Int)) (.cse14 (= ~q_free~0Int 0)) (.cse0 (<= ~q_req_up~0Int 0)) (.cse1 (not (= ~q_read_ev~0Int 1))) (.cse6 (not (= ~q_read_ev~0Int 0))) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse8 (not (= ~q_write_ev~0Int 0))) (.cse21 (< .cse29 .cse30)) (.cse22 (<= ~p_num_write~0Int .cse29)) (.cse13 (= 0 ~c_dr_pc~0Int)) (.cse25 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse18 (= ~c_num_read~0Int 0)) (.cse26 (= ~p_num_write~0Int 0)) (.cse27 (= ~p_dw_pc~0Int 0)) (.cse7 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse10 (= ~q_free~0Int 1)) (.cse28 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~c_dr_st~0Int)) (.cse12 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse1 .cse3 .cse16 .cse17 .cse18 .cse19 .cse6 .cse7 .cse20 .cse8 .cse12) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse14 .cse0 .cse1 .cse3 .cse17 .cse6 .cse7 .cse20 .cse8 .cse9 .cse21 .cse12 .cse22) (and .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20 .cse23 .cse12 .cse24) (and .cse13 .cse14 .cse15 .cse16 .cse7 .cse11 .cse12) (and .cse14 .cse1 .cse3 .cse6 .cse7 .cse20 .cse8 .cse9 .cse21 .cse11 .cse12 .cse22) (and .cse13 .cse0 .cse25 .cse15 .cse3 .cse16 .cse17 .cse18 .cse26 .cse27 .cse7 .cse20 .cse10 .cse28 .cse23 .cse12 .cse24) (and .cse13 .cse0 .cse25 .cse15 .cse2 .cse3 .cse16 .cse17 .cse18 .cse26 .cse27 .cse7 .cse10 .cse28 .cse23 .cse12 .cse24) (and .cse14 .cse0 .cse1 .cse3 .cse6 .cse7 .cse20 .cse8 .cse21 .cse11 .cse12 .cse22) (and .cse13 .cse25 .cse15 .cse3 .cse16 .cse18 .cse26 .cse27 .cse7 .cse10 .cse28 .cse11 .cse12)))) [2022-01-11 06:04:55,415 INFO L854 garLoopResultBuilder]: At program point L139-1(lines 127 162) the Hoare annotation is: (let ((.cse1 (not (= ~q_read_ev~0Int 1))) (.cse7 (+ ~p_num_write~0Int 1)) (.cse2 (not (= ~q_read_ev~0Int 0))) (.cse4 (not (= ~q_write_ev~0Int 0))) (.cse5 (not (= ~q_write_ev~0Int 1))) (.cse8 (<= 2 ~c_dr_st~0Int)) (.cse0 (= ~q_free~0Int 0)) (.cse11 (= 0 ~c_dr_pc~0Int)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse20 (= ~c_dr_st~0Int 0)) (.cse16 (= ~c_num_read~0Int 0)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse17 (= ~p_num_write~0Int 0)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse10 (= ~q_free~0Int 1)) (.cse22 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse23 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse15 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse9 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse24 (<= 2 ~q_write_ev~0Int))) (or (let ((.cse6 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse6 .cse7) .cse8 .cse9 (<= ~p_num_write~0Int .cse6))) (and .cse1 (< ~c_num_read~0Int .cse7) (<= ~p_num_write~0Int ~c_num_read~0Int) .cse2 .cse3 .cse4 .cse5 .cse10 .cse8 .cse9) (and .cse11 .cse0 .cse12 .cse13 .cse14 .cse3 .cse8 .cse15 .cse9) (and .cse11 .cse12 .cse13 .cse16 .cse17 .cse14 .cse3 .cse10 .cse8 .cse15 .cse9) (and .cse11 .cse0 .cse12 .cse18 .cse19 .cse13 .cse20 .cse16 .cse21 (= ~p_num_write~0Int 1) .cse14 .cse3 .cse22 .cse23 .cse15 .cse9 .cse24) (and .cse11 (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) .cse12 .cse18 .cse19 .cse13 .cse20 .cse16 .cse21 .cse17 .cse14 (= ~p_dw_pc~0Int 0) .cse3 .cse10 .cse22 (<= ~p_last_write~0Int ~c_last_read~0Int) .cse23 .cse15 .cse9 .cse24))) [2022-01-11 06:04:55,415 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2022-01-11 06:04:55,415 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2022-01-11 06:04:55,415 INFO L854 garLoopResultBuilder]: At program point L77-1(lines 61 79) the Hoare annotation is: (let ((.cse30 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse31 (+ ~p_num_write~0Int 1))) (let ((.cse29 (= 0 ~p_dw_st~0Int)) (.cse15 (< ~c_num_read~0Int .cse31)) (.cse16 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse1 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse7 (= ~p_num_write~0Int 0)) (.cse8 (= ~p_dw_pc~0Int 0)) (.cse10 (= ~q_free~0Int 1)) (.cse11 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse24 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse25 (<= 2 ~q_write_ev~0Int)) (.cse20 (not (= ~q_write_ev~0Int 1))) (.cse27 (< .cse30 .cse31)) (.cse12 (<= 2 ~c_dr_st~0Int)) (.cse28 (<= ~p_num_write~0Int .cse30)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse21 (= ~q_free~0Int 0)) (.cse14 (<= ~q_req_up~0Int 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse26 (not (= ~q_read_ev~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse22 (= ~c_dr_st~0Int 0)) (.cse5 (= ~c_num_read~0Int 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse23 (= ~p_num_write~0Int 1)) (.cse17 (not (= ~q_read_ev~0Int 0))) (.cse9 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse18 (<= 2 ~p_dw_st~0Int)) (.cse19 (not (= ~q_write_ev~0Int 0))) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse10 .cse12 .cse13) (and .cse0 .cse21 .cse2 .cse3 .cse4 .cse22 .cse5 .cse6 .cse23 .cse9 .cse18 .cse24 .cse13 .cse25) (and .cse21 .cse14 .cse26 .cse3 .cse22 .cse6 .cse17 .cse9 .cse18 .cse19 .cse20 .cse27 .cse13 .cse28) (and .cse14 .cse26 .cse29 .cse3 .cse6 .cse15 .cse16 .cse17 .cse9 .cse19 .cse20 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse29 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse25) (and .cse0 .cse21 .cse2 .cse4 .cse9 .cse12 .cse13) (and .cse26 .cse3 .cse6 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse24 .cse13 .cse25) (and .cse21 .cse14 .cse26 .cse3 .cse6 .cse17 .cse9 .cse18 .cse19 .cse27 .cse12 .cse13 .cse28) (and .cse21 .cse26 .cse3 .cse6 .cse17 .cse9 .cse18 .cse19 .cse20 .cse27 .cse12 .cse13 .cse28) (and .cse0 .cse21 .cse14 .cse2 .cse26 .cse3 .cse4 .cse22 .cse5 .cse6 .cse23 .cse17 .cse9 .cse18 .cse19 .cse13)))) [2022-01-11 06:04:55,415 INFO L854 garLoopResultBuilder]: At program point L158(lines 124 163) the Hoare annotation is: (let ((.cse6 (<= 2 ~p_dw_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse5 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse8 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse3 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (= ~p_num_write~0Int 1) .cse4 .cse5 .cse6 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (= ~q_write_ev~0Int ~q_read_ev~0Int) .cse7 .cse8 (<= 2 ~q_write_ev~0Int)) (let ((.cse9 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse1 (not (= ~q_read_ev~0Int 1)) (not (= ~q_read_ev~0Int 0)) .cse5 .cse6 (not (= ~q_write_ev~0Int 0)) (not (= ~q_write_ev~0Int 1)) (< .cse9 (+ ~p_num_write~0Int 1)) .cse10 .cse8 (<= ~p_num_write~0Int .cse9))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse8))) [2022-01-11 06:04:55,416 INFO L858 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2022-01-11 06:04:55,416 INFO L854 garLoopResultBuilder]: At program point L141(lines 127 162) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0Int)) (.cse3 (= 0 ~c_dr_pc~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse6 (= ~c_num_read~0Int 0)) (.cse7 (= ~p_num_write~0Int 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse0 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse2 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (not (= ~q_read_ev~0Int 1)) (< ~c_num_read~0Int (+ ~p_num_write~0Int 1)) (<= ~p_num_write~0Int ~c_num_read~0Int) (not (= ~q_read_ev~0Int 0)) .cse0 (not (= ~q_write_ev~0Int 0)) (not (= ~q_write_ev~0Int 1)) .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse1 .cse9 .cse2) (and .cse3 (= ~q_free~0Int 0) .cse4 .cse5 .cse8 .cse0 .cse1 .cse9 .cse2) (and .cse3 (<= ~q_req_up~0Int 0) .cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse5 (= ~c_dr_st~0Int 0) .cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) .cse7 .cse8 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (= ~q_write_ev~0Int ~q_read_ev~0Int) .cse9 .cse2 (<= 2 ~q_write_ev~0Int)))) [2022-01-11 06:04:55,416 INFO L854 garLoopResultBuilder]: At program point L198-1(lines 168 216) the Hoare annotation is: (let ((.cse11 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse11)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse0 (not (= ~q_read_ev~0Int 1))) (.cse3 (not (= ~q_read_ev~0Int 0))) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse5 (<= 2 ~p_dw_st~0Int)) (.cse6 (not (= ~q_write_ev~0Int 0))) (.cse7 (not (= ~q_write_ev~0Int 1))) (.cse9 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (= 0 ~p_dw_st~0Int) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0) .cse1 (= ~p_dw_pc~0Int 0) .cse2 .cse4 .cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (= ~q_write_ev~0Int ~q_read_ev~0Int) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1)) .cse9 (<= 2 ~q_write_ev~0Int)) (let ((.cse10 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 .cse11) .cse9 (<= ~p_num_write~0Int .cse10)))))) [2022-01-11 06:04:55,416 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2022-01-11 06:04:55,416 INFO L858 garLoopResultBuilder]: For program point L315-3(lines 315 319) no Hoare annotation was computed. [2022-01-11 06:04:55,416 INFO L854 garLoopResultBuilder]: At program point L212(lines 165 217) the Hoare annotation is: (let ((.cse0 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse1 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse2 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse3 (= ~q_free~0Int 1)) (.cse4 (<= 2 ~c_dr_st~0Int)) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (not (= ~q_read_ev~0Int 1)) .cse0 .cse1 (not (= ~q_read_ev~0Int 0)) .cse2 (<= 2 ~p_dw_st~0Int) (not (= ~q_write_ev~0Int 0)) (not (= ~q_write_ev~0Int 1)) .cse3 .cse4 .cse5) (and (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (= 0 ~p_dw_st~0Int) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0) .cse0 (= ~p_dw_pc~0Int 0) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (<= ~p_last_write~0Int ~c_last_read~0Int) .cse4 (= ~q_write_ev~0Int ~q_read_ev~0Int) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1)) .cse5 (<= 2 ~q_write_ev~0Int)))) [2022-01-11 06:04:55,416 INFO L858 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2022-01-11 06:04:55,416 INFO L854 garLoopResultBuilder]: At program point L173(lines 168 216) the Hoare annotation is: (let ((.cse0 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) (not (= ~q_read_ev~0Int 1)) (not (= ~q_read_ev~0Int 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= 2 ~p_dw_st~0Int) (not (= ~q_write_ev~0Int 0)) (not (= ~q_write_ev~0Int 1)) (< .cse0 (+ ~p_num_write~0Int 1)) (<= ~p_last_write~0Int ~q_buf_0~0Int) (<= ~p_num_write~0Int .cse0))) [2022-01-11 06:04:55,416 INFO L858 garLoopResultBuilder]: For program point L315-5(lines 315 319) no Hoare annotation was computed. [2022-01-11 06:04:55,416 INFO L858 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2022-01-11 06:04:55,417 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 84 93) no Hoare annotation was computed. [2022-01-11 06:04:55,417 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2022-01-11 06:04:55,417 INFO L858 garLoopResultBuilder]: For program point L85-1(lines 85 90) no Hoare annotation was computed. [2022-01-11 06:04:55,417 INFO L858 garLoopResultBuilder]: For program point L84-5(lines 84 93) no Hoare annotation was computed. [2022-01-11 06:04:55,417 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-01-11 06:04:55,417 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-01-11 06:04:55,417 INFO L854 garLoopResultBuilder]: At program point L95-1(lines 83 97) the Hoare annotation is: (let ((.cse31 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse32 (+ ~p_num_write~0Int 1))) (let ((.cse12 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse14 (<= 2 ~q_write_ev~0Int)) (.cse8 (= ~p_num_write~0Int 1)) (.cse16 (< ~c_num_read~0Int .cse32)) (.cse17 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (<= ~q_req_up~0Int 0)) (.cse5 (= ~c_dr_st~0Int 0)) (.cse24 (= 0 ~p_dw_st~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse15 (not (= ~q_read_ev~0Int 1))) (.cse18 (not (= ~q_read_ev~0Int 0))) (.cse10 (<= 2 ~p_dw_st~0Int)) (.cse19 (not (= ~q_write_ev~0Int 0))) (.cse20 (not (= ~q_write_ev~0Int 1))) (.cse29 (< .cse31 .cse32)) (.cse30 (<= ~p_num_write~0Int .cse31)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse25 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (= ~c_num_read~0Int 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse26 (= ~p_num_write~0Int 0)) (.cse27 (= ~p_dw_pc~0Int 0)) (.cse9 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (= ~q_free~0Int 1)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse28 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse22 (<= 2 ~c_dr_st~0Int)) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse15 .cse3 .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse21 .cse11 .cse22 .cse13) (and .cse23 .cse2 .cse24 .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse21 .cse22 .cse13) (and .cse0 .cse23 .cse25 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse9 .cse21 .cse11 .cse28 .cse12 .cse13 .cse14) (and .cse0 .cse23 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse9 .cse10 .cse21 .cse11 .cse28 .cse12 .cse13 .cse14) (and .cse1 .cse23 .cse15 .cse3 .cse18 .cse9 .cse10 .cse19 .cse11 .cse29 .cse22 .cse13 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse11 .cse22 .cse13) (and .cse0 .cse1 .cse23 .cse2 .cse15 .cse3 .cse5 .cse6 .cse8 .cse18 .cse9 .cse10 .cse19 .cse11 .cse13) (and .cse23 .cse2 .cse3 .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse21 .cse11 .cse22 .cse13) (and .cse1 .cse23 .cse2 .cse15 .cse3 .cse5 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 .cse29 .cse13 .cse30) (and .cse0 .cse1 .cse2 .cse24 .cse9 .cse22 .cse13) (and .cse1 .cse2 .cse15 .cse3 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 .cse29 .cse22 .cse13 .cse30) (and .cse0 .cse25 .cse2 .cse3 .cse4 .cse6 .cse7 .cse26 .cse27 .cse9 .cse21 .cse11 .cse28 .cse22 .cse13)))) [2022-01-11 06:04:55,417 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-01-11 06:04:55,417 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-01-11 06:04:55,417 INFO L854 garLoopResultBuilder]: At program point L21-1(lines 16 23) the Hoare annotation is: false [2022-01-11 06:04:55,418 INFO L854 garLoopResultBuilder]: At program point L96-1(lines 80 98) the Hoare annotation is: (let ((.cse33 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse32 (+ ~p_num_write~0Int 1))) (let ((.cse20 (< .cse33 .cse32)) (.cse22 (<= ~p_num_write~0Int .cse33)) (.cse9 (= ~p_num_write~0Int 1)) (.cse23 (<= ~q_req_up~0Int 0)) (.cse24 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse7 (= ~c_num_read~0Int 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse25 (= ~p_num_write~0Int 0)) (.cse26 (= ~p_dw_pc~0Int 0)) (.cse28 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse13 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse15 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse29 (= 0 ~p_dw_st~0Int)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse16 (not (= ~q_read_ev~0Int 1))) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse30 (< ~c_num_read~0Int .cse32)) (.cse31 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse17 (not (= ~q_read_ev~0Int 0))) (.cse10 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse11 (<= 2 ~p_dw_st~0Int)) (.cse18 (not (= ~q_write_ev~0Int 0))) (.cse19 (not (= ~q_write_ev~0Int 1))) (.cse27 (= ~q_free~0Int 1)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse21 (<= 2 ~c_dr_st~0Int)) (.cse14 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse10 .cse11 .cse18 .cse19 .cse12 .cse20 .cse21 .cse14 .cse22) (and .cse1 .cse23 .cse16 .cse3 .cse17 .cse10 .cse11 .cse18 .cse12 .cse20 .cse21 .cse14 .cse22) (and .cse1 .cse23 .cse2 .cse16 .cse3 .cse5 .cse6 .cse17 .cse10 .cse11 .cse18 .cse19 .cse12 .cse20 .cse14 .cse22) (and .cse0 .cse23 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse26 .cse10 .cse11 .cse27 .cse12 .cse28 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse12 .cse21 .cse14) (and .cse0 .cse24 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse25 .cse26 .cse10 .cse27 .cse12 .cse28 .cse21 .cse14) (and .cse23 .cse2 .cse29 .cse5 .cse30 .cse31 .cse17 .cse10 .cse18 .cse19 .cse27 .cse21 .cse14) (and .cse23 .cse2 .cse3 .cse5 .cse30 .cse31 .cse17 .cse10 .cse11 .cse18 .cse19 .cse27 .cse12 .cse21 .cse14) (and .cse0 .cse1 .cse23 .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse9 .cse17 .cse10 .cse11 .cse18 .cse12 .cse14) (and .cse0 .cse23 .cse24 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse26 .cse10 .cse27 .cse12 .cse28 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse29 .cse5 .cse10 .cse21 .cse14) (and .cse2 .cse16 .cse3 .cse5 .cse30 .cse31 .cse17 .cse10 .cse11 .cse18 .cse19 .cse27 .cse12 .cse21 .cse14)))) [2022-01-11 06:04:55,418 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-01-11 06:04:55,418 INFO L854 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2022-01-11 06:04:55,418 INFO L858 garLoopResultBuilder]: For program point L323-3(lines 323 327) no Hoare annotation was computed. [2022-01-11 06:04:55,418 INFO L854 garLoopResultBuilder]: At program point L323-5(lines 307 331) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse22 (= 0 ~p_dw_st~0Int)) (.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse1 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse16 .cse31 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20)))) [2022-01-11 06:04:55,418 INFO L858 garLoopResultBuilder]: For program point L293-3(lines 293 297) no Hoare annotation was computed. [2022-01-11 06:04:55,418 INFO L858 garLoopResultBuilder]: For program point L293-5(lines 292 305) no Hoare annotation was computed. [2022-01-11 06:04:55,419 INFO L854 garLoopResultBuilder]: At program point L298-3(lines 289 306) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,419 INFO L858 garLoopResultBuilder]: For program point L255-1(lines 255 265) no Hoare annotation was computed. [2022-01-11 06:04:55,419 INFO L854 garLoopResultBuilder]: At program point L267-1(lines 254 269) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,419 INFO L858 garLoopResultBuilder]: For program point L259-1(lines 259 264) no Hoare annotation was computed. [2022-01-11 06:04:55,419 INFO L854 garLoopResultBuilder]: At program point L268-1(lines 251 270) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,419 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2022-01-11 06:04:55,419 INFO L854 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,420 INFO L854 garLoopResultBuilder]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-11 06:04:55,420 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-01-11 06:04:55,423 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:55,424 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 06:04:55,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:04:55 BasicIcfg [2022-01-11 06:04:55,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 06:04:55,575 INFO L158 Benchmark]: Toolchain (without parser) took 25215.72ms. Allocated memory was 190.8MB in the beginning and 778.0MB in the end (delta: 587.2MB). Free memory was 134.1MB in the beginning and 330.4MB in the end (delta: -196.3MB). Peak memory consumption was 454.0MB. Max. memory is 8.0GB. [2022-01-11 06:04:55,576 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 06:04:55,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.42ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 133.9MB in the beginning and 245.9MB in the end (delta: -111.9MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-01-11 06:04:55,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.68ms. Allocated memory is still 276.8MB. Free memory was 245.9MB in the beginning and 243.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 06:04:55,576 INFO L158 Benchmark]: Boogie Preprocessor took 23.22ms. Allocated memory is still 276.8MB. Free memory was 243.8MB in the beginning and 241.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 06:04:55,579 INFO L158 Benchmark]: RCFGBuilder took 507.73ms. Allocated memory is still 276.8MB. Free memory was 241.7MB in the beginning and 224.4MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-01-11 06:04:55,579 INFO L158 Benchmark]: IcfgTransformer took 102.60ms. Allocated memory is still 276.8MB. Free memory was 224.4MB in the beginning and 217.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-11 06:04:55,580 INFO L158 Benchmark]: TraceAbstraction took 24224.47ms. Allocated memory was 276.8MB in the beginning and 778.0MB in the end (delta: 501.2MB). Free memory was 217.0MB in the beginning and 330.4MB in the end (delta: -113.3MB). Peak memory consumption was 451.0MB. Max. memory is 8.0GB. [2022-01-11 06:04:55,584 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 314.42ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 133.9MB in the beginning and 245.9MB in the end (delta: -111.9MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.68ms. Allocated memory is still 276.8MB. Free memory was 245.9MB in the beginning and 243.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.22ms. Allocated memory is still 276.8MB. Free memory was 243.8MB in the beginning and 241.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 507.73ms. Allocated memory is still 276.8MB. Free memory was 241.7MB in the beginning and 224.4MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * IcfgTransformer took 102.60ms. Allocated memory is still 276.8MB. Free memory was 224.4MB in the beginning and 217.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 24224.47ms. Allocated memory was 276.8MB in the beginning and 778.0MB in the end (delta: 501.2MB). Free memory was 217.0MB in the beginning and 330.4MB in the end (delta: -113.3MB). Peak memory consumption was 451.0MB. Max. memory is 8.0GB. * 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]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 105 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3173 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3173 mSDsluCounter, 5831 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3114 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 254 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 2717 mSDtfsCounter, 254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2232occurred in iteration=9, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 2968 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 39 PreInvPairs, 617 NumberOfFragments, 11998 HoareAnnotationTreeSize, 39 FomulaSimplifications, 15719 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 39 FomulaSimplificationsInter, 63827 FormulaSimplificationTreeSizeReductionInter, 13.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1271 NumberOfCodeBlocks, 1271 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1303 ConstructedInterpolants, 0 QuantifiedInterpolants, 5137 SizeOfPredicates, 2 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 216/222 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 2 specifications checked. All of them hold - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || (((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvule32(\result, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) || (((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(1bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((p_num_write == 1bv32 && !(1bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || (((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || ((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || (((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((~bvule32(\result, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(1bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((p_num_write == 1bv32 && !(1bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && c_num_read == 0bv32) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((p_num_write == 1bv32 && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) RESULT: Ultimate proved your program to be correct! [2022-01-11 06:04:55,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...