/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 06:21:26,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 06:21:26,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 06:21:26,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 06:21:26,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 06:21:26,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 06:21:26,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 06:21:26,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 06:21:26,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 06:21:26,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 06:21:26,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 06:21:26,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 06:21:26,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 06:21:26,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 06:21:26,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 06:21:26,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 06:21:26,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 06:21:26,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 06:21:26,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 06:21:26,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 06:21:26,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 06:21:26,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 06:21:26,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 06:21:26,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 06:21:26,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 06:21:26,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 06:21:26,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 06:21:26,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 06:21:26,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 06:21:26,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 06:21:26,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 06:21:26,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 06:21:26,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 06:21:26,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 06:21:26,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 06:21:26,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 06:21:26,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 06:21:26,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 06:21:26,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 06:21:26,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 06:21:26,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 06:21:26,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 06:21:26,514 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 06:21:26,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 06:21:26,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 06:21:26,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 06:21:26,516 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 06:21:26,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 06:21:26,516 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 06:21:26,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 06:21:26,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 06:21:26,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 06:21:26,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 06:21:26,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 06:21:26,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 06:21:26,520 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 06:21:26,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 06:21:26,520 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 06:21:26,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 06:21:26,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 06:21:26,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 06:21:26,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 06:21:26,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 06:21:26,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 06:21:26,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 06:21:26,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 06:21:26,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 06:21:26,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 06:21:26,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 06:21:26,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 06:21:26,523 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 06:21:26,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 06:21:26,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 06:21:26,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 06:21:26,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 06:21:26,819 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 06:21:26,819 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 06:21:26,820 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 06:21:26,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad8f984f/af5a2546eb45417e8ab3823fb6754f84/FLAG2c7e14090 [2020-07-20 06:21:27,321 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 06:21:27,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 06:21:27,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad8f984f/af5a2546eb45417e8ab3823fb6754f84/FLAG2c7e14090 [2020-07-20 06:21:27,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad8f984f/af5a2546eb45417e8ab3823fb6754f84 [2020-07-20 06:21:27,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 06:21:27,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 06:21:27,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 06:21:27,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 06:21:27,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 06:21:27,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:21:27" (1/1) ... [2020-07-20 06:21:27,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd9a6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:27, skipping insertion in model container [2020-07-20 06:21:27,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:21:27" (1/1) ... [2020-07-20 06:21:27,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 06:21:27,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 06:21:28,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:21:28,056 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 06:21:28,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:21:28,115 INFO L208 MainTranslator]: Completed translation [2020-07-20 06:21:28,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28 WrapperNode [2020-07-20 06:21:28,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 06:21:28,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 06:21:28,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 06:21:28,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 06:21:28,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28" (1/1) ... [2020-07-20 06:21:28,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28" (1/1) ... [2020-07-20 06:21:28,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28" (1/1) ... [2020-07-20 06:21:28,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28" (1/1) ... [2020-07-20 06:21:28,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28" (1/1) ... [2020-07-20 06:21:28,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28" (1/1) ... [2020-07-20 06:21:28,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28" (1/1) ... [2020-07-20 06:21:28,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 06:21:28,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 06:21:28,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 06:21:28,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 06:21:28,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 06:21:28,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 06:21:28,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 06:21:28,308 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 06:21:28,308 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-20 06:21:28,308 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-20 06:21:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-20 06:21:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-20 06:21:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-20 06:21:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 06:21:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 06:21:28,310 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 06:21:28,310 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 06:21:28,310 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 06:21:28,311 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 06:21:28,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 06:21:28,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 06:21:28,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 06:21:28,312 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 06:21:28,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-20 06:21:28,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-20 06:21:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-20 06:21:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-20 06:21:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-20 06:21:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 06:21:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 06:21:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 06:21:28,314 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 06:21:28,314 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 06:21:28,314 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 06:21:28,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 06:21:28,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 06:21:28,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 06:21:28,709 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 06:21:28,709 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 06:21:28,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:21:28 BoogieIcfgContainer [2020-07-20 06:21:28,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 06:21:28,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 06:21:28,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 06:21:28,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 06:21:28,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:21:27" (1/3) ... [2020-07-20 06:21:28,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6eab9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:21:28, skipping insertion in model container [2020-07-20 06:21:28,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:21:28" (2/3) ... [2020-07-20 06:21:28,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6eab9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:21:28, skipping insertion in model container [2020-07-20 06:21:28,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:21:28" (3/3) ... [2020-07-20 06:21:28,723 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-20 06:21:28,734 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 06:21:28,741 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 06:21:28,760 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 06:21:28,792 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 06:21:28,792 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 06:21:28,792 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 06:21:28,792 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 06:21:28,792 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 06:21:28,792 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 06:21:28,793 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 06:21:28,793 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 06:21:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-20 06:21:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 06:21:28,825 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:28,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:28,826 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-20 06:21:28,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:28,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799304071] [2020-07-20 06:21:28,839 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:29,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799304071] [2020-07-20 06:21:29,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:29,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 06:21:29,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070208005] [2020-07-20 06:21:29,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 06:21:29,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:29,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 06:21:29,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 06:21:29,361 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 6 states. [2020-07-20 06:21:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:30,466 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2020-07-20 06:21:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 06:21:30,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-07-20 06:21:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:30,484 INFO L225 Difference]: With dead ends: 356 [2020-07-20 06:21:30,484 INFO L226 Difference]: Without dead ends: 248 [2020-07-20 06:21:30,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:21:30,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-07-20 06:21:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 185. [2020-07-20 06:21:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-07-20 06:21:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2020-07-20 06:21:30,599 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 65 [2020-07-20 06:21:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:30,601 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2020-07-20 06:21:30,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 06:21:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2020-07-20 06:21:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 06:21:30,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:30,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:30,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 06:21:30,617 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:30,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:30,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1537976919, now seen corresponding path program 1 times [2020-07-20 06:21:30,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:30,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912505282] [2020-07-20 06:21:30,619 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:30,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912505282] [2020-07-20 06:21:30,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:30,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 06:21:30,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788777740] [2020-07-20 06:21:30,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 06:21:30,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:30,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 06:21:30,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 06:21:30,800 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand 7 states. [2020-07-20 06:21:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:31,393 INFO L93 Difference]: Finished difference Result 406 states and 562 transitions. [2020-07-20 06:21:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 06:21:31,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2020-07-20 06:21:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:31,397 INFO L225 Difference]: With dead ends: 406 [2020-07-20 06:21:31,398 INFO L226 Difference]: Without dead ends: 238 [2020-07-20 06:21:31,401 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:21:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-20 06:21:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 182. [2020-07-20 06:21:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-20 06:21:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 241 transitions. [2020-07-20 06:21:31,441 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 241 transitions. Word has length 66 [2020-07-20 06:21:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:31,442 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 241 transitions. [2020-07-20 06:21:31,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 06:21:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 241 transitions. [2020-07-20 06:21:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-20 06:21:31,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:31,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:31,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 06:21:31,447 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:31,448 INFO L82 PathProgramCache]: Analyzing trace with hash -478173211, now seen corresponding path program 1 times [2020-07-20 06:21:31,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:31,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223507138] [2020-07-20 06:21:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:31,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223507138] [2020-07-20 06:21:31,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:31,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:21:31,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765135382] [2020-07-20 06:21:31,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:21:31,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:31,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:21:31,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:21:31,749 INFO L87 Difference]: Start difference. First operand 182 states and 241 transitions. Second operand 9 states. [2020-07-20 06:21:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:32,944 INFO L93 Difference]: Finished difference Result 582 states and 869 transitions. [2020-07-20 06:21:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 06:21:32,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-07-20 06:21:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:32,954 INFO L225 Difference]: With dead ends: 582 [2020-07-20 06:21:32,955 INFO L226 Difference]: Without dead ends: 417 [2020-07-20 06:21:32,958 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-07-20 06:21:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-07-20 06:21:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2020-07-20 06:21:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-07-20 06:21:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2020-07-20 06:21:33,057 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 72 [2020-07-20 06:21:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:33,057 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2020-07-20 06:21:33,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:21:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2020-07-20 06:21:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-20 06:21:33,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:33,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:33,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 06:21:33,060 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:33,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2098500188, now seen corresponding path program 1 times [2020-07-20 06:21:33,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:33,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781411491] [2020-07-20 06:21:33,061 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:33,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781411491] [2020-07-20 06:21:33,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:33,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 06:21:33,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896419537] [2020-07-20 06:21:33,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 06:21:33,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:33,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 06:21:33,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-20 06:21:33,272 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand 12 states. [2020-07-20 06:21:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:36,071 INFO L93 Difference]: Finished difference Result 873 states and 1358 transitions. [2020-07-20 06:21:36,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-20 06:21:36,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-07-20 06:21:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:36,079 INFO L225 Difference]: With dead ends: 873 [2020-07-20 06:21:36,079 INFO L226 Difference]: Without dead ends: 554 [2020-07-20 06:21:36,083 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2020-07-20 06:21:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-07-20 06:21:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 211. [2020-07-20 06:21:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-20 06:21:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2020-07-20 06:21:36,132 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 73 [2020-07-20 06:21:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:36,133 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2020-07-20 06:21:36,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 06:21:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2020-07-20 06:21:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 06:21:36,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:36,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:36,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 06:21:36,136 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-07-20 06:21:36,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:36,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134090751] [2020-07-20 06:21:36,139 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:36,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134090751] [2020-07-20 06:21:36,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:36,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 06:21:36,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683961637] [2020-07-20 06:21:36,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 06:21:36,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:36,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 06:21:36,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-20 06:21:36,306 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand 8 states. [2020-07-20 06:21:37,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:37,419 INFO L93 Difference]: Finished difference Result 612 states and 874 transitions. [2020-07-20 06:21:37,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 06:21:37,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2020-07-20 06:21:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:37,428 INFO L225 Difference]: With dead ends: 612 [2020-07-20 06:21:37,429 INFO L226 Difference]: Without dead ends: 418 [2020-07-20 06:21:37,434 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-20 06:21:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-07-20 06:21:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 323. [2020-07-20 06:21:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-20 06:21:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 419 transitions. [2020-07-20 06:21:37,475 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 419 transitions. Word has length 66 [2020-07-20 06:21:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:37,477 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 419 transitions. [2020-07-20 06:21:37,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 06:21:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 419 transitions. [2020-07-20 06:21:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 06:21:37,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:37,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:37,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 06:21:37,479 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2020-07-20 06:21:37,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:37,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553511443] [2020-07-20 06:21:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:37,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553511443] [2020-07-20 06:21:37,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:37,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:21:37,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075456195] [2020-07-20 06:21:37,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:21:37,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:37,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:21:37,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:21:37,663 INFO L87 Difference]: Start difference. First operand 323 states and 419 transitions. Second operand 9 states. [2020-07-20 06:21:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:38,474 INFO L93 Difference]: Finished difference Result 727 states and 1002 transitions. [2020-07-20 06:21:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 06:21:38,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-07-20 06:21:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:38,480 INFO L225 Difference]: With dead ends: 727 [2020-07-20 06:21:38,480 INFO L226 Difference]: Without dead ends: 421 [2020-07-20 06:21:38,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-07-20 06:21:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-07-20 06:21:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 341. [2020-07-20 06:21:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-07-20 06:21:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 437 transitions. [2020-07-20 06:21:38,518 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 437 transitions. Word has length 66 [2020-07-20 06:21:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:38,518 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 437 transitions. [2020-07-20 06:21:38,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:21:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2020-07-20 06:21:38,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 06:21:38,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:38,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:38,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 06:21:38,520 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:38,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:38,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2020-07-20 06:21:38,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:38,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096531399] [2020-07-20 06:21:38,521 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:38,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096531399] [2020-07-20 06:21:38,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:38,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:21:38,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682278327] [2020-07-20 06:21:38,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:21:38,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:38,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:21:38,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:21:38,681 INFO L87 Difference]: Start difference. First operand 341 states and 437 transitions. Second operand 9 states. [2020-07-20 06:21:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:41,095 INFO L93 Difference]: Finished difference Result 1164 states and 1617 transitions. [2020-07-20 06:21:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-20 06:21:41,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-07-20 06:21:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:41,102 INFO L225 Difference]: With dead ends: 1164 [2020-07-20 06:21:41,102 INFO L226 Difference]: Without dead ends: 840 [2020-07-20 06:21:41,105 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2020-07-20 06:21:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-07-20 06:21:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 643. [2020-07-20 06:21:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-07-20 06:21:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 815 transitions. [2020-07-20 06:21:41,172 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 815 transitions. Word has length 66 [2020-07-20 06:21:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:41,172 INFO L479 AbstractCegarLoop]: Abstraction has 643 states and 815 transitions. [2020-07-20 06:21:41,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:21:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 815 transitions. [2020-07-20 06:21:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 06:21:41,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:41,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:41,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 06:21:41,175 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:41,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:41,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2020-07-20 06:21:41,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:41,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604587642] [2020-07-20 06:21:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:41,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604587642] [2020-07-20 06:21:41,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:41,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 06:21:41,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148571232] [2020-07-20 06:21:41,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 06:21:41,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:41,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 06:21:41,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:21:41,358 INFO L87 Difference]: Start difference. First operand 643 states and 815 transitions. Second operand 9 states. [2020-07-20 06:21:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:42,156 INFO L93 Difference]: Finished difference Result 1352 states and 1804 transitions. [2020-07-20 06:21:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 06:21:42,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-07-20 06:21:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:42,163 INFO L225 Difference]: With dead ends: 1352 [2020-07-20 06:21:42,164 INFO L226 Difference]: Without dead ends: 764 [2020-07-20 06:21:42,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-07-20 06:21:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-07-20 06:21:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 669. [2020-07-20 06:21:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-07-20 06:21:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 834 transitions. [2020-07-20 06:21:42,257 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 834 transitions. Word has length 66 [2020-07-20 06:21:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:42,257 INFO L479 AbstractCegarLoop]: Abstraction has 669 states and 834 transitions. [2020-07-20 06:21:42,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 06:21:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 834 transitions. [2020-07-20 06:21:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 06:21:42,259 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:42,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:42,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 06:21:42,260 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2020-07-20 06:21:42,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:42,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511131175] [2020-07-20 06:21:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:42,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511131175] [2020-07-20 06:21:42,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:42,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 06:21:42,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736361759] [2020-07-20 06:21:42,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 06:21:42,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:42,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 06:21:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 06:21:42,394 INFO L87 Difference]: Start difference. First operand 669 states and 834 transitions. Second operand 6 states. [2020-07-20 06:21:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:43,146 INFO L93 Difference]: Finished difference Result 1262 states and 1648 transitions. [2020-07-20 06:21:43,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 06:21:43,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-20 06:21:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:43,155 INFO L225 Difference]: With dead ends: 1262 [2020-07-20 06:21:43,156 INFO L226 Difference]: Without dead ends: 814 [2020-07-20 06:21:43,159 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-20 06:21:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2020-07-20 06:21:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 708. [2020-07-20 06:21:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2020-07-20 06:21:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 908 transitions. [2020-07-20 06:21:43,243 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 908 transitions. Word has length 66 [2020-07-20 06:21:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:43,243 INFO L479 AbstractCegarLoop]: Abstraction has 708 states and 908 transitions. [2020-07-20 06:21:43,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 06:21:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 908 transitions. [2020-07-20 06:21:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-20 06:21:43,245 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:43,245 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:43,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 06:21:43,246 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:43,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1757954899, now seen corresponding path program 1 times [2020-07-20 06:21:43,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:43,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515084134] [2020-07-20 06:21:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 06:21:43,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515084134] [2020-07-20 06:21:43,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229216366] [2020-07-20 06:21:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16ffbf97 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:21:43,550 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16ffbf97 issued 1 check-sat command(s) [2020-07-20 06:21:43,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:21:43,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 06:21:43,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:21:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:43,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:21:43,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 06:21:43,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307236861] [2020-07-20 06:21:43,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:21:43,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:43,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:21:43,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:21:43,628 INFO L87 Difference]: Start difference. First operand 708 states and 908 transitions. Second operand 3 states. [2020-07-20 06:21:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:43,775 INFO L93 Difference]: Finished difference Result 1674 states and 2250 transitions. [2020-07-20 06:21:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:21:43,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-20 06:21:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:43,786 INFO L225 Difference]: With dead ends: 1674 [2020-07-20 06:21:43,786 INFO L226 Difference]: Without dead ends: 812 [2020-07-20 06:21:43,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:21:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-07-20 06:21:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-07-20 06:21:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-07-20 06:21:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1048 transitions. [2020-07-20 06:21:43,895 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1048 transitions. Word has length 86 [2020-07-20 06:21:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:43,896 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 1048 transitions. [2020-07-20 06:21:43,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:21:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1048 transitions. [2020-07-20 06:21:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-20 06:21:43,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:43,903 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:44,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 06:21:44,117 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:44,117 INFO L82 PathProgramCache]: Analyzing trace with hash -232030383, now seen corresponding path program 1 times [2020-07-20 06:21:44,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:44,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030988077] [2020-07-20 06:21:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 06:21:44,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030988077] [2020-07-20 06:21:44,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:44,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 06:21:44,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142124699] [2020-07-20 06:21:44,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 06:21:44,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:44,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 06:21:44,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 06:21:44,299 INFO L87 Difference]: Start difference. First operand 812 states and 1048 transitions. Second operand 8 states. [2020-07-20 06:21:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:45,159 INFO L93 Difference]: Finished difference Result 962 states and 1270 transitions. [2020-07-20 06:21:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 06:21:45,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2020-07-20 06:21:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:45,166 INFO L225 Difference]: With dead ends: 962 [2020-07-20 06:21:45,166 INFO L226 Difference]: Without dead ends: 959 [2020-07-20 06:21:45,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-07-20 06:21:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-07-20 06:21:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 820. [2020-07-20 06:21:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-07-20 06:21:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1043 transitions. [2020-07-20 06:21:45,252 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1043 transitions. Word has length 98 [2020-07-20 06:21:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:45,253 INFO L479 AbstractCegarLoop]: Abstraction has 820 states and 1043 transitions. [2020-07-20 06:21:45,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 06:21:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1043 transitions. [2020-07-20 06:21:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 06:21:45,255 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:45,256 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:45,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 06:21:45,256 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:45,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-07-20 06:21:45,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:45,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969133893] [2020-07-20 06:21:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 06:21:45,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969133893] [2020-07-20 06:21:45,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692398966] [2020-07-20 06:21:45,558 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@383f5a6 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:21:45,676 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@383f5a6 issued 3 check-sat command(s) [2020-07-20 06:21:45,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:21:45,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-20 06:21:45,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:21:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:21:45,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 06:21:45,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-07-20 06:21:45,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174910212] [2020-07-20 06:21:45,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 06:21:45,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:45,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 06:21:45,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-07-20 06:21:45,815 INFO L87 Difference]: Start difference. First operand 820 states and 1043 transitions. Second operand 16 states. [2020-07-20 06:21:49,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:49,746 INFO L93 Difference]: Finished difference Result 2540 states and 3915 transitions. [2020-07-20 06:21:49,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-07-20 06:21:49,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2020-07-20 06:21:49,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:49,765 INFO L225 Difference]: With dead ends: 2540 [2020-07-20 06:21:49,766 INFO L226 Difference]: Without dead ends: 2537 [2020-07-20 06:21:49,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2020-07-20 06:21:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2020-07-20 06:21:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2338. [2020-07-20 06:21:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-07-20 06:21:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3577 transitions. [2020-07-20 06:21:50,124 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3577 transitions. Word has length 99 [2020-07-20 06:21:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:50,125 INFO L479 AbstractCegarLoop]: Abstraction has 2338 states and 3577 transitions. [2020-07-20 06:21:50,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 06:21:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3577 transitions. [2020-07-20 06:21:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-20 06:21:50,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:50,136 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:50,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-20 06:21:50,350 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:50,350 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-07-20 06:21:50,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:50,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407051330] [2020-07-20 06:21:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-07-20 06:21:50,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407051330] [2020-07-20 06:21:50,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:21:50,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 06:21:50,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118509476] [2020-07-20 06:21:50,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 06:21:50,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:50,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 06:21:50,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 06:21:50,527 INFO L87 Difference]: Start difference. First operand 2338 states and 3577 transitions. Second operand 7 states. [2020-07-20 06:21:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:51,618 INFO L93 Difference]: Finished difference Result 3773 states and 6055 transitions. [2020-07-20 06:21:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 06:21:51,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2020-07-20 06:21:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:51,641 INFO L225 Difference]: With dead ends: 3773 [2020-07-20 06:21:51,641 INFO L226 Difference]: Without dead ends: 2107 [2020-07-20 06:21:51,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-20 06:21:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2020-07-20 06:21:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2006. [2020-07-20 06:21:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2020-07-20 06:21:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2998 transitions. [2020-07-20 06:21:52,081 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2998 transitions. Word has length 125 [2020-07-20 06:21:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:52,082 INFO L479 AbstractCegarLoop]: Abstraction has 2006 states and 2998 transitions. [2020-07-20 06:21:52,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 06:21:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2998 transitions. [2020-07-20 06:21:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-20 06:21:52,091 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:21:52,092 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:21:52,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 06:21:52,092 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:21:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:21:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2020-07-20 06:21:52,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:21:52,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982236503] [2020-07-20 06:21:52,094 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3edb8f68 [2020-07-20 06:21:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:21:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-07-20 06:21:52,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982236503] [2020-07-20 06:21:52,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413451686] [2020-07-20 06:21:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@30a7110c No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:21:52,525 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@30a7110c issued 1 check-sat command(s) [2020-07-20 06:21:52,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:21:52,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 06:21:52,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:21:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-20 06:21:52,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 06:21:52,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-20 06:21:52,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384587324] [2020-07-20 06:21:52,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 06:21:52,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:21:52,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 06:21:52,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:21:52,583 INFO L87 Difference]: Start difference. First operand 2006 states and 2998 transitions. Second operand 3 states. [2020-07-20 06:21:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:21:52,695 INFO L93 Difference]: Finished difference Result 2401 states and 3609 transitions. [2020-07-20 06:21:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 06:21:52,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-07-20 06:21:52,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:21:52,697 INFO L225 Difference]: With dead ends: 2401 [2020-07-20 06:21:52,697 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 06:21:52,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:21:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 06:21:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 06:21:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 06:21:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 06:21:52,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-20 06:21:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:21:52,713 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 06:21:52,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 06:21:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 06:21:52,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 06:21:52,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-20 06:21:52,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 06:21:59,819 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 06:22:00,883 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-07-20 06:22:02,054 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-07-20 06:22:02,412 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 74 [2020-07-20 06:22:02,516 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-07-20 06:22:03,233 WARN L193 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 83 [2020-07-20 06:22:03,475 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 06:22:04,416 WARN L193 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 77 [2020-07-20 06:22:05,068 WARN L193 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2020-07-20 06:22:05,645 WARN L193 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2020-07-20 06:22:05,903 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 36 [2020-07-20 06:22:06,973 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-07-20 06:22:07,097 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-07-20 06:22:07,231 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-07-20 06:22:10,107 WARN L193 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 214 DAG size of output: 150 [2020-07-20 06:22:10,268 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-07-20 06:22:10,783 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2020-07-20 06:22:11,304 WARN L193 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2020-07-20 06:22:11,578 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 06:22:11,832 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 06:22:14,738 WARN L193 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 227 DAG size of output: 153 [2020-07-20 06:22:17,118 WARN L193 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 178 DAG size of output: 127 [2020-07-20 06:22:18,554 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 179 DAG size of output: 116 [2020-07-20 06:22:19,388 WARN L193 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 89 [2020-07-20 06:22:19,547 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-07-20 06:22:20,559 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 181 DAG size of output: 100 [2020-07-20 06:22:23,411 WARN L193 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 214 DAG size of output: 150 [2020-07-20 06:22:23,657 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 06:22:24,021 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-07-20 06:22:24,221 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-07-20 06:22:24,795 WARN L193 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-07-20 06:22:24,983 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-07-20 06:22:25,417 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 53 [2020-07-20 06:22:27,546 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 214 DAG size of output: 130 [2020-07-20 06:22:28,228 WARN L193 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2020-07-20 06:22:29,460 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 200 DAG size of output: 90 [2020-07-20 06:22:29,464 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-20 06:22:29,465 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-20 06:22:29,465 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-20 06:22:29,465 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-20 06:22:29,465 INFO L271 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: true [2020-07-20 06:22:29,465 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-20 06:22:29,465 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-20 06:22:29,466 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-20 06:22:29,466 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 ~p_dw_i~0)) (= ~c_dr_pc~0 1) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (not (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 06:22:29,466 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-20 06:22:29,467 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (<= ~p_dw_pc~0 0) (not (= ~c_dr_pc~0 1)) (= 1 ~p_dw_i~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~q_free~0)) (not (= 0 |old(~c_num_read~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 06:22:29,467 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (and (= 0 ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 06:22:29,467 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-20 06:22:29,468 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-20 06:22:29,468 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-20 06:22:29,468 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (and (= 0 ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 06:22:29,468 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse12 (= ~c_dr_pc~0 1))) (let ((.cse2 (not .cse12)) (.cse19 (= 1 ~p_dw_i~0)) (.cse4 (= 0 ~q_free~0)) (.cse6 (= 1 ~p_dw_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~p_dw_st~0))) (let ((.cse14 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (and .cse4 .cse6 (= 1 ~p_num_write~0) .cse7 .cse8)) (.cse17 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse13 (not (<= |old(~p_dw_pc~0)| 0))) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse11 (and (<= 2 ~c_dr_st~0) (not (= 1 ~p_dw_st~0)) .cse2 .cse6 .cse19 (not (= ~p_dw_pc~0 ~q_free~0)) (not (= ~p_dw_st~0 ~q_free~0)))) (.cse3 (let ((.cse18 (not .cse19))) (and (or .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse18)))) (.cse9 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 .cse3 (let ((.cse5 (+ |old(~p_num_write~0)| 1))) (and .cse4 (<= ~p_num_write~0 .cse5) .cse6 (<= .cse5 ~p_num_write~0) .cse7 .cse8)) .cse9) (or .cse10 .cse11 .cse3 .cse12 .cse9 .cse13) (or .cse14 .cse0 .cse10 .cse15 .cse3 .cse16 .cse17 .cse9 .cse13) (or .cse14 .cse0 .cse10 .cse15 .cse3 .cse16 .cse17 .cse12 .cse13) (or .cse1 .cse11 .cse3 .cse12 .cse9))))) [2020-07-20 06:22:29,469 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse5 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse21 (= 1 ~p_dw_i~0)) (.cse6 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse8 (= |old(~q_free~0)| ~q_free~0))) (let ((.cse3 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse22 (or (and .cse2 .cse5 .cse21 .cse6 .cse7 (not (= 0 ~q_free~0)) (not (= ~p_dw_pc~0 ~q_free~0)) .cse8) (and .cse2 (<= 1 ~q_free~0) .cse5 .cse21 .cse6 .cse7 .cse8))) (.cse4 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse9 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse14 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (not (= 0 |old(~p_num_write~0)|))) (.cse17 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse18 (and .cse22 .cse4 (= ~c_last_read~0 ~p_last_write~0) .cse9)) (.cse12 (and .cse3 .cse22 .cse4 .cse9)) (.cse15 (not (= 1 |old(~q_free~0)|))) (.cse10 (let ((.cse20 (not .cse21))) (and (or .cse20 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse20)))) (.cse13 (= ~c_dr_pc~0 1)) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) .cse10 .cse11) (or .cse12 .cse1 .cse10 .cse13 .cse11) (or .cse14 .cse0 .cse15 .cse16 .cse10 .cse17 .cse18 .cse11 .cse19) (or .cse14 .cse0 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18 .cse19) (or .cse12 .cse15 .cse10 .cse13 .cse11 .cse19))))) [2020-07-20 06:22:29,469 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse9 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse15 (= 0 ~q_free~0)) (.cse10 (<= ~p_dw_pc~0 0)) (.cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (not (= 1 |old(~p_dw_pc~0)|))) (.cse14 (= 1 ~p_dw_pc~0)) (.cse7 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= 0 ~c_num_read~0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse4 (let ((.cse17 (not (= 1 ~p_dw_i~0)))) (and (or .cse17 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse17)))) (.cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse12 (= ~c_dr_pc~0 1)) (.cse6 (and .cse9 .cse15 .cse10 .cse11 (= 1 ~p_num_write~0) .cse16)) (.cse8 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10 .cse11) .cse2 .cse4 .cse12 .cse7 .cse8) (or .cse13 (and (<= 2 ~c_dr_st~0) .cse14) .cse4 .cse12 .cse7) (or .cse1 .cse13 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (not .cse12) .cse4 (and .cse9 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse14 .cse11 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse16) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse8)))) [2020-07-20 06:22:29,469 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-20 06:22:29,469 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-20 06:22:29,469 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-20 06:22:29,470 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse19 (= 1 ~p_dw_i~0))) (let ((.cse16 (not (= 1 |old(~p_dw_pc~0)|))) (.cse18 (= 1 ~p_dw_pc~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (not (= 0 ~c_num_read~0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse9 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse10 (= 0 ~p_num_write~0)) (.cse12 (= |old(~q_free~0)| ~q_free~0)) (.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse4 (let ((.cse21 (not .cse19))) (and (or .cse21 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse21)))) (.cse17 (= ~c_dr_pc~0 1)) (.cse14 (not (<= 2 |old(~c_dr_st~0)|))) (.cse15 (not (<= |old(~p_dw_pc~0)| 0))) (.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse8 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse20 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (or .cse16 .cse4 .cse17 .cse14 (and (<= 2 ~c_dr_st~0) .cse18 .cse19 .cse20)) (or .cse1 .cse16 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (not .cse17) .cse4 .cse14 (and .cse6 (<= ~p_num_write~0 ~c_num_read~0) (<= ~c_num_read~0 ~p_num_write~0) .cse7 .cse18 .cse19 .cse8 .cse20 .cse11 .cse12 .cse13)) (or .cse0 .cse1 .cse2 (and .cse6 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) .cse3 .cse4 .cse5 .cse17 .cse15) (or .cse2 .cse4 .cse17 .cse14 .cse15 (and .cse6 (<= ~p_dw_pc~0 0) .cse19 .cse8 .cse20))))) [2020-07-20 06:22:29,470 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse13 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse15 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse6 (= 1 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 1)) (.cse8 (and .cse13 (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) .cse19 .cse15 (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_free~0)| ~q_free~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse5 (= 0 ~q_free~0)) (.cse14 (<= ~p_dw_pc~0 0)) (.cse16 (= 1 ~p_num_write~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse3 (let ((.cse18 (not .cse19))) (and (or .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse18)))) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse17 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (not .cse2) .cse3 .cse4 (and .cse5 .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse7)) (or .cse8 .cse9 .cse0 .cse10 .cse11 .cse3 .cse12 .cse2 (and .cse13 .cse5 .cse14 .cse15 .cse16 .cse7) .cse17) (or (and .cse13 .cse14 .cse15) .cse10 .cse3 .cse2 .cse4 .cse17) (or .cse1 (and (<= 2 ~c_dr_st~0) .cse6) .cse3 .cse2 .cse4) (or .cse8 .cse9 .cse0 .cse10 (and .cse5 .cse14 .cse16 .cse7) .cse11 .cse3 .cse12 .cse4 .cse17)))) [2020-07-20 06:22:29,470 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-20 06:22:29,470 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-20 06:22:29,471 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-20 06:22:29,471 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-20 06:22:29,471 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-20 06:22:29,472 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 1 ~q_free~0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (not (<= ~p_dw_pc~0 0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= 1 ~p_num_write~0))) (.cse12 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse0 .cse4 .cse3 .cse5 .cse8) (or .cse9 .cse10 .cse1 .cse4 .cse3 .cse5 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse1 (not (<= ~p_num_write~0 .cse13)) .cse4 .cse5 .cse8 .cse12 (not (<= .cse13 ~p_num_write~0)))) (or .cse9 .cse4 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 (not (= 1 ~c_num_read~0)) .cse7) (or .cse9 .cse10 .cse1 .cse4 .cse5 .cse8 .cse11 .cse12))) [2020-07-20 06:22:29,472 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-20 06:22:29,473 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-20 06:22:29,473 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-20 06:22:29,473 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-20 06:22:29,473 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-20 06:22:29,474 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 1 ~q_free~0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (not (<= ~p_dw_pc~0 0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= 1 ~p_num_write~0))) (.cse12 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse0 .cse4 .cse3 .cse5 .cse8) (or .cse9 .cse10 .cse1 .cse4 .cse3 .cse5 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse1 (not (<= ~p_num_write~0 .cse13)) .cse4 .cse5 .cse8 .cse12 (not (<= .cse13 ~p_num_write~0)))) (or .cse9 .cse4 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 (not (= 1 ~c_num_read~0)) .cse7) (or .cse9 .cse10 .cse1 .cse4 .cse5 .cse8 .cse11 .cse12))) [2020-07-20 06:22:29,474 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse16 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse17 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse4 (= 0 ~p_dw_st~0))) (let ((.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 1 ~q_free~0))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (and (<= 2 ~c_dr_st~0) (or (and .cse16 .cse17) .cse4))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (<= ~p_dw_pc~0 0))) (.cse12 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse13 (not (= 0 ~q_free~0))) (.cse7 (and .cse16 (< 0 (+ immediate_notify_threads_~tmp~0 1)) .cse17 (<= immediate_notify_threads_~tmp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 ~c_num_read~0)) .cse8) (or .cse0 .cse1 .cse2 (not .cse9) .cse3 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse7 .cse8) (or .cse10 .cse3 .cse9 .cse11 .cse7) (or .cse10 .cse12 .cse1 .cse3 .cse11 .cse6 .cse13 .cse7) (let ((.cse15 (+ ~c_num_read~0 1))) (or .cse14 .cse0 .cse1 (not (<= ~p_num_write~0 .cse15)) .cse3 .cse11 .cse13 (not (<= .cse15 ~p_num_write~0)))) (or .cse14 .cse0 .cse3 .cse9 .cse11) (or .cse10 .cse12 .cse1 .cse3 .cse9 .cse6 .cse13 .cse7)))) [2020-07-20 06:22:29,474 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-20 06:22:29,474 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 06:22:29,474 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~c_num_read~0 |old(~c_num_read~0)|) (= ~p_dw_st~0 |old(~p_dw_st~0)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_free~0 |old(~q_free~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_dr_i~0 |old(~c_dr_i~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2020-07-20 06:22:29,475 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 06:22:29,475 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse40 (<= 1 ~q_free~0)) (.cse9 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse39 (= 1 ~p_dw_i~0)) (.cse41 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse42 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse28 (or (and .cse9 .cse40 .cse39) (and .cse9 .cse39 .cse41 .cse42))) (.cse34 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse36 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse37 (not (<= 1 |old(~q_free~0)|))) (.cse35 (not .cse39)) (.cse26 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse11 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse12 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse13 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse14 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse15 (= ~a_t~0 |old(~a_t~0)|)) (.cse16 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse17 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse18 (= 0 ~p_dw_st~0)) (.cse19 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse27 (= |old(~q_free~0)| ~q_free~0)) (.cse20 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (not (= 1 |old(~q_free~0)|))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (and (or (and .cse26 .cse9 .cse10 .cse39 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27) (and .cse26 .cse9 .cse10 .cse39 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse41 .cse27 .cse42)) .cse20)) (.cse4 (let ((.cse38 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse34 .cse38 .cse35 .cse36) (or .cse38 .cse37 .cse35)))) (.cse5 (not (<= |old(~p_dw_pc~0)| 0))) (.cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse24 (not (= 0 |old(~q_free~0)|))) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse30 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse22 (not (= 1 |old(~p_dw_pc~0)|))) (.cse23 (not (<= 2 |old(~p_dw_st~0)|))) (.cse25 (and (or .cse34 .cse35 .cse36) (or .cse37 .cse35))) (.cse29 (and .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28)) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse1 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 1 ~q_free~0)) .cse3 .cse4 .cse5 .cse21) (or .cse6 .cse22 (not (= 1 |old(~p_num_write~0)|)) .cse23 .cse24 .cse25 .cse8 (and .cse26 .cse11 .cse12 (= 1 ~p_num_write~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28)) (or .cse0 .cse22 (= 1 |old(~p_dw_st~0)|) .cse25 .cse29 .cse3) (or .cse30 .cse6 .cse22 .cse2 .cse3 .cse4 .cse31) (or .cse0 .cse6 .cse1 .cse7 .cse8 .cse2 .cse4 .cse5 .cse21) (let ((.cse32 (+ |old(~c_num_read~0)| 1))) (or .cse6 .cse22 .cse23 .cse24 (not (<= |old(~p_num_write~0)| .cse32)) .cse25 (not (<= .cse32 |old(~p_num_write~0)|)) (let ((.cse33 (+ ~c_num_read~0 1))) (and .cse26 (<= ~p_num_write~0 .cse33) .cse11 .cse12 .cse13 .cse14 (<= .cse33 ~p_num_write~0) .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28)) (not .cse0))) (or .cse30 .cse6 .cse22 .cse23 .cse25 .cse29 .cse3 .cse31))))) [2020-07-20 06:22:29,476 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse41 (= 1 ~p_dw_i~0))) (let ((.cse9 (= 1 |old(~c_dr_pc~0)|)) (.cse34 (+ |old(~c_num_read~0)| 1)) (.cse35 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse37 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse38 (not (<= 1 |old(~q_free~0)|))) (.cse36 (not .cse41)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse39 (= 1 ~p_dw_pc~0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse17 (or (and .cse41 (not (= ~p_dw_pc~0 ~q_free~0)) (not (= 0 ~q_free~0))) (and (<= 1 ~q_free~0) .cse41))) (.cse19 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse0 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse12 .cse39 .cse14 .cse17 .cse19)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse21 (not (= 0 |old(~c_num_read~0)|))) (.cse13 (<= ~p_dw_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~c_num_read~0)) (.cse18 (= 0 ~p_num_write~0)) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse29 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse23 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse24 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (= 1 ~q_free~0)) (.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse27 (let ((.cse40 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse35 .cse40 .cse36 .cse37) (or .cse40 .cse38 .cse36)))) (.cse26 (not (<= |old(~p_dw_pc~0)| 0))) (.cse33 (and .cse12 (not .cse14) .cse39 .cse17)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_dw_pc~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse32 (= 1 |old(~p_dw_st~0)|)) (.cse5 (not (<= |old(~p_num_write~0)| .cse34))) (.cse6 (and (or .cse35 .cse36 .cse37) (or .cse38 .cse36))) (.cse7 (not (<= .cse34 |old(~p_num_write~0)|))) (.cse30 (not (<= 2 |old(~c_dr_st~0)|))) (.cse8 (not .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21 (and .cse22 .cse15 .cse23 .cse16 .cse24 .cse18 .cse19 .cse20 .cse25) .cse26 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse2 .cse30 .cse8 .cse27 .cse31) (or .cse0 .cse1 .cse2 (not (= 1 |old(~p_num_write~0)|)) .cse3 .cse4 .cse6 .cse21) (or .cse0 .cse1 .cse10 .cse11 .cse21 (and .cse12 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18 .cse20 .cse19) .cse30 .cse8 .cse26 .cse27 .cse28) (or .cse29 .cse1 .cse2 .cse4 .cse32 .cse6 .cse30 .cse8 .cse31) (or .cse9 .cse33 .cse10 (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse12 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse22 .cse23 .cse24 .cse20 .cse25) .cse30 .cse27 .cse26) (or .cse9 .cse33 .cse2 .cse32 .cse6 .cse30) (or .cse1 .cse2 .cse4 .cse3 .cse32 .cse5 .cse6 .cse7 .cse30 .cse8))))) [2020-07-20 06:22:29,476 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-20 06:22:29,476 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-20 06:22:29,476 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-20 06:22:29,477 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse62 (<= 1 ~q_free~0)) (.cse57 (= 1 ~p_dw_i~0)) (.cse64 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse65 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse49 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse50 (= |old(~q_free~0)| ~q_free~0)) (.cse56 (+ |old(~c_num_read~0)| 1)) (.cse38 (= 0 ~q_free~0)) (.cse55 (or (and .cse62 .cse57) (and .cse57 .cse64 .cse65))) (.cse41 (<= 2 ~p_dw_st~0)) (.cse59 (<= ~c_num_read~0 ~p_num_write~0)) (.cse60 (<= ~p_num_write~0 ~c_num_read~0)) (.cse32 (<= 2 ~c_dr_st~0)) (.cse39 (= 1 ~p_dw_pc~0)) (.cse33 (= ~c_dr_pc~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse51 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse53 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse54 (not (<= 1 |old(~q_free~0)|))) (.cse52 (not .cse57)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse5 (let ((.cse63 (= 0 ~p_dw_st~0))) (or (and .cse62 .cse57 .cse63) (and .cse57 .cse63 .cse64 .cse65)))) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse34 (= 0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= 0 ~p_num_write~0)) (.cse14 (= 1 ~q_free~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse28 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse29 (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse36 .cse14 .cse15)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse18 (let ((.cse61 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse51 .cse61 .cse52 .cse53) (or .cse61 .cse54 .cse52)))) (.cse31 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse20 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse25 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse23 (and .cse59 .cse60 .cse32 .cse5 .cse39 .cse33 .cse37)) (.cse30 (not (= 0 |old(~c_num_read~0)|))) (.cse26 (and .cse59 .cse60 .cse32 .cse39 .cse55 .cse33 .cse37 .cse41)) (.cse27 (let ((.cse58 (+ ~c_num_read~0 1))) (and .cse38 (<= .cse58 ~p_num_write~0) (<= ~p_num_write~0 .cse58) .cse39 .cse55 .cse33 .cse37 .cse41))) (.cse40 (= 1 ~p_num_write~0)) (.cse21 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse43 (not (<= 2 |old(~p_dw_st~0)|))) (.cse42 (not (= 0 |old(~q_free~0)|))) (.cse44 (not (<= |old(~p_num_write~0)| .cse56))) (.cse48 (and .cse2 .cse49 .cse4 .cse39 .cse57 .cse6 .cse7 .cse37 .cse32 .cse8 .cse33 .cse10 .cse11 .cse13 .cse50 .cse15)) (.cse46 (not (<= .cse56 |old(~p_num_write~0)|))) (.cse24 (not .cse0)) (.cse22 (not (= 1 |old(~p_dw_pc~0)|))) (.cse47 (= 1 |old(~p_dw_st~0)|)) (.cse16 (and .cse32 (not (= 1 ~p_dw_st~0)) (not .cse33) .cse39 .cse55)) (.cse45 (and (or .cse51 .cse52 .cse53) (or .cse54 .cse52))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse22 .cse23 .cse17 .cse24 .cse18 .cse25 .cse26 .cse27) (or .cse21 .cse23 .cse28 .cse19 .cse26 .cse29 .cse1 .cse30 .cse17 .cse24 .cse18 .cse27 .cse31) (or .cse0 .cse21 .cse23 .cse28 .cse26 .cse19 .cse29 .cse1 (and .cse32 .cse3 .cse33 .cse5 .cse34 .cse35 .cse36 .cse14 .cse37) (and .cse38 .cse39 .cse34 .cse40 .cse37 .cse41) .cse30 .cse18 .cse27 .cse31) (or .cse21 .cse23 .cse22 .cse42 .cse43 .cse44 .cse45 .cse46 .cse24 .cse26 .cse27) (or .cse20 .cse21 .cse22 .cse43 .cse47 .cse48 .cse45 .cse17 .cse24 .cse25) (or .cse21 .cse23 .cse22 (not (= 1 |old(~p_num_write~0)|)) .cse42 .cse43 .cse45 .cse30 .cse26 .cse27 (and .cse49 .cse6 .cse7 .cse40 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse50 .cse15)) (or .cse21 .cse22 .cse43 .cse42 .cse47 .cse44 .cse48 .cse45 .cse46 .cse17 .cse24) (or .cse0 .cse22 .cse47 .cse16 .cse45 .cse17))))) [2020-07-20 06:22:29,477 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse35 (= 1 ~p_dw_i~0))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse28 (+ |old(~c_num_read~0)| 1)) (.cse29 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse31 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse32 (not (<= 1 |old(~q_free~0)|))) (.cse30 (not .cse35)) (.cse26 (= 0 ~q_free~0)) (.cse18 (= 1 ~p_dw_pc~0)) (.cse21 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (<= 2 ~p_dw_st~0))) (let ((.cse1 (not (= 1 |old(~q_free~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (not (= 0 |old(~c_num_read~0)|))) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse20 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse22 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse4 (not (<= |old(~p_dw_pc~0)| 0))) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse24 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse12 (let ((.cse34 (+ ~c_num_read~0 1))) (and .cse26 (<= .cse34 ~p_num_write~0) (<= ~p_num_write~0 .cse34) .cse18 .cse35 (= ~c_dr_pc~0 1) .cse21 .cse23))) (.cse3 (let ((.cse33 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse29 .cse33 .cse30 .cse31) (or .cse33 .cse32 .cse30)))) (.cse25 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= 1 |old(~p_dw_pc~0)|))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 0 |old(~q_free~0)|))) (.cse14 (= 1 |old(~p_dw_st~0)|)) (.cse9 (not (<= |old(~p_num_write~0)| .cse28))) (.cse10 (and (or .cse29 .cse30 .cse31) (or .cse32 .cse30))) (.cse11 (not (<= .cse28 |old(~p_num_write~0)|))) (.cse2 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (not .cse0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse6 .cse14 .cse10 .cse2) (or .cse5 .cse1 .cse15 .cse16 .cse12 .cse2 .cse3 .cse4 .cse17) (or .cse5 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 .cse8 (and (= ~c_num_read~0 |old(~c_num_read~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) .cse18 .cse19 .cse20 .cse21 (= |old(~q_free~0)| ~q_free~0) .cse22 .cse23) .cse10 .cse16 .cse12) (or .cse24 .cse5 .cse6 .cse7 .cse14 .cse10 .cse2 .cse13 .cse25) (let ((.cse27 (= 0 ~c_num_read~0))) (or .cse0 .cse5 .cse1 .cse15 (and .cse26 .cse18 .cse27 (= 1 ~p_num_write~0) .cse21 .cse23) .cse16 .cse12 (and .cse19 .cse27 .cse20 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0) .cse21 (= 1 ~q_free~0) .cse22) .cse4 .cse3 .cse17)) (or .cse24 .cse5 .cse6 .cse12 .cse2 .cse3 .cse25) (or .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse2 .cse13))))) [2020-07-20 06:22:29,477 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-20 06:22:29,478 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-20 06:22:29,478 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-20 06:22:29,478 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse61 (<= 1 ~q_free~0)) (.cse60 (= 1 ~p_dw_i~0)) (.cse63 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse64 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse45 (= 0 ~q_free~0)) (.cse54 (or (and .cse61 .cse60) (and .cse60 .cse63 .cse64))) (.cse47 (<= 2 ~p_dw_st~0)) (.cse56 (<= ~c_num_read~0 ~p_num_write~0)) (.cse57 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse58 (+ |old(~c_num_read~0)| 1)) (.cse50 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse52 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse53 (not (<= 1 |old(~q_free~0)|))) (.cse51 (not .cse60)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse5 (let ((.cse62 (= 0 ~p_dw_st~0))) (or (and .cse61 .cse60 .cse62) (and .cse60 .cse62 .cse63 .cse64)))) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse41 (= 0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse42 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (= 0 ~p_num_write~0)) (.cse14 (= 1 ~q_free~0)) (.cse2 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse48 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse46 (= 1 ~p_dw_pc~0)) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse44 (= ~p_last_write~0 ~q_buf_0~0)) (.cse39 (<= 2 ~c_dr_st~0)) (.cse8 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse40 (= ~c_dr_pc~0 1)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse49 (= |old(~q_free~0)| ~q_free~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse29 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse35 (and .cse2 .cse48 .cse4 .cse46 .cse60 .cse6 .cse7 .cse44 .cse39 .cse8 .cse10 .cse40 .cse11 .cse13 .cse49 .cse15)) (.cse21 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse23 (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse41 .cse12 .cse42 .cse13 .cse43 .cse14 .cse15)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse18 (let ((.cse59 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse50 .cse59 .cse51 .cse52) (or .cse59 .cse53 .cse51)))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse37 (not (<= |old(~p_num_write~0)| .cse58))) (.cse38 (not (<= .cse58 |old(~p_num_write~0)|))) (.cse26 (not .cse0)) (.cse20 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse24 (and .cse56 .cse57 .cse39 .cse46 .cse5 .cse40 .cse44)) (.cse36 (not (= 0 |old(~q_free~0)|))) (.cse32 (not (<= 2 |old(~p_dw_st~0)|))) (.cse25 (not (= 0 |old(~c_num_read~0)|))) (.cse22 (and .cse56 .cse57 .cse39 .cse46 .cse54 .cse40 .cse44 .cse47)) (.cse27 (let ((.cse55 (+ ~c_num_read~0 1))) (and .cse45 (<= .cse55 ~p_num_write~0) (<= ~p_num_write~0 .cse55) .cse46 .cse54 .cse40 .cse44 .cse47))) (.cse30 (not (= 1 |old(~p_dw_pc~0)|))) (.cse33 (= 1 |old(~p_dw_st~0)|)) (.cse16 (and .cse39 (not (= 1 ~p_dw_st~0)) (not .cse40) .cse46 .cse54)) (.cse34 (and (or .cse50 .cse51 .cse52) (or .cse53 .cse51))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse19 .cse22 .cse23 .cse1 .cse24 .cse25 .cse17 .cse26 .cse18 .cse27 .cse28) (or .cse29 .cse20 .cse30 .cse24 .cse17 .cse26 .cse18 .cse31 .cse22 .cse27) (or .cse29 .cse20 .cse30 .cse32 .cse33 .cse34 .cse17 .cse26 .cse31 .cse35) (or .cse20 .cse30 .cse32 .cse36 .cse33 .cse37 .cse34 .cse38 .cse17 .cse26 .cse35) (or .cse0 .cse20 .cse21 .cse22 .cse19 .cse23 .cse1 (and .cse39 .cse3 .cse40 .cse5 .cse41 .cse42 .cse43 .cse14 .cse44) .cse24 (and .cse45 .cse46 .cse41 (= 1 ~p_num_write~0) .cse44 .cse47) .cse25 .cse18 .cse27 .cse28) (or .cse20 .cse30 .cse24 .cse36 .cse32 .cse37 .cse34 .cse38 .cse26 .cse22 .cse27) (or .cse20 .cse30 (not (= 1 |old(~p_num_write~0)|)) .cse24 .cse36 .cse32 .cse34 .cse25 (and .cse2 .cse48 .cse4 .cse46 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse49 .cse15) .cse22 .cse27) (or .cse0 .cse30 .cse33 .cse16 .cse34 .cse17))))) [2020-07-20 06:22:29,478 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-20 06:22:29,479 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse62 (<= 1 ~q_free~0)) (.cse57 (= 1 ~p_dw_i~0)) (.cse64 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse65 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse49 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse50 (= |old(~q_free~0)| ~q_free~0)) (.cse56 (+ |old(~c_num_read~0)| 1)) (.cse38 (= 0 ~q_free~0)) (.cse55 (or (and .cse62 .cse57) (and .cse57 .cse64 .cse65))) (.cse41 (<= 2 ~p_dw_st~0)) (.cse59 (<= ~c_num_read~0 ~p_num_write~0)) (.cse60 (<= ~p_num_write~0 ~c_num_read~0)) (.cse32 (<= 2 ~c_dr_st~0)) (.cse39 (= 1 ~p_dw_pc~0)) (.cse33 (= ~c_dr_pc~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse51 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse53 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse54 (not (<= 1 |old(~q_free~0)|))) (.cse52 (not .cse57)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse5 (let ((.cse63 (= 0 ~p_dw_st~0))) (or (and .cse62 .cse57 .cse63) (and .cse57 .cse63 .cse64 .cse65)))) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse34 (= 0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= 0 ~p_num_write~0)) (.cse14 (= 1 ~q_free~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse28 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse29 (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse36 .cse14 .cse15)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse18 (let ((.cse61 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse51 .cse61 .cse52 .cse53) (or .cse61 .cse54 .cse52)))) (.cse31 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse20 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse25 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse23 (and .cse59 .cse60 .cse32 .cse5 .cse39 .cse33 .cse37)) (.cse30 (not (= 0 |old(~c_num_read~0)|))) (.cse26 (and .cse59 .cse60 .cse32 .cse39 .cse55 .cse33 .cse37 .cse41)) (.cse27 (let ((.cse58 (+ ~c_num_read~0 1))) (and .cse38 (<= .cse58 ~p_num_write~0) (<= ~p_num_write~0 .cse58) .cse39 .cse55 .cse33 .cse37 .cse41))) (.cse40 (= 1 ~p_num_write~0)) (.cse21 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse43 (not (<= 2 |old(~p_dw_st~0)|))) (.cse42 (not (= 0 |old(~q_free~0)|))) (.cse44 (not (<= |old(~p_num_write~0)| .cse56))) (.cse48 (and .cse2 .cse49 .cse4 .cse39 .cse57 .cse6 .cse7 .cse37 .cse32 .cse8 .cse33 .cse10 .cse11 .cse13 .cse50 .cse15)) (.cse46 (not (<= .cse56 |old(~p_num_write~0)|))) (.cse24 (not .cse0)) (.cse22 (not (= 1 |old(~p_dw_pc~0)|))) (.cse47 (= 1 |old(~p_dw_st~0)|)) (.cse16 (and .cse32 (not (= 1 ~p_dw_st~0)) (not .cse33) .cse39 .cse55)) (.cse45 (and (or .cse51 .cse52 .cse53) (or .cse54 .cse52))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse22 .cse23 .cse17 .cse24 .cse18 .cse25 .cse26 .cse27) (or .cse21 .cse23 .cse28 .cse19 .cse26 .cse29 .cse1 .cse30 .cse17 .cse24 .cse18 .cse27 .cse31) (or .cse0 .cse21 .cse23 .cse28 .cse26 .cse19 .cse29 .cse1 (and .cse32 .cse3 .cse33 .cse5 .cse34 .cse35 .cse36 .cse14 .cse37) (and .cse38 .cse39 .cse34 .cse40 .cse37 .cse41) .cse30 .cse18 .cse27 .cse31) (or .cse21 .cse23 .cse22 .cse42 .cse43 .cse44 .cse45 .cse46 .cse24 .cse26 .cse27) (or .cse20 .cse21 .cse22 .cse43 .cse47 .cse48 .cse45 .cse17 .cse24 .cse25) (or .cse21 .cse23 .cse22 (not (= 1 |old(~p_num_write~0)|)) .cse42 .cse43 .cse45 .cse30 .cse26 .cse27 (and .cse49 .cse6 .cse7 .cse40 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse50 .cse15)) (or .cse21 .cse22 .cse43 .cse42 .cse47 .cse44 .cse48 .cse45 .cse46 .cse17 .cse24) (or .cse0 .cse22 .cse47 .cse16 .cse45 .cse17))))) [2020-07-20 06:22:29,479 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-20 06:22:29,479 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-20 06:22:29,479 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-20 06:22:29,479 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-20 06:22:29,480 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-20 06:22:29,480 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-20 06:22:29,480 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-20 06:22:29,480 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (not (<= ~p_dw_pc~0 0))) (.cse3 (not (<= 2 ~c_dr_st~0))) (.cse7 (not (= 1 ~p_dw_pc~0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse8 (not (= 1 ~q_free~0))) (.cse6 (not (= 1 ~p_num_write~0))) (.cse4 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))) (.cse9 (not (= 1 ~c_num_read~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= 0 ~c_num_read~0)) .cse5 .cse1 .cse2 .cse6 (not (= 0 ~q_free~0)) .cse4) (or .cse7 .cse5 (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse8 .cse6 .cse4 .cse9 .cse10) (or .cse7 .cse1 .cse2 .cse3 .cse4) (or .cse7 .cse5 .cse1 .cse2 .cse8 .cse6 (not (<= 2 ~p_dw_st~0)) .cse4 .cse9 .cse10))) [2020-07-20 06:22:29,480 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-20 06:22:29,480 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-20 06:22:29,481 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-20 06:22:29,481 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-20 06:22:29,481 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-20 06:22:29,481 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-20 06:22:29,483 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 1 ~q_free~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 06:22:29,483 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-20 06:22:29,483 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-20 06:22:29,483 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse20 (<= 1 ~q_free~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse21 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_dw_pc~0 0)) (.cse2 (let ((.cse22 (= 0 ~p_dw_st~0))) (or (and .cse20 .cse19 .cse22) (and .cse19 .cse22 (not (= ~p_dw_pc~0 ~q_free~0)) .cse21)))) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse6 (= 0 ~p_num_write~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~q_free~0)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse10 ~p_num_write~0) (<= ~p_num_write~0 .cse10) .cse11 .cse3 .cse8 .cse12)) (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse0 .cse1 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse2 .cse13 .cse14 .cse15 .cse7 .cse16) (and .cse17 .cse18 .cse0 .cse2 .cse11 .cse8) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not .cse19) (and .cse17 .cse18 .cse0 .cse11 .cse8 .cse12) (and .cse9 .cse11 .cse4 (= 1 ~p_num_write~0) .cse8 .cse12) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 (not (= 1 ~p_dw_st~0)) (not .cse3) .cse11 (or .cse20 .cse21)) (and .cse1 .cse2 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse7 .cse16) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))))) [2020-07-20 06:22:29,484 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse20 (<= 1 ~q_free~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse21 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_dw_pc~0 0)) (.cse2 (let ((.cse22 (= 0 ~p_dw_st~0))) (or (and .cse20 .cse19 .cse22) (and .cse19 .cse22 (not (= ~p_dw_pc~0 ~q_free~0)) .cse21)))) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse6 (= 0 ~p_num_write~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~q_free~0)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse10 ~p_num_write~0) (<= ~p_num_write~0 .cse10) .cse11 .cse3 .cse8 .cse12)) (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse0 .cse1 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse2 .cse13 .cse14 .cse15 .cse7 .cse16) (and .cse17 .cse18 .cse0 .cse2 .cse11 .cse8) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not .cse19) (and .cse17 .cse18 .cse0 .cse11 .cse8 .cse12) (and .cse9 .cse11 .cse4 (= 1 ~p_num_write~0) .cse8 .cse12) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 (not (= 1 ~p_dw_st~0)) (not .cse3) .cse11 (or .cse20 .cse21)) (and .cse1 .cse2 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse7 .cse16) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))))) [2020-07-20 06:22:29,484 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-20 06:22:29,484 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-20 06:22:29,484 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse20 (<= 1 ~q_free~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse21 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_dw_pc~0 0)) (.cse2 (let ((.cse22 (= 0 ~p_dw_st~0))) (or (and .cse20 .cse19 .cse22) (and .cse19 .cse22 (not (= ~p_dw_pc~0 ~q_free~0)) .cse21)))) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse6 (= 0 ~p_num_write~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~q_free~0)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse10 ~p_num_write~0) (<= ~p_num_write~0 .cse10) .cse11 .cse3 .cse8 .cse12)) (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse0 .cse1 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse2 .cse13 .cse14 .cse15 .cse7 .cse16) (and .cse17 .cse18 .cse0 .cse2 .cse11 .cse8) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not .cse19) (and .cse17 .cse18 .cse0 .cse11 .cse8 .cse12) (and .cse9 .cse11 .cse4 (= 1 ~p_num_write~0) .cse8 .cse12) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 (not (= 1 ~p_dw_st~0)) (not .cse3) .cse11 (or .cse20 .cse21)) (and .cse1 .cse2 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse7 .cse16) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))))) [2020-07-20 06:22:29,484 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 1 ~q_free~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 06:22:29,484 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-20 06:22:29,485 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 06:22:29,485 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (not (= ~c_dr_pc~0 1)) (not (= 1 ~p_dw_i~0)) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) [2020-07-20 06:22:29,485 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 06:22:29,485 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 06:22:29,485 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-20 06:22:29,485 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-20 06:22:29,485 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-20 06:22:29,485 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-20 06:22:29,485 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-20 06:22:29,486 INFO L264 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse1 (not (= 0 ~c_num_read~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= 0 ~q_free~0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse3 (and (<= 0 is_do_write_p_triggered_~__retres1~0) (<= is_do_write_p_triggered_~__retres1~0 0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse7 (not (<= 2 ~c_dr_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (or .cse0 .cse3 .cse4 .cse8 .cse7))) [2020-07-20 06:22:29,486 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-20 06:22:29,486 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-20 06:22:29,486 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse14 (<= 2 ~p_dw_st~0)) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse11 (not (<= 2 |old(~p_dw_st~0)|))) (.cse12 (not (= 0 |old(~q_free~0)|))) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (<= 2 ~c_dr_st~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 0 ~p_dw_st~0)) (.cse10 (= 1 ~q_free~0)) (.cse13 (not (= 1 ~p_dw_i~0))) (.cse17 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (<= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 (not (<= ~p_num_write~0 .cse3)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse14) (not .cse15))) (let ((.cse16 (= 1 ~c_num_read~0))) (or .cse0 (and .cse16 .cse6 .cse7 .cse8 .cse10 .cse14) .cse1 .cse2 (and .cse16 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse17 (not (= 1 ~p_num_write~0)))) (or (not (<= ~p_dw_pc~0 0)) .cse15 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (and .cse6 .cse7 (= 0 ~c_num_read~0) .cse8 .cse9 .cse10) .cse13 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse17 (not (= 0 ~p_num_write~0))))) [2020-07-20 06:22:29,486 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-20 06:22:29,487 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse7 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 .cse6 (not (<= ~p_num_write~0 .cse3)) (not .cse7))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse7 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse8 (not (= 0 ~p_num_write~0))))) [2020-07-20 06:22:29,487 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse17 (= 1 ~p_dw_i~0))) (let ((.cse20 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (not .cse17)) (.cse10 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse13 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (= 1 ~q_free~0)) (.cse16 (= 1 ~p_dw_pc~0))) (let ((.cse0 (not .cse16)) (.cse7 (or (and .cse16 .cse17 (= ~c_dr_pc~0 1) .cse19) (and .cse10 .cse16 .cse17 .cse13 .cse19))) (.cse8 (<= 2 ~p_dw_st~0)) (.cse2 (and (or (= |old(~q_free~0)| ~p_dw_pc~0) .cse25) (or (not (<= 1 |old(~q_free~0)|)) .cse25))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse24 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not .cse20)) (.cse11 (= ~a_t~0 |old(~a_t~0)|)) (.cse12 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse14 (= 0 ~c_num_read~0)) (.cse15 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= 0 ~p_dw_st~0)) (.cse9 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse5 (= 1 ~c_num_read~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8) .cse9 (and .cse10 (= 0 ~q_free~0) .cse11 (= ~c_last_read~0 |old(~c_last_read~0)|) .cse12 .cse13 .cse14 .cse15) (not (= 1 ~p_num_write~0)) (and .cse5 .cse16 .cse17 .cse6 .cse18 .cse19 .cse20))) (let ((.cse23 (+ |old(~c_num_read~0)| 1)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0))) (or .cse0 (and .cse21 .cse22 .cse6 .cse7 .cse8) .cse1 .cse2 (not (<= .cse23 ~p_num_write~0)) .cse4 .cse3 (not (<= ~p_num_write~0 .cse23)) (and .cse21 .cse22 .cse16 .cse17 .cse6 .cse18 .cse19 .cse20) (not .cse24))) (or (not (<= ~p_dw_pc~0 0)) .cse24 .cse1 (and .cse11 .cse13 .cse12 .cse14 .cse15 .cse6 .cse18 .cse19) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse25 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse9 (not (= 0 ~p_num_write~0))))))) [2020-07-20 06:22:29,487 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse7 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 .cse6 (not (<= ~p_num_write~0 .cse3)) (not .cse7) (and (= ~c_num_read~0 |old(~c_num_read~0)|) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_pc~0 1) (= ~c_last_read~0 |old(~c_last_read~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~q_free~0)| ~q_free~0)))) (or .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse7 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse8 (not (= 0 ~p_num_write~0))))) [2020-07-20 06:22:29,487 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-20 06:22:29,487 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-20 06:22:29,488 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse17 (= 1 ~p_dw_i~0))) (let ((.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse3 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse8 (not (= 1 ~p_dw_pc~0))) (.cse9 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= 0 |old(~q_free~0)|))) (.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse0 (= ~a_t~0 |old(~a_t~0)|)) (.cse13 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse1 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse2 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse14 (= |old(~q_free~0)| ~q_free~0)) (.cse15 (let ((.cse18 (= ~c_num_read~0 |old(~c_num_read~0)|))) (or (and .cse18 (<= 1 ~q_free~0) .cse17) (and .cse18 .cse17 (not (= ~p_dw_pc~0 ~q_free~0)))))) (.cse6 (not .cse17)) (.cse4 (= 1 |old(~c_dr_pc~0)|))) (and (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 1 ~q_free~0)) (not (<= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse7 (not (= 0 ~p_num_write~0))) (or .cse8 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7 (not (= 1 ~p_num_write~0)) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15)) (let ((.cse16 (+ |old(~c_num_read~0)| 1))) (or .cse8 .cse9 .cse5 (not (<= .cse16 ~p_num_write~0)) .cse10 .cse11 (and .cse12 (= ~c_dr_pc~0 1) .cse0 .cse13 .cse1 .cse2 .cse14 .cse15) .cse6 (not (<= ~p_num_write~0 .cse16)) (not .cse4)))))) [2020-07-20 06:22:29,488 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-20 06:22:29,488 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse7 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 .cse6 (not (<= ~p_num_write~0 .cse3)) (not .cse7))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse7 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse8 (not (= 0 ~p_num_write~0))))) [2020-07-20 06:22:29,488 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-20 06:22:29,488 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-20 06:22:29,489 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 1 ~q_free~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse12 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= 1 ~p_dw_i~0))) (.cse13 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 (not (<= ~p_num_write~0 .cse3)) (not .cse12))) (or .cse0 .cse12 .cse1 .cse2 (and .cse6 (= 1 ~c_num_read~0) (not .cse7) .cse9 .cse8 .cse10) .cse4 .cse5 .cse11 .cse13 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse12 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse11 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse13 (not (= 0 ~p_num_write~0))))) [2020-07-20 06:22:29,489 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-20 06:22:29,489 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-20 06:22:29,489 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-20 06:22:29,489 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 ~p_dw_st~0)) (not (= 0 |old(~q_free~0)|)) (and (= |old(~c_dr_i~0)| ~c_dr_i~0) (= 0 ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 06:22:29,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:22:29 BoogieIcfgContainer [2020-07-20 06:22:29,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 06:22:29,578 INFO L168 Benchmark]: Toolchain (without parser) took 61837.45 ms. Allocated memory was 138.4 MB in the beginning and 816.8 MB in the end (delta: 678.4 MB). Free memory was 103.0 MB in the beginning and 117.1 MB in the end (delta: -14.1 MB). Peak memory consumption was 700.7 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:29,579 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-20 06:22:29,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.07 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 90.4 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:29,580 INFO L168 Benchmark]: Boogie Preprocessor took 138.73 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 90.4 MB in the beginning and 179.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:29,580 INFO L168 Benchmark]: RCFGBuilder took 459.15 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 152.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:29,581 INFO L168 Benchmark]: TraceAbstraction took 60860.03 ms. Allocated memory was 201.9 MB in the beginning and 816.8 MB in the end (delta: 615.0 MB). Free memory was 152.4 MB in the beginning and 117.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 686.7 MB. Max. memory is 7.1 GB. [2020-07-20 06:22:29,583 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.07 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 90.4 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.73 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 90.4 MB in the beginning and 179.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 459.15 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 152.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60860.03 ms. Allocated memory was 201.9 MB in the beginning and 816.8 MB in the end (delta: 615.0 MB). Free memory was 152.4 MB in the beginning and 117.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 686.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((1 == \old(c_dr_pc) || !(1 == \old(q_free))) || (((((((((((((c_num_read == \old(c_num_read) && p_dw_pc <= 0) && p_num_write == \old(p_num_write)) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || !(2 <= \old(c_dr_st))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_dw_pc) <= 0)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_num_write) <= \old(c_num_read))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || 1 == \old(p_dw_st)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read))) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && a_t == \old(a_t)) && c_dr_pc == 1) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || 1 == \old(p_dw_st)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && a_t == \old(a_t)) && c_dr_pc == 1) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && (((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && c_dr_pc == 1) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || (((((0 == q_free && 1 == p_dw_pc) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(1 == \old(c_dr_pc))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(1 == \old(p_num_write))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(0 == \old(c_num_read))) || ((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((1 == \old(c_dr_pc) || !(1 == \old(p_dw_pc))) || 1 == \old(p_dw_st)) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(1 == p_dw_pc) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 <= p_num_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(p_num_write <= \old(c_num_read) + 1)) || !(1 == \old(c_dr_pc))) || (((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && a_t == \old(a_t)) && c_dr_pc == 1) && c_last_read == \old(c_last_read)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free)) && ((((((((!(1 == p_dw_pc) || 1 == \old(c_dr_pc)) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(1 == p_num_write))) && ((((((((!(p_dw_pc <= 0) || 1 == \old(c_dr_pc)) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(\old(p_num_write) <= c_num_read)) || !(c_num_read <= \old(p_num_write))) || !(c_dr_pc == 1)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || ((((0 == q_free && 1 == p_dw_pc) && p_num_write <= c_num_read + 1) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0)) && (((((((((((((((((\old(p_dw_st) == p_dw_st && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)) || !(0 == c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || c_dr_pc == 1) || (((((\old(p_dw_st) == p_dw_st && 0 == q_free) && p_dw_pc <= 0) && c_dr_st == \old(c_dr_st)) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0))) && (((((((\old(p_dw_st) == p_dw_st && p_dw_pc <= 0) && c_dr_st == \old(c_dr_st)) || !(1 == \old(q_free))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((!(1 == \old(p_dw_pc)) || (2 <= c_dr_st && 1 == p_dw_pc)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st)))) && (((((((((((((((((\old(p_dw_st) == p_dw_st && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)) || !(0 == c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || (((0 == q_free && p_dw_pc <= 0) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || ((\old(q_free) == p_dw_pc || !(1 == p_dw_i)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || (((1 == c_num_read && c_last_read == p_last_write) && ((((1 == p_dw_pc && 1 == p_dw_i) && c_dr_pc == 1) && 1 == q_free) || ((((\old(p_dw_st) == p_dw_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && 1 == q_free))) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || (((((((\old(p_dw_st) == p_dw_st && 0 == q_free) && a_t == \old(a_t)) && c_last_read == \old(c_last_read)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc))) || !(1 == p_num_write)) || ((((((1 == c_num_read && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) && (((((((((!(1 == p_dw_pc) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && ((((1 == p_dw_pc && 1 == p_dw_i) && c_dr_pc == 1) && 1 == q_free) || ((((\old(p_dw_st) == p_dw_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && 1 == q_free))) && 2 <= p_dw_st)) || !(p_last_write == q_buf_0)) || ((\old(q_free) == p_dw_pc || !(1 == p_dw_i)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= p_num_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(p_num_write <= \old(c_num_read) + 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == \old(c_dr_pc)))) && (((((((((!(p_dw_pc <= 0) || 1 == \old(c_dr_pc)) || !(p_last_write == q_buf_0)) || (((((((a_t == \old(a_t) && c_dr_st == \old(c_dr_st)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == p_dw_i)) || !(1 == p_num_write)) || !(0 == q_free)) || !(2 <= c_dr_st)) && (((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == p_num_write)) || !(0 == q_free))) && ((((!(p_dw_pc <= 0) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(2 <= c_dr_st)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((((c_num_read == \old(c_num_read) && 2 <= c_dr_st) && p_dw_pc <= 0) && p_num_write == \old(p_num_write)) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((0 == q_free && 1 == p_dw_pc) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && (1 <= q_free || !(p_dw_st == q_free)))) || ((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && p_last_write == q_buf_0) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((1 == \old(c_dr_pc) || !(1 == \old(q_free))) || (((((((((((((c_num_read == \old(c_num_read) && p_dw_pc <= 0) && p_num_write == \old(p_num_write)) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || !(2 <= \old(c_dr_st))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_dw_pc) <= 0)) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_num_write) <= \old(c_num_read))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && c_dr_pc == 1) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || (((((0 == q_free && 1 == p_dw_pc) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(1 == \old(p_dw_pc))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(1 == \old(c_dr_pc))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || 1 == \old(p_dw_st)) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && c_dr_pc == 1) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(1 == \old(p_dw_pc))) || !(1 == \old(p_num_write))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(0 == \old(c_num_read))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((((((((\old(p_dw_st) == p_dw_st && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && 1 == p_num_write) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || 1 == \old(p_dw_st)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && c_dr_pc == 1) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc)))) && (((((1 == \old(c_dr_pc) || !(1 == \old(p_dw_pc))) || 1 == \old(p_dw_st)) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(\old(p_num_write) <= c_num_read)) || !(c_num_read <= \old(p_num_write))) || !(c_dr_pc == 1)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || (((((0 == q_free && p_num_write <= \old(p_num_write) + 1) && 1 == p_dw_pc) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) && (((((!(1 == \old(q_free)) || ((((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && 1 == p_dw_i) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || ((((0 == q_free && 1 == p_dw_pc) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || ((((0 == q_free && 1 == p_dw_pc) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(c_last_read == \old(p_last_write))) || c_dr_pc == 1) || !(\old(p_dw_pc) <= 0))) && ((((!(1 == \old(p_dw_pc)) || ((((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && 1 == p_dw_i) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((!(p_dw_pc <= 0) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(2 <= c_dr_st)) || (__retres1 <= 0 && 0 <= __retres1)) && (((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == p_num_write)) || !(0 == q_free)) || (__retres1 <= 0 && 0 <= __retres1))) && (((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == q_free)) || !(1 == p_num_write)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_num_read)) || !(c_last_read == p_last_write))) && ((((!(1 == p_dw_pc) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(2 <= c_dr_st)) || (__retres1 <= 0 && 0 <= __retres1))) && (((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == q_free)) || !(1 == p_num_write)) || !(2 <= p_dw_st)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_num_read)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((!(1 == p_dw_pc) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 <= p_num_write)) || ((((((p_num_write <= c_num_read && c_num_read <= p_num_write) && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(p_num_write <= \old(c_num_read) + 1)) || ((((((p_num_write <= c_num_read && c_num_read <= p_num_write) && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) && (((((((((!(1 == p_dw_pc) || (((((1 == c_num_read && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st)) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || (((((1 == c_num_read && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(1 == p_num_write))) && (((((((((!(p_dw_pc <= 0) || 1 == \old(c_dr_pc)) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || (((((2 <= c_dr_st && c_dr_pc == 1) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || (((((((\old(p_dw_st) == p_dw_st && q_buf_0 == \old(q_buf_0)) && c_dr_st == \old(c_dr_st)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && p_last_write == q_buf_0) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) && ((((!(1 == \old(p_dw_pc)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || (((2 <= c_dr_st && 1 == p_dw_pc) && 1 == p_dw_i) && !(0 == q_free)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(\old(p_num_write) <= c_num_read)) || !(c_num_read <= \old(p_num_write))) || !(c_dr_pc == 1)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || ((((((((((\old(p_dw_st) == p_dw_st && p_num_write <= c_num_read) && c_num_read <= p_num_write) && q_buf_0 == \old(q_buf_0)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && !(0 == q_free)) && p_last_write == q_buf_0) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || (((((((\old(p_dw_st) == p_dw_st && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && c_dr_st == \old(c_dr_st)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || c_dr_pc == 1) || !(\old(p_dw_pc) <= 0))) && (((((!(1 == \old(q_free)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) || ((((\old(p_dw_st) == p_dw_st && p_dw_pc <= 0) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && !(0 == q_free))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24.1s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2091 SDtfs, 4974 SDslu, 2220 SDs, 0 SdLazy, 10339 SolverSat, 2043 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 623 SyntacticMatches, 3 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2338occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 1555 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3013 PreInvPairs, 3531 NumberOfFragments, 13008 HoareAnnotationTreeSize, 3013 FomulaSimplifications, 38236070 FormulaSimplificationTreeSizeReduction, 6.5s HoareSimplificationTime, 45 FomulaSimplificationsInter, 1290290 FormulaSimplificationTreeSizeReductionInter, 29.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1466 ConstructedInterpolants, 0 QuantifiedInterpolants, 380667 SizeOfPredicates, 9 NumberOfNonLiveVariables, 882 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 310/340 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...