/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_BITWISE.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 12:36:33,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 12:36:33,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 12:36:34,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 12:36:34,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 12:36:34,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 12:36:34,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 12:36:34,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 12:36:34,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 12:36:34,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 12:36:34,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 12:36:34,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 12:36:34,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 12:36:34,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 12:36:34,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 12:36:34,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 12:36:34,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 12:36:34,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 12:36:34,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 12:36:34,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 12:36:34,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 12:36:34,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 12:36:34,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 12:36:34,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 12:36:34,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 12:36:34,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 12:36:34,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 12:36:34,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 12:36:34,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 12:36:34,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 12:36:34,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 12:36:34,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 12:36:34,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 12:36:34,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 12:36:34,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 12:36:34,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 12:36:34,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 12:36:34,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 12:36:34,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 12:36:34,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 12:36:34,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 12:36:34,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 12:36:34,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 12:36:34,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 12:36:34,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 12:36:34,091 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 12:36:34,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 12:36:34,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 12:36:34,092 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 12:36:34,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 12:36:34,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 12:36:34,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 12:36:34,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 12:36:34,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 12:36:34,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 12:36:34,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 12:36:34,093 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 12:36:34,094 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 12:36:34,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 12:36:34,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 12:36:34,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 12:36:34,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 12:36:34,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 12:36:34,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:36:34,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 12:36:34,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 12:36:34,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 12:36:34,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 12:36:34,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 12:36:34,095 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 12:36:34,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 12:36:34,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 12:36:34,095 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 12:36:34,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 12:36:34,097 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 12:36:34,097 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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-10 12:36:34,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 12:36:34,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 12:36:34,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 12:36:34,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 12:36:34,326 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 12:36:34,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2022-01-10 12:36:34,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fd6818d/cbc065da512940b5b1dbcd839e86e43e/FLAG168054a60 [2022-01-10 12:36:34,748 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 12:36:34,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2022-01-10 12:36:34,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fd6818d/cbc065da512940b5b1dbcd839e86e43e/FLAG168054a60 [2022-01-10 12:36:34,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fd6818d/cbc065da512940b5b1dbcd839e86e43e [2022-01-10 12:36:34,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 12:36:34,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 12:36:34,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 12:36:34,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 12:36:34,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 12:36:34,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:34" (1/1) ... [2022-01-10 12:36:34,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6870234f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:34, skipping insertion in model container [2022-01-10 12:36:34,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:34" (1/1) ... [2022-01-10 12:36:34,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 12:36:34,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:36:34,994 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_1.cil-2.c[642,655] [2022-01-10 12:36:35,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:36:35,033 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 12:36:35,047 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_1.cil-2.c[642,655] [2022-01-10 12:36:35,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:36:35,092 INFO L208 MainTranslator]: Completed translation [2022-01-10 12:36:35,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35 WrapperNode [2022-01-10 12:36:35,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 12:36:35,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 12:36:35,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 12:36:35,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 12:36:35,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,135 INFO L137 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 255 [2022-01-10 12:36:35,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 12:36:35,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 12:36:35,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 12:36:35,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 12:36:35,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 12:36:35,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 12:36:35,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 12:36:35,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 12:36:35,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:36:35,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:36:35,185 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-10 12:36:35,192 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-10 12:36:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 12:36:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 12:36:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 12:36:35,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 12:36:35,284 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 12:36:35,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 12:36:35,503 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 12:36:35,509 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 12:36:35,509 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 12:36:35,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:36:35 BoogieIcfgContainer [2022-01-10 12:36:35,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 12:36:35,512 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 12:36:35,512 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 12:36:35,513 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 12:36:35,515 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:36:35" (1/1) ... [2022-01-10 12:36:35,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:36:35 BasicIcfg [2022-01-10 12:36:35,628 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 12:36:35,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 12:36:35,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 12:36:35,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 12:36:35,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:36:34" (1/4) ... [2022-01-10 12:36:35,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357bb57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:36:35, skipping insertion in model container [2022-01-10 12:36:35,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:35" (2/4) ... [2022-01-10 12:36:35,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357bb57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:36:35, skipping insertion in model container [2022-01-10 12:36:35,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:36:35" (3/4) ... [2022-01-10 12:36:35,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357bb57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:36:35, skipping insertion in model container [2022-01-10 12:36:35,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:36:35" (4/4) ... [2022-01-10 12:36:35,646 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.cTransformedIcfg [2022-01-10 12:36:35,650 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 12:36:35,650 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 12:36:35,682 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 12:36:35,687 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-10 12:36:35,688 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 12:36:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 80 states have internal predecessors, (121), 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-10 12:36:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 12:36:35,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:35,705 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] [2022-01-10 12:36:35,706 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:35,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash -685744817, now seen corresponding path program 1 times [2022-01-10 12:36:35,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:35,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85253061] [2022-01-10 12:36:35,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:35,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:35,897 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-10 12:36:35,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:35,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85253061] [2022-01-10 12:36:35,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85253061] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:35,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:35,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:36:35,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437408911] [2022-01-10 12:36:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:35,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:36:35,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:35,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:36:35,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:36:35,931 INFO L87 Difference]: Start difference. First operand has 81 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 80 states have internal predecessors, (121), 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 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10 12:36:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:36,035 INFO L93 Difference]: Finished difference Result 223 states and 335 transitions. [2022-01-10 12:36:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:36:36,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2022-01-10 12:36:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:36,049 INFO L225 Difference]: With dead ends: 223 [2022-01-10 12:36:36,049 INFO L226 Difference]: Without dead ends: 140 [2022-01-10 12:36:36,052 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-10 12:36:36,057 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 80 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:36,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 212 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-01-10 12:36:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 119. [2022-01-10 12:36:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.4102564102564104) internal successors, (165), 118 states have internal predecessors, (165), 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-10 12:36:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2022-01-10 12:36:36,094 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 35 [2022-01-10 12:36:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:36,095 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2022-01-10 12:36:36,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10 12:36:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2022-01-10 12:36:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 12:36:36,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:36,098 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] [2022-01-10 12:36:36,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 12:36:36,099 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash 153878748, now seen corresponding path program 1 times [2022-01-10 12:36:36,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:36,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649078714] [2022-01-10 12:36:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:36,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:36,236 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-10 12:36:36,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:36,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649078714] [2022-01-10 12:36:36,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649078714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:36,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:36,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:36:36,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784425550] [2022-01-10 12:36:36,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:36,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:36:36,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:36,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:36:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:36:36,240 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10 12:36:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:36,289 INFO L93 Difference]: Finished difference Result 288 states and 400 transitions. [2022-01-10 12:36:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:36:36,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-01-10 12:36:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:36,293 INFO L225 Difference]: With dead ends: 288 [2022-01-10 12:36:36,293 INFO L226 Difference]: Without dead ends: 177 [2022-01-10 12:36:36,294 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-10 12:36:36,295 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 60 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:36,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-10 12:36:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2022-01-10 12:36:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.4) internal successors, (238), 171 states have internal predecessors, (238), 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-10 12:36:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 238 transitions. [2022-01-10 12:36:36,316 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 238 transitions. Word has length 36 [2022-01-10 12:36:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:36,317 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 238 transitions. [2022-01-10 12:36:36,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10 12:36:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 238 transitions. [2022-01-10 12:36:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 12:36:36,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:36,318 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] [2022-01-10 12:36:36,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 12:36:36,319 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash -418085, now seen corresponding path program 1 times [2022-01-10 12:36:36,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:36,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442202429] [2022-01-10 12:36:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:36,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:36,428 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-10 12:36:36,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:36,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442202429] [2022-01-10 12:36:36,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442202429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:36,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:36,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:36:36,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707737277] [2022-01-10 12:36:36,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:36,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:36:36,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:36:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:36:36,433 INFO L87 Difference]: Start difference. First operand 172 states and 238 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10 12:36:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:36,483 INFO L93 Difference]: Finished difference Result 489 states and 674 transitions. [2022-01-10 12:36:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:36:36,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-01-10 12:36:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:36,486 INFO L225 Difference]: With dead ends: 489 [2022-01-10 12:36:36,486 INFO L226 Difference]: Without dead ends: 325 [2022-01-10 12:36:36,487 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-10 12:36:36,488 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:36,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 214 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-10 12:36:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 303. [2022-01-10 12:36:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 301 states have (on average 1.3754152823920265) internal successors, (414), 302 states have internal predecessors, (414), 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-10 12:36:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 414 transitions. [2022-01-10 12:36:36,515 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 414 transitions. Word has length 36 [2022-01-10 12:36:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:36,515 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 414 transitions. [2022-01-10 12:36:36,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10 12:36:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 414 transitions. [2022-01-10 12:36:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-10 12:36:36,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:36,518 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] [2022-01-10 12:36:36,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 12:36:36,518 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:36,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash -255349929, now seen corresponding path program 1 times [2022-01-10 12:36:36,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:36,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346931288] [2022-01-10 12:36:36,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:36,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:36,570 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-10 12:36:36,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:36,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346931288] [2022-01-10 12:36:36,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346931288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:36,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:36,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:36:36,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551725998] [2022-01-10 12:36:36,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:36,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:36:36,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:36,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:36:36,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:36:36,573 INFO L87 Difference]: Start difference. First operand 303 states and 414 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-10 12:36:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:36,614 INFO L93 Difference]: Finished difference Result 754 states and 1021 transitions. [2022-01-10 12:36:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:36:36,615 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-10 12:36:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:36,617 INFO L225 Difference]: With dead ends: 754 [2022-01-10 12:36:36,617 INFO L226 Difference]: Without dead ends: 459 [2022-01-10 12:36:36,620 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-10 12:36:36,630 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:36,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-01-10 12:36:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2022-01-10 12:36:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 457 states have (on average 1.3172866520787747) internal successors, (602), 458 states have internal predecessors, (602), 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-10 12:36:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 602 transitions. [2022-01-10 12:36:36,701 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 602 transitions. Word has length 50 [2022-01-10 12:36:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:36,702 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 602 transitions. [2022-01-10 12:36:36,702 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-10 12:36:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 602 transitions. [2022-01-10 12:36:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-10 12:36:36,704 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:36,705 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, 1, 1, 1, 1] [2022-01-10 12:36:36,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 12:36:36,705 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:36,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1157188318, now seen corresponding path program 1 times [2022-01-10 12:36:36,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:36,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683814874] [2022-01-10 12:36:36,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:36,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:36,790 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-10 12:36:36,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:36,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683814874] [2022-01-10 12:36:36,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683814874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:36,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:36,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:36:36,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333595354] [2022-01-10 12:36:36,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:36,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:36:36,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:36:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:36:36,794 INFO L87 Difference]: Start difference. First operand 459 states and 602 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10 12:36:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:36,829 INFO L93 Difference]: Finished difference Result 932 states and 1218 transitions. [2022-01-10 12:36:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:36:36,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2022-01-10 12:36:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:36,833 INFO L225 Difference]: With dead ends: 932 [2022-01-10 12:36:36,833 INFO L226 Difference]: Without dead ends: 567 [2022-01-10 12:36:36,834 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-10 12:36:36,841 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 191 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-10 12:36:36,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 191 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-01-10 12:36:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2022-01-10 12:36:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 565 states have (on average 1.2920353982300885) internal successors, (730), 566 states have internal predecessors, (730), 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-10 12:36:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 730 transitions. [2022-01-10 12:36:36,868 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 730 transitions. Word has length 54 [2022-01-10 12:36:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:36,869 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 730 transitions. [2022-01-10 12:36:36,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10 12:36:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 730 transitions. [2022-01-10 12:36:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 12:36:36,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:36,885 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, 1, 1, 1] [2022-01-10 12:36:36,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 12:36:36,885 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash 308763675, now seen corresponding path program 1 times [2022-01-10 12:36:36,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:36,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881629088] [2022-01-10 12:36:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:36,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:37,009 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-10 12:36:37,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:37,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881629088] [2022-01-10 12:36:37,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881629088] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:37,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:37,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:36:37,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594264633] [2022-01-10 12:36:37,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:37,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:36:37,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:37,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:36:37,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:36:37,012 INFO L87 Difference]: Start difference. First operand 567 states and 730 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-10 12:36:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:37,133 INFO L93 Difference]: Finished difference Result 1650 states and 2134 transitions. [2022-01-10 12:36:37,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:36:37,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-10 12:36:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:37,138 INFO L225 Difference]: With dead ends: 1650 [2022-01-10 12:36:37,138 INFO L226 Difference]: Without dead ends: 1227 [2022-01-10 12:36:37,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10 12:36:37,142 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 302 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:37,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 565 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-01-10 12:36:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 591. [2022-01-10 12:36:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 589 states have (on average 1.2733446519524618) internal successors, (750), 590 states have internal predecessors, (750), 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-10 12:36:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2022-01-10 12:36:37,188 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 55 [2022-01-10 12:36:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:37,189 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2022-01-10 12:36:37,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-10 12:36:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2022-01-10 12:36:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 12:36:37,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:37,190 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, 1, 1, 1] [2022-01-10 12:36:37,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 12:36:37,191 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash 659563612, now seen corresponding path program 1 times [2022-01-10 12:36:37,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:37,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914934026] [2022-01-10 12:36:37,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:37,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:37,260 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-10 12:36:37,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:37,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914934026] [2022-01-10 12:36:37,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914934026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:37,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:37,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:36:37,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128515407] [2022-01-10 12:36:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:37,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:36:37,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:37,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:36:37,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:36:37,264 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-10 12:36:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:37,380 INFO L93 Difference]: Finished difference Result 1380 states and 1760 transitions. [2022-01-10 12:36:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:36:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-10 12:36:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:37,385 INFO L225 Difference]: With dead ends: 1380 [2022-01-10 12:36:37,385 INFO L226 Difference]: Without dead ends: 882 [2022-01-10 12:36:37,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10 12:36:37,387 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 276 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:37,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 568 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-01-10 12:36:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 489. [2022-01-10 12:36:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 487 states have (on average 1.271047227926078) internal successors, (619), 488 states have internal predecessors, (619), 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-10 12:36:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 619 transitions. [2022-01-10 12:36:37,426 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 619 transitions. Word has length 55 [2022-01-10 12:36:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:37,427 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 619 transitions. [2022-01-10 12:36:37,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-10 12:36:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 619 transitions. [2022-01-10 12:36:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 12:36:37,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:37,429 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, 1, 1, 1] [2022-01-10 12:36:37,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 12:36:37,429 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:37,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:37,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1417615940, now seen corresponding path program 1 times [2022-01-10 12:36:37,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:37,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47440405] [2022-01-10 12:36:37,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:37,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:37,514 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-10 12:36:37,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:37,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47440405] [2022-01-10 12:36:37,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47440405] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:37,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:37,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:36:37,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298162935] [2022-01-10 12:36:37,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:37,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:36:37,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:37,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:36:37,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:36:37,547 INFO L87 Difference]: Start difference. First operand 489 states and 619 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-10 12:36:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:37,652 INFO L93 Difference]: Finished difference Result 1143 states and 1455 transitions. [2022-01-10 12:36:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:36:37,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-10 12:36:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:37,657 INFO L225 Difference]: With dead ends: 1143 [2022-01-10 12:36:37,657 INFO L226 Difference]: Without dead ends: 754 [2022-01-10 12:36:37,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10 12:36:37,658 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 243 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:37,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 447 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-01-10 12:36:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 483. [2022-01-10 12:36:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 481 states have (on average 1.2598752598752598) internal successors, (606), 482 states have internal predecessors, (606), 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-10 12:36:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 606 transitions. [2022-01-10 12:36:37,705 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 606 transitions. Word has length 55 [2022-01-10 12:36:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:37,706 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 606 transitions. [2022-01-10 12:36:37,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-10 12:36:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 606 transitions. [2022-01-10 12:36:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 12:36:37,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:37,708 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, 1, 1, 1] [2022-01-10 12:36:37,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 12:36:37,708 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1221102435, now seen corresponding path program 1 times [2022-01-10 12:36:37,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:37,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438678464] [2022-01-10 12:36:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:37,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:37,798 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-10 12:36:37,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:37,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438678464] [2022-01-10 12:36:37,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438678464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:37,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:37,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:36:37,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275350146] [2022-01-10 12:36:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:37,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:36:37,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:37,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:36:37,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:36:37,801 INFO L87 Difference]: Start difference. First operand 483 states and 606 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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-10 12:36:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:37,882 INFO L93 Difference]: Finished difference Result 533 states and 666 transitions. [2022-01-10 12:36:37,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:36:37,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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-10 12:36:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:37,886 INFO L225 Difference]: With dead ends: 533 [2022-01-10 12:36:37,886 INFO L226 Difference]: Without dead ends: 531 [2022-01-10 12:36:37,886 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-10 12:36:37,888 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 174 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:37,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 172 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-01-10 12:36:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 481. [2022-01-10 12:36:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.25625) internal successors, (603), 480 states have internal predecessors, (603), 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-10 12:36:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 603 transitions. [2022-01-10 12:36:37,940 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 603 transitions. Word has length 55 [2022-01-10 12:36:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:37,941 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 603 transitions. [2022-01-10 12:36:37,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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-10 12:36:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 603 transitions. [2022-01-10 12:36:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 12:36:37,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:37,942 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, 1, 1, 1, 1] [2022-01-10 12:36:37,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 12:36:37,943 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:37,943 INFO L85 PathProgramCache]: Analyzing trace with hash 800529613, now seen corresponding path program 1 times [2022-01-10 12:36:37,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:37,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993263818] [2022-01-10 12:36:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:37,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:38,212 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-10 12:36:38,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:38,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993263818] [2022-01-10 12:36:38,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993263818] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:36:38,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898296846] [2022-01-10 12:36:38,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:38,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:36:38,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:36:38,215 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-10 12:36:38,226 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-10 12:36:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:38,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 12:36:38,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:36:38,688 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-10 12:36:38,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:36:38,999 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-10 12:36:39,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898296846] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:36:39,000 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:36:39,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 12:36:39,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201763887] [2022-01-10 12:36:39,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:36:39,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 12:36:39,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 12:36:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 12:36:39,001 INFO L87 Difference]: Start difference. First operand 481 states and 603 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-10 12:36:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:39,250 INFO L93 Difference]: Finished difference Result 1355 states and 1709 transitions. [2022-01-10 12:36:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 12:36:39,251 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 56 [2022-01-10 12:36:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:39,255 INFO L225 Difference]: With dead ends: 1355 [2022-01-10 12:36:39,256 INFO L226 Difference]: Without dead ends: 1353 [2022-01-10 12:36:39,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 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-10 12:36:39,257 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 499 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:39,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 796 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-01-10 12:36:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 747. [2022-01-10 12:36:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 1.2667560321715818) internal successors, (945), 746 states have internal predecessors, (945), 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-10 12:36:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 945 transitions. [2022-01-10 12:36:39,366 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 945 transitions. Word has length 56 [2022-01-10 12:36:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:39,367 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 945 transitions. [2022-01-10 12:36:39,367 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-10 12:36:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 945 transitions. [2022-01-10 12:36:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 12:36:39,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:39,368 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:36:39,395 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-10 12:36:39,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 12:36:39,591 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2071545257, now seen corresponding path program 2 times [2022-01-10 12:36:39,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413407068] [2022-01-10 12:36:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:39,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:36:39,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:39,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413407068] [2022-01-10 12:36:39,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413407068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:39,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:39,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:36:39,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837826430] [2022-01-10 12:36:39,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:39,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:36:39,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:39,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:36:39,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:36:39,630 INFO L87 Difference]: Start difference. First operand 747 states and 945 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-10 12:36:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:39,727 INFO L93 Difference]: Finished difference Result 1242 states and 1581 transitions. [2022-01-10 12:36:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:36:39,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2022-01-10 12:36:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:39,734 INFO L225 Difference]: With dead ends: 1242 [2022-01-10 12:36:39,735 INFO L226 Difference]: Without dead ends: 658 [2022-01-10 12:36:39,735 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-10 12:36:39,736 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 53 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:39,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 206 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-01-10 12:36:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 632. [2022-01-10 12:36:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.2567353407290016) internal successors, (793), 631 states have internal predecessors, (793), 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-10 12:36:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 793 transitions. [2022-01-10 12:36:39,852 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 793 transitions. Word has length 71 [2022-01-10 12:36:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:39,853 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 793 transitions. [2022-01-10 12:36:39,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-10 12:36:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 793 transitions. [2022-01-10 12:36:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 12:36:39,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:39,858 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:36:39,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 12:36:39,859 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:39,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2081409404, now seen corresponding path program 1 times [2022-01-10 12:36:39,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:39,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172164640] [2022-01-10 12:36:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:39,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 12:36:39,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:39,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172164640] [2022-01-10 12:36:39,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172164640] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:39,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:39,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:36:39,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041232439] [2022-01-10 12:36:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:39,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:36:39,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:39,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:36:39,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:36:39,908 INFO L87 Difference]: Start difference. First operand 632 states and 793 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-10 12:36:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:40,026 INFO L93 Difference]: Finished difference Result 1274 states and 1596 transitions. [2022-01-10 12:36:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:36:40,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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 83 [2022-01-10 12:36:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:40,030 INFO L225 Difference]: With dead ends: 1274 [2022-01-10 12:36:40,030 INFO L226 Difference]: Without dead ends: 650 [2022-01-10 12:36:40,031 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-10 12:36:40,032 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:40,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:40,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-01-10 12:36:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 632. [2022-01-10 12:36:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.2250396196513471) internal successors, (773), 631 states have internal predecessors, (773), 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-10 12:36:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 773 transitions. [2022-01-10 12:36:40,123 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 773 transitions. Word has length 83 [2022-01-10 12:36:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:40,123 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 773 transitions. [2022-01-10 12:36:40,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-10 12:36:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 773 transitions. [2022-01-10 12:36:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 12:36:40,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:40,125 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:36:40,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 12:36:40,125 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:36:40,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1117318961, now seen corresponding path program 1 times [2022-01-10 12:36:40,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:40,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43176755] [2022-01-10 12:36:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:40,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:36:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 12:36:40,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:36:40,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43176755] [2022-01-10 12:36:40,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43176755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:36:40,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:36:40,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:36:40,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127820674] [2022-01-10 12:36:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:36:40,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:36:40,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:40,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:36:40,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:36:40,169 INFO L87 Difference]: Start difference. First operand 632 states and 773 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-10 12:36:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:40,237 INFO L93 Difference]: Finished difference Result 896 states and 1088 transitions. [2022-01-10 12:36:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:36:40,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 84 [2022-01-10 12:36:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:40,238 INFO L225 Difference]: With dead ends: 896 [2022-01-10 12:36:40,238 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 12:36:40,239 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-10 12:36:40,240 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 56 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:40,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 204 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:36:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 12:36:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 12:36:40,241 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-10 12:36:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 12:36:40,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2022-01-10 12:36:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:40,241 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 12:36:40,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-10 12:36:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 12:36:40,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 12:36:40,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 12:36:40,244 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 12:36:40,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 12:36:40,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 12:36:47,378 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 12:36:47,379 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 12:36:47,379 INFO L854 garLoopResultBuilder]: At program point L356(lines 342 358) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (< ~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) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 12:36:47,379 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 210) no Hoare annotation was computed. [2022-01-10 12:36:47,379 INFO L858 garLoopResultBuilder]: For program point L206-2(lines 205 218) no Hoare annotation was computed. [2022-01-10 12:36:47,379 INFO L854 garLoopResultBuilder]: At program point L211-1(lines 202 219) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse4 (= ~c_dr_st~0Int 0)) (.cse5 (= ~c_num_read~0Int 0)) (.cse6 (= ~p_num_write~0Int 0)) (.cse1 (= ~p_dw_pc~0Int 0)) (.cse7 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse2 (= ~q_free~0Int 1)) (.cse8 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse9 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 (<= 2 ~c_dr_st~0Int)) (and .cse0 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse1 .cse7 .cse2 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse1 .cse7 (<= 2 ~p_dw_st~0Int) .cse2 .cse8 .cse9))) [2022-01-10 12:36:47,380 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 323 335) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-10 12:36:47,380 INFO L861 garLoopResultBuilder]: At program point L336(lines 313 341) the Hoare annotation is: true [2022-01-10 12:36:47,380 INFO L858 garLoopResultBuilder]: For program point L324(line 324) no Hoare annotation was computed. [2022-01-10 12:36:47,380 INFO L861 garLoopResultBuilder]: At program point L368(lines 359 370) the Hoare annotation is: true [2022-01-10 12:36:47,380 INFO L854 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-10 12:36:47,380 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 12:36:47,380 INFO L854 garLoopResultBuilder]: At program point L288(lines 240 293) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-10 12:36:47,380 INFO L858 garLoopResultBuilder]: For program point L248(line 248) no Hoare annotation was computed. [2022-01-10 12:36:47,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 12:36:47,381 INFO L858 garLoopResultBuilder]: For program point L224-1(lines 224 234) no Hoare annotation was computed. [2022-01-10 12:36:47,381 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 234) no Hoare annotation was computed. [2022-01-10 12:36:47,381 INFO L854 garLoopResultBuilder]: At program point L236-1(lines 223 238) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-10 12:36:47,381 INFO L858 garLoopResultBuilder]: For program point L228-1(lines 228 233) no Hoare annotation was computed. [2022-01-10 12:36:47,381 INFO L854 garLoopResultBuilder]: At program point L236(lines 223 238) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-10 12:36:47,381 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2022-01-10 12:36:47,381 INFO L854 garLoopResultBuilder]: At program point L237-1(lines 220 239) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-10 12:36:47,382 INFO L854 garLoopResultBuilder]: At program point L237(lines 220 239) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-10 12:36:47,382 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 307) no Hoare annotation was computed. [2022-01-10 12:36:47,382 INFO L858 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2022-01-10 12:36:47,382 INFO L854 garLoopResultBuilder]: At program point L309(lines 298 311) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-10 12:36:47,382 INFO L858 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2022-01-10 12:36:47,383 INFO L854 garLoopResultBuilder]: At program point L310(lines 294 312) the Hoare annotation is: (let ((.cse19 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse19)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse8 (= 0 ~c_dr_pc~0Int)) (.cse10 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse11 (= ~c_dr_st~0Int 0)) (.cse12 (= ~c_num_read~0Int 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse4 (= ~q_free~0Int 1)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= ~q_free~0Int 0)) (.cse15 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse5 (<= 2 ~c_dr_st~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse4 .cse5) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse13 .cse9 .cse3 .cse4 .cse14 .cse6) (and .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse15 .cse16 .cse5) (let ((.cse18 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse17 .cse11 .cse3 .cse7 (< .cse18 .cse19) .cse6 (<= ~p_num_write~0Int .cse18))) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse9 .cse3 .cse7 .cse4 .cse14 .cse6) (and .cse17 .cse15 .cse3 .cse16 .cse7 .cse5 .cse6)))) [2022-01-10 12:36:47,383 INFO L858 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2022-01-10 12:36:47,383 INFO L858 garLoopResultBuilder]: For program point L257(lines 247 287) no Hoare annotation was computed. [2022-01-10 12:36:47,383 INFO L858 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-01-10 12:36:47,383 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2022-01-10 12:36:47,383 INFO L858 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2022-01-10 12:36:47,383 INFO L854 garLoopResultBuilder]: At program point L117-1(lines 105 142) the Hoare annotation is: (let ((.cse0 (= ~q_free~0Int 0)) (.cse10 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse4 (+ ~p_num_write~0Int 1)) (.cse9 (<= 2 ~c_dr_st~0Int)) (.cse6 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~c_dr_st~0Int 0)) (.cse7 (= ~p_dw_pc~0Int 0)) (.cse2 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse3 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 .cse2 (< .cse3 .cse4) .cse5 (<= ~p_num_write~0Int .cse3))) (and .cse6 .cse7 .cse8 .cse9) (and .cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse10 .cse11 .cse9) (and .cse0 .cse10 .cse2 .cse11 .cse9 .cse5) (and (< ~c_num_read~0Int .cse4) (<= ~p_num_write~0Int ~c_num_read~0Int) .cse2 .cse8 .cse9 .cse5) (and .cse6 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) .cse1 (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) .cse7 .cse2 .cse8 (<= ~p_last_write~0Int ~c_last_read~0Int) .cse5))) [2022-01-10 12:36:47,383 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2022-01-10 12:36:47,384 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2022-01-10 12:36:47,384 INFO L854 garLoopResultBuilder]: At program point L138(lines 101 143) the Hoare annotation is: (let ((.cse3 (= ~q_free~0Int 0)) (.cse0 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse5 (<= 2 ~p_dw_st~0Int)) (.cse2 (<= 2 ~c_dr_st~0Int)) (.cse7 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (= 0 ~c_dr_pc~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse0 .cse1 .cse2) (let ((.cse6 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse3 (= ~c_dr_st~0Int 0) .cse4 .cse5 (< .cse6 (+ ~p_num_write~0Int 1)) .cse7 (<= ~p_num_write~0Int .cse6))) (and .cse3 .cse0 .cse4 .cse1 .cse5 .cse2 .cse7))) [2022-01-10 12:36:47,384 INFO L858 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2022-01-10 12:36:47,384 INFO L854 garLoopResultBuilder]: At program point L119(lines 105 142) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0Int)) (.cse3 (= 0 ~c_dr_pc~0Int)) (.cse4 (= ~p_dw_pc~0Int 0)) (.cse0 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse2 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (< ~c_num_read~0Int (+ ~p_num_write~0Int 1)) (<= ~p_num_write~0Int ~c_num_read~0Int) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0) .cse1) (and .cse3 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) .cse4 .cse0 .cse2))) [2022-01-10 12:36:47,385 INFO L854 garLoopResultBuilder]: At program point L182-1(lines 148 200) the Hoare annotation is: (let ((.cse3 (+ ~p_num_write~0Int 1))) (let ((.cse5 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse8 (< ~c_num_read~0Int .cse3)) (.cse9 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse0 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse1 (<= 2 ~p_dw_st~0Int)) (.cse6 (= ~q_free~0Int 1)) (.cse7 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse4 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse2 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) .cse0 .cse1 (< .cse2 .cse3) .cse4 (<= ~p_num_write~0Int .cse2))) (and .cse5 (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) .cse0 .cse1 .cse6 .cse7 .cse4) (and .cse5 (= 0 ~p_dw_st~0Int) .cse8 .cse9 .cse0 .cse6 .cse7 .cse4) (and .cse5 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse9 .cse0 .cse1 .cse6 .cse7 .cse4)))) [2022-01-10 12:36:47,385 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2022-01-10 12:36:47,385 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2022-01-10 12:36:47,385 INFO L854 garLoopResultBuilder]: At program point L196(lines 145 201) 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 (= 0 ~p_dw_st~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= 2 ~p_dw_st~0Int) .cse3 .cse4 .cse5))) [2022-01-10 12:36:47,385 INFO L858 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2022-01-10 12:36:47,385 INFO L854 garLoopResultBuilder]: At program point L153(lines 148 200) the Hoare annotation is: (let ((.cse0 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= 2 ~p_dw_st~0Int) (< .cse0 (+ ~p_num_write~0Int 1)) (<= ~p_last_write~0Int ~q_buf_0~0Int) (<= ~p_num_write~0Int .cse0))) [2022-01-10 12:36:47,385 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2022-01-10 12:36:47,385 INFO L858 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2022-01-10 12:36:47,385 INFO L858 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2022-01-10 12:36:47,385 INFO L854 garLoopResultBuilder]: At program point L53(lines 41 55) the Hoare annotation is: (let ((.cse9 (mod (+ ~c_num_read~0Int 1) 4294967296))) (let ((.cse0 (= ~q_free~0Int 0)) (.cse2 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse3 (< .cse9 (+ ~p_num_write~0Int 1))) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse6 (<= ~p_num_write~0Int .cse9)) (.cse7 (= 0 ~c_dr_pc~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse8 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~c_dr_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 1) .cse8 .cse2 .cse5) (and .cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse4) (and .cse0 .cse2 (= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 1) .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse4)))) [2022-01-10 12:36:47,385 INFO L858 garLoopResultBuilder]: For program point L42-3(lines 42 51) no Hoare annotation was computed. [2022-01-10 12:36:47,386 INFO L854 garLoopResultBuilder]: At program point L54(lines 38 56) the Hoare annotation is: (let ((.cse10 (mod (+ ~c_num_read~0Int 1) 4294967296))) (let ((.cse2 (< .cse10 (+ ~p_num_write~0Int 1))) (.cse5 (<= ~p_num_write~0Int .cse10)) (.cse3 (<= 2 ~c_dr_st~0Int)) (.cse6 (= 0 ~c_dr_pc~0Int)) (.cse0 (= ~q_free~0Int 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse9 (= ~p_dw_pc~0Int 0)) (.cse1 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 1) .cse2 (<= 1 |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int|) .cse3 .cse4 .cse5) (and .cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3) (and .cse0 .cse7 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse3) (and .cse6 .cse0 .cse7 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) .cse8 (= ~p_num_write~0Int 1) .cse9 .cse1 .cse4)))) [2022-01-10 12:36:47,386 INFO L858 garLoopResultBuilder]: For program point L43-1(lines 43 48) no Hoare annotation was computed. [2022-01-10 12:36:47,386 INFO L858 garLoopResultBuilder]: For program point L42-5(lines 42 51) no Hoare annotation was computed. [2022-01-10 12:36:47,386 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2022-01-10 12:36:47,386 INFO L854 garLoopResultBuilder]: At program point L53-1(lines 41 55) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (<= 2 ~p_dw_st~0Int)) (.cse5 (= ~q_free~0Int 1)) (.cse6 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse7 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 1) .cse5 .cse6 .cse7))) [2022-01-10 12:36:47,386 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 88) no Hoare annotation was computed. [2022-01-10 12:36:47,386 INFO L854 garLoopResultBuilder]: At program point L54-1(lines 38 56) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (<= 2 ~p_dw_st~0Int)) (.cse5 (= ~q_free~0Int 1)) (.cse6 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse7 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 1) .cse5 (<= 1 |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int|) .cse6 .cse7))) [2022-01-10 12:36:47,386 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2022-01-10 12:36:47,386 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2022-01-10 12:36:47,386 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2022-01-10 12:36:47,386 INFO L858 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2022-01-10 12:36:47,386 INFO L858 garLoopResultBuilder]: For program point L84-5(lines 84 88) no Hoare annotation was computed. [2022-01-10 12:36:47,387 INFO L854 garLoopResultBuilder]: At program point L72(lines 60 74) the Hoare annotation is: (let ((.cse2 (<= 2 ~c_dr_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (= ~q_free~0Int 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse2 .cse5) (let ((.cse6 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse3 .cse4 (< .cse6 (+ ~p_num_write~0Int 1)) .cse2 .cse5 (<= ~p_num_write~0Int .cse6))) (and .cse0 .cse3 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) (= ~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) (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) (= ~p_dw_pc~0Int 0) .cse4 .cse5))) [2022-01-10 12:36:47,387 INFO L858 garLoopResultBuilder]: For program point L61-3(lines 61 70) no Hoare annotation was computed. [2022-01-10 12:36:47,387 INFO L854 garLoopResultBuilder]: At program point L73(lines 57 75) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.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)) (.cse1 (= ~q_free~0Int 0)) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse6 (<= 2 ~c_dr_st~0Int)) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 (<= |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) (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) (= ~p_dw_pc~0Int 0) .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse2 .cse3 .cse6) (let ((.cse7 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse1 .cse4 (< .cse7 (+ ~p_num_write~0Int 1)) .cse6 .cse5 (<= ~p_num_write~0Int .cse7))))) [2022-01-10 12:36:47,387 INFO L858 garLoopResultBuilder]: For program point L62-1(lines 62 67) no Hoare annotation was computed. [2022-01-10 12:36:47,387 INFO L858 garLoopResultBuilder]: For program point L61-5(lines 61 70) no Hoare annotation was computed. [2022-01-10 12:36:47,387 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2022-01-10 12:36:47,387 INFO L854 garLoopResultBuilder]: At program point L72-1(lines 60 74) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (= ~q_free~0Int 1)) (.cse5 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse2 .cse3 (<= 2 ~p_dw_st~0Int) .cse4 .cse5 .cse6))) [2022-01-10 12:36:47,387 INFO L854 garLoopResultBuilder]: At program point L92-2(lines 76 100) the Hoare annotation is: (let ((.cse0 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse1 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse6 (<= 2 ~c_dr_st~0Int)) (.cse3 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse2 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 (= ~c_dr_st~0Int 0) .cse1 (< .cse2 (+ ~p_num_write~0Int 1)) .cse3 (<= ~p_num_write~0Int .cse2))) (and (= 0 ~c_dr_pc~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse6 .cse3))) [2022-01-10 12:36:47,387 INFO L854 garLoopResultBuilder]: At program point L73-1(lines 57 75) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (= ~q_free~0Int 1)) (.cse5 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse2 .cse3 (<= 2 ~p_dw_st~0Int) .cse4 .cse5 .cse6))) [2022-01-10 12:36:47,387 INFO L858 garLoopResultBuilder]: For program point L92-3(lines 92 96) no Hoare annotation was computed. [2022-01-10 12:36:47,388 INFO L854 garLoopResultBuilder]: At program point L92-5(lines 76 100) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (= ~q_free~0Int 1)) (.cse5 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse6 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse2 .cse3 (<= 2 ~p_dw_st~0Int) .cse4 .cse5 .cse6))) [2022-01-10 12:36:47,388 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2022-01-10 12:36:47,388 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2022-01-10 12:36:47,388 INFO L858 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-01-10 12:36:47,388 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-01-10 12:36:47,388 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-10 12:36:47,388 INFO L854 garLoopResultBuilder]: At program point L20-1(lines 15 22) the Hoare annotation is: false [2022-01-10 12:36:47,388 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-10 12:36:47,388 INFO L854 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2022-01-10 12:36:47,391 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:36:47,392 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 12:36:47,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:36:47 BasicIcfg [2022-01-10 12:36:47,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 12:36:47,511 INFO L158 Benchmark]: Toolchain (without parser) took 12740.84ms. Allocated memory was 185.6MB in the beginning and 412.1MB in the end (delta: 226.5MB). Free memory was 130.1MB in the beginning and 379.9MB in the end (delta: -249.8MB). Peak memory consumption was 216.7MB. Max. memory is 8.0GB. [2022-01-10 12:36:47,512 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 12:36:47,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.45ms. Allocated memory is still 185.6MB. Free memory was 129.9MB in the beginning and 154.8MB in the end (delta: -24.9MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-01-10 12:36:47,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.55ms. Allocated memory is still 185.6MB. Free memory was 154.8MB in the beginning and 152.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 12:36:47,513 INFO L158 Benchmark]: Boogie Preprocessor took 20.09ms. Allocated memory is still 185.6MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 12:36:47,513 INFO L158 Benchmark]: RCFGBuilder took 354.57ms. Allocated memory is still 185.6MB. Free memory was 151.1MB in the beginning and 136.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 12:36:47,513 INFO L158 Benchmark]: IcfgTransformer took 116.64ms. Allocated memory is still 185.6MB. Free memory was 136.4MB in the beginning and 130.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 12:36:47,514 INFO L158 Benchmark]: TraceAbstraction took 11881.05ms. Allocated memory was 185.6MB in the beginning and 412.1MB in the end (delta: 226.5MB). Free memory was 129.6MB in the beginning and 379.9MB in the end (delta: -250.3MB). Peak memory consumption was 214.7MB. Max. memory is 8.0GB. [2022-01-10 12:36:47,519 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.13ms. Allocated memory is still 185.6MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 321.45ms. Allocated memory is still 185.6MB. Free memory was 129.9MB in the beginning and 154.8MB in the end (delta: -24.9MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.55ms. Allocated memory is still 185.6MB. Free memory was 154.8MB in the beginning and 152.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.09ms. Allocated memory is still 185.6MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 354.57ms. Allocated memory is still 185.6MB. Free memory was 151.1MB in the beginning and 136.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 116.64ms. Allocated memory is still 185.6MB. Free memory was 136.4MB in the beginning and 130.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 11881.05ms. Allocated memory was 185.6MB in the beginning and 412.1MB in the end (delta: 226.5MB). Free memory was 129.6MB in the beginning and 379.9MB in the end (delta: -250.3MB). Peak memory consumption was 214.7MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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, 81 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1953 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1953 mSDsluCounter, 4183 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2438 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 202 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1745 mSDtfsCounter, 202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=747occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 2048 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 31 PreInvPairs, 232 NumberOfFragments, 3382 HoareAnnotationTreeSize, 31 FomulaSimplifications, 10798 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 31 FomulaSimplificationsInter, 54620 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 822 ConstructedInterpolants, 0 QuantifiedInterpolants, 3603 SizeOfPredicates, 2 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 97/103 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: 220]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((~bvule32(2bv32, c_dr_st) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && p_dw_pc == 0bv32) || (((((((((p_num_write == 1bv32 && c_num_read == 0bv32) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 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])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(1bv32, \result)) && ~bvule32(q_buf_0, p_last_write)) && __retres1 == 1bv32)) || (((((((~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])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((((((((~bvule32(tmp, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 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) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: 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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((~bvule32(tmp, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 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) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((~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)) && ~bvule32(q_buf_0, p_last_write)) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || ((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 342]: 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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 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)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 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)) && ~bvule32(1bv32, \result)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && __retres1 == 1bv32) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((~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)) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && __retres1 == 1bv32) || ((((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 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)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((((((((~bvule32(tmp, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 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) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((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(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((~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)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((~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)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 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])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~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)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((p_num_write == 1bv32 && ~bvule32(tmp, 0bv32)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 1bv32 && ~bvule32(tmp, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((~bvule32(2bv32, c_dr_st) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32)) || ((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((~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])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(tmp, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((~bvule32(p_num_write, c_num_read) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 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) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((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(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((~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])) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((~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])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32)) || ((((((((p_num_write == 1bv32 && c_num_read == 0bv32) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((~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])) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(q_buf_0, p_last_write)) && __retres1 == 1bv32)) || (((~bvule32(2bv32, c_dr_st) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && p_dw_pc == 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 12:36:47,580 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...