/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 -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-3af5e1f [2020-09-04 13:46:03,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:46:03,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:46:03,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:46:03,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:46:03,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:46:03,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:46:03,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:46:03,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:46:03,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:46:03,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:46:03,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:46:03,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:46:03,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:46:03,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:46:03,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:46:03,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:46:03,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:46:03,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:46:03,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:46:03,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:46:03,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:46:03,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:46:03,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:46:03,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:46:03,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:46:03,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:46:03,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:46:03,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:46:03,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:46:03,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:46:03,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:46:03,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:46:03,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:46:03,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:46:03,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:46:03,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:46:03,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:46:03,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:46:03,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:46:03,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:46:03,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:46:03,543 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:46:03,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:46:03,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:46:03,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:46:03,545 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:46:03,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:46:03,545 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:46:03,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:46:03,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:46:03,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:46:03,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:46:03,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:46:03,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:46:03,547 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:46:03,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:46:03,547 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:46:03,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:46:03,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:46:03,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:46:03,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:46:03,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:46:03,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:46:03,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:46:03,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:46:03,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:46:03,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:46:03,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:46:03,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:46:03,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:46:03,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:46:04,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:46:04,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:46:04,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:46:04,056 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:46:04,056 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:46:04,060 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-09-04 13:46:04,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/641173035/7a940ef478a5405789c28475c35e89df/FLAG0e95ea505 [2020-09-04 13:46:04,732 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:46:04,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-09-04 13:46:04,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/641173035/7a940ef478a5405789c28475c35e89df/FLAG0e95ea505 [2020-09-04 13:46:05,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/641173035/7a940ef478a5405789c28475c35e89df [2020-09-04 13:46:05,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:46:05,066 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:46:05,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:46:05,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:46:05,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:46:05,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:46:05" (1/1) ... [2020-09-04 13:46:05,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cedd037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05, skipping insertion in model container [2020-09-04 13:46:05,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:46:05" (1/1) ... [2020-09-04 13:46:05,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:46:05,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:46:05,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:46:05,394 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:46:05,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:46:05,470 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:46:05,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05 WrapperNode [2020-09-04 13:46:05,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:46:05,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:46:05,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:46:05,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:46:05,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05" (1/1) ... [2020-09-04 13:46:05,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05" (1/1) ... [2020-09-04 13:46:05,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05" (1/1) ... [2020-09-04 13:46:05,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05" (1/1) ... [2020-09-04 13:46:05,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05" (1/1) ... [2020-09-04 13:46:05,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05" (1/1) ... [2020-09-04 13:46:05,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05" (1/1) ... [2020-09-04 13:46:05,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:46:05,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:46:05,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:46:05,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:46:05,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:46:05,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:46:05,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:46:05,691 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 13:46:05,691 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-09-04 13:46:05,692 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-09-04 13:46:05,692 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-09-04 13:46:05,692 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-09-04 13:46:05,692 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-09-04 13:46:05,692 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 13:46:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 13:46:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 13:46:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 13:46:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 13:46:05,694 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 13:46:05,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:46:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:46:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:46:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 13:46:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-09-04 13:46:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-09-04 13:46:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-09-04 13:46:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-09-04 13:46:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-09-04 13:46:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 13:46:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 13:46:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 13:46:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 13:46:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 13:46:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 13:46:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:46:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:46:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:46:06,152 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:46:06,152 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-09-04 13:46:06,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:46:06 BoogieIcfgContainer [2020-09-04 13:46:06,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:46:06,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:46:06,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:46:06,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:46:06,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:46:05" (1/3) ... [2020-09-04 13:46:06,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dec7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:46:06, skipping insertion in model container [2020-09-04 13:46:06,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:46:05" (2/3) ... [2020-09-04 13:46:06,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dec7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:46:06, skipping insertion in model container [2020-09-04 13:46:06,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:46:06" (3/3) ... [2020-09-04 13:46:06,170 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-09-04 13:46:06,183 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:46:06,194 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:46:06,216 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:46:06,248 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:46:06,248 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:46:06,248 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:46:06,249 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:46:06,249 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:46:06,249 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:46:06,249 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:46:06,249 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:46:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-09-04 13:46:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 13:46:06,290 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:06,291 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-09-04 13:46:06,292 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-09-04 13:46:06,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:06,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706158782] [2020-09-04 13:46:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:06,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:06,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:06,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:06,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:06,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:46:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:06,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:06,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:06,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706158782] [2020-09-04 13:46:06,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:06,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:46:06,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487602879] [2020-09-04 13:46:06,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:46:06,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:06,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:46:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:46:06,937 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 6 states. [2020-09-04 13:46:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:08,168 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2020-09-04 13:46:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:46:08,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-09-04 13:46:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:08,192 INFO L225 Difference]: With dead ends: 356 [2020-09-04 13:46:08,193 INFO L226 Difference]: Without dead ends: 248 [2020-09-04 13:46:08,199 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-09-04 13:46:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-09-04 13:46:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 185. [2020-09-04 13:46:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-09-04 13:46:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2020-09-04 13:46:08,343 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 65 [2020-09-04 13:46:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:08,344 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2020-09-04 13:46:08,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:46:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2020-09-04 13:46:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 13:46:08,350 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:08,351 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-09-04 13:46:08,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:46:08,351 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:08,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1537976919, now seen corresponding path program 1 times [2020-09-04 13:46:08,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:08,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296960396] [2020-09-04 13:46:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:08,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:08,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:08,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:08,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:08,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:46:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:08,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:08,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:08,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296960396] [2020-09-04 13:46:08,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:08,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:46:08,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491050473] [2020-09-04 13:46:08,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:46:08,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:08,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:46:08,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:46:08,629 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand 7 states. [2020-09-04 13:46:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:09,374 INFO L93 Difference]: Finished difference Result 406 states and 562 transitions. [2020-09-04 13:46:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:46:09,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2020-09-04 13:46:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:09,380 INFO L225 Difference]: With dead ends: 406 [2020-09-04 13:46:09,380 INFO L226 Difference]: Without dead ends: 238 [2020-09-04 13:46:09,384 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-09-04 13:46:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-04 13:46:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 182. [2020-09-04 13:46:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-09-04 13:46:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 241 transitions. [2020-09-04 13:46:09,419 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 241 transitions. Word has length 66 [2020-09-04 13:46:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:09,420 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 241 transitions. [2020-09-04 13:46:09,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:46:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 241 transitions. [2020-09-04 13:46:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 13:46:09,424 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:09,424 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-09-04 13:46:09,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:46:09,425 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:09,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:09,425 INFO L82 PathProgramCache]: Analyzing trace with hash -478173211, now seen corresponding path program 1 times [2020-09-04 13:46:09,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:09,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002101700] [2020-09-04 13:46:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:09,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:09,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:09,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:09,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:09,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:46:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:09,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 13:46:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:09,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:09,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:09,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002101700] [2020-09-04 13:46:09,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:09,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:46:09,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844467932] [2020-09-04 13:46:09,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:46:09,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:46:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:46:09,814 INFO L87 Difference]: Start difference. First operand 182 states and 241 transitions. Second operand 9 states. [2020-09-04 13:46:10,160 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-09-04 13:46:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:11,320 INFO L93 Difference]: Finished difference Result 582 states and 869 transitions. [2020-09-04 13:46:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:46:11,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-09-04 13:46:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:11,333 INFO L225 Difference]: With dead ends: 582 [2020-09-04 13:46:11,333 INFO L226 Difference]: Without dead ends: 417 [2020-09-04 13:46:11,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:46:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-09-04 13:46:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2020-09-04 13:46:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-09-04 13:46:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2020-09-04 13:46:11,451 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 72 [2020-09-04 13:46:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:11,454 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2020-09-04 13:46:11,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:46:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2020-09-04 13:46:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-04 13:46:11,464 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:11,465 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-09-04 13:46:11,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:46:11,465 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2098500188, now seen corresponding path program 1 times [2020-09-04 13:46:11,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:11,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149008987] [2020-09-04 13:46:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:11,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:11,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:11,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:11,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:11,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:46:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:11,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-04 13:46:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:11,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:11,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:11,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149008987] [2020-09-04 13:46:11,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:11,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:46:11,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546962260] [2020-09-04 13:46:11,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:46:11,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:46:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:46:11,773 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand 12 states. [2020-09-04 13:46:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:15,155 INFO L93 Difference]: Finished difference Result 873 states and 1358 transitions. [2020-09-04 13:46:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-09-04 13:46:15,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-09-04 13:46:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:15,164 INFO L225 Difference]: With dead ends: 873 [2020-09-04 13:46:15,164 INFO L226 Difference]: Without dead ends: 554 [2020-09-04 13:46:15,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 13:46:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-09-04 13:46:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 211. [2020-09-04 13:46:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-09-04 13:46:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2020-09-04 13:46:15,220 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 73 [2020-09-04 13:46:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:15,222 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2020-09-04 13:46:15,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:46:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2020-09-04 13:46:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 13:46:15,227 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:15,234 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-09-04 13:46:15,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:46:15,234 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:15,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-09-04 13:46:15,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:15,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775476914] [2020-09-04 13:46:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:15,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:15,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:15,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:15,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:15,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:46:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:15,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:15,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:15,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775476914] [2020-09-04 13:46:15,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:15,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 13:46:15,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571585680] [2020-09-04 13:46:15,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:46:15,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:15,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:46:15,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:46:15,503 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand 8 states. [2020-09-04 13:46:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:16,792 INFO L93 Difference]: Finished difference Result 612 states and 874 transitions. [2020-09-04 13:46:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:46:16,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2020-09-04 13:46:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:16,797 INFO L225 Difference]: With dead ends: 612 [2020-09-04 13:46:16,797 INFO L226 Difference]: Without dead ends: 418 [2020-09-04 13:46:16,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:46:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-09-04 13:46:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 323. [2020-09-04 13:46:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-09-04 13:46:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 419 transitions. [2020-09-04 13:46:16,845 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 419 transitions. Word has length 66 [2020-09-04 13:46:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:16,845 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 419 transitions. [2020-09-04 13:46:16,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:46:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 419 transitions. [2020-09-04 13:46:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 13:46:16,847 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:16,848 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-09-04 13:46:16,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:46:16,848 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2020-09-04 13:46:16,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:16,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843787497] [2020-09-04 13:46:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:16,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:16,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:16,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:16,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:16,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:46:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:17,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:17,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:17,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843787497] [2020-09-04 13:46:17,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:17,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:46:17,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224884626] [2020-09-04 13:46:17,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:46:17,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:46:17,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:46:17,069 INFO L87 Difference]: Start difference. First operand 323 states and 419 transitions. Second operand 9 states. [2020-09-04 13:46:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:18,143 INFO L93 Difference]: Finished difference Result 727 states and 1002 transitions. [2020-09-04 13:46:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:46:18,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-09-04 13:46:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:18,149 INFO L225 Difference]: With dead ends: 727 [2020-09-04 13:46:18,150 INFO L226 Difference]: Without dead ends: 421 [2020-09-04 13:46:18,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:46:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-09-04 13:46:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 341. [2020-09-04 13:46:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-09-04 13:46:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 437 transitions. [2020-09-04 13:46:18,190 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 437 transitions. Word has length 66 [2020-09-04 13:46:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:18,191 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 437 transitions. [2020-09-04 13:46:18,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:46:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2020-09-04 13:46:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 13:46:18,192 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:18,192 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-09-04 13:46:18,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:46:18,193 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:18,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:18,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2020-09-04 13:46:18,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:18,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422291050] [2020-09-04 13:46:18,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:18,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:18,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:18,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:18,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:18,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:46:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:18,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:18,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:18,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-09-04 13:46:18,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422291050] [2020-09-04 13:46:18,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:18,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:46:18,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134713607] [2020-09-04 13:46:18,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:46:18,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:46:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:46:18,391 INFO L87 Difference]: Start difference. First operand 341 states and 437 transitions. Second operand 9 states. [2020-09-04 13:46:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:21,429 INFO L93 Difference]: Finished difference Result 1164 states and 1617 transitions. [2020-09-04 13:46:21,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 13:46:21,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-09-04 13:46:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:21,436 INFO L225 Difference]: With dead ends: 1164 [2020-09-04 13:46:21,436 INFO L226 Difference]: Without dead ends: 840 [2020-09-04 13:46:21,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2020-09-04 13:46:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-09-04 13:46:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 643. [2020-09-04 13:46:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-09-04 13:46:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 815 transitions. [2020-09-04 13:46:21,510 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 815 transitions. Word has length 66 [2020-09-04 13:46:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:21,511 INFO L479 AbstractCegarLoop]: Abstraction has 643 states and 815 transitions. [2020-09-04 13:46:21,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:46:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 815 transitions. [2020-09-04 13:46:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 13:46:21,512 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:21,512 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-09-04 13:46:21,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:46:21,513 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:21,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:21,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2020-09-04 13:46:21,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:21,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930446611] [2020-09-04 13:46:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:21,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:21,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:21,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:21,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:21,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:46:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:21,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:21,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:21,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930446611] [2020-09-04 13:46:21,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:21,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:46:21,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288916621] [2020-09-04 13:46:21,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:46:21,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:21,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:46:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:46:21,734 INFO L87 Difference]: Start difference. First operand 643 states and 815 transitions. Second operand 9 states. [2020-09-04 13:46:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:22,754 INFO L93 Difference]: Finished difference Result 1352 states and 1804 transitions. [2020-09-04 13:46:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:46:22,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-09-04 13:46:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:22,761 INFO L225 Difference]: With dead ends: 1352 [2020-09-04 13:46:22,761 INFO L226 Difference]: Without dead ends: 764 [2020-09-04 13:46:22,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:46:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-09-04 13:46:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 669. [2020-09-04 13:46:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-09-04 13:46:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 834 transitions. [2020-09-04 13:46:22,848 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 834 transitions. Word has length 66 [2020-09-04 13:46:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:22,848 INFO L479 AbstractCegarLoop]: Abstraction has 669 states and 834 transitions. [2020-09-04 13:46:22,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:46:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 834 transitions. [2020-09-04 13:46:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 13:46:22,849 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:22,850 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-09-04 13:46:22,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:46:22,850 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2020-09-04 13:46:22,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:22,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473904857] [2020-09-04 13:46:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:22,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:22,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:23,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:23,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:23,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:46:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:23,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:23,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:23,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473904857] [2020-09-04 13:46:23,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:23,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:46:23,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572301296] [2020-09-04 13:46:23,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:46:23,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:23,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:46:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:46:23,038 INFO L87 Difference]: Start difference. First operand 669 states and 834 transitions. Second operand 6 states. [2020-09-04 13:46:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:23,946 INFO L93 Difference]: Finished difference Result 1262 states and 1648 transitions. [2020-09-04 13:46:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:46:23,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-09-04 13:46:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:23,954 INFO L225 Difference]: With dead ends: 1262 [2020-09-04 13:46:23,955 INFO L226 Difference]: Without dead ends: 814 [2020-09-04 13:46:23,958 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:46:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2020-09-04 13:46:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 708. [2020-09-04 13:46:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2020-09-04 13:46:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 908 transitions. [2020-09-04 13:46:24,059 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 908 transitions. Word has length 66 [2020-09-04 13:46:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:24,060 INFO L479 AbstractCegarLoop]: Abstraction has 708 states and 908 transitions. [2020-09-04 13:46:24,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:46:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 908 transitions. [2020-09-04 13:46:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 13:46:24,062 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:24,063 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-09-04 13:46:24,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:46:24,063 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:24,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:24,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1757954899, now seen corresponding path program 1 times [2020-09-04 13:46:24,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:24,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709465117] [2020-09-04 13:46:24,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 13:46:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 13:46:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 13:46:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:46:24,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709465117] [2020-09-04 13:46:24,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746532971] [2020-09-04 13:46:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:46:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:24,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:46:24,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:46:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:24,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:46:24,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-09-04 13:46:24,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034820337] [2020-09-04 13:46:24,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:46:24,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:24,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:46:24,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:46:24,492 INFO L87 Difference]: Start difference. First operand 708 states and 908 transitions. Second operand 3 states. [2020-09-04 13:46:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:24,653 INFO L93 Difference]: Finished difference Result 1674 states and 2250 transitions. [2020-09-04 13:46:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:46:24,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-09-04 13:46:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:24,659 INFO L225 Difference]: With dead ends: 1674 [2020-09-04 13:46:24,660 INFO L226 Difference]: Without dead ends: 812 [2020-09-04 13:46:24,664 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-09-04 13:46:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-09-04 13:46:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-09-04 13:46:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-09-04 13:46:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1048 transitions. [2020-09-04 13:46:24,769 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1048 transitions. Word has length 86 [2020-09-04 13:46:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:24,769 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 1048 transitions. [2020-09-04 13:46:24,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:46:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1048 transitions. [2020-09-04 13:46:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-09-04 13:46:24,772 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:24,773 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-09-04 13:46:24,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-09-04 13:46:24,988 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:24,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash -232030383, now seen corresponding path program 1 times [2020-09-04 13:46:24,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:24,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13726748] [2020-09-04 13:46:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:46:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:46:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:46:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 13:46:25,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13726748] [2020-09-04 13:46:25,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:25,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 13:46:25,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466620444] [2020-09-04 13:46:25,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:46:25,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:46:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:46:25,269 INFO L87 Difference]: Start difference. First operand 812 states and 1048 transitions. Second operand 8 states. [2020-09-04 13:46:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:26,277 INFO L93 Difference]: Finished difference Result 962 states and 1270 transitions. [2020-09-04 13:46:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:46:26,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2020-09-04 13:46:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:26,284 INFO L225 Difference]: With dead ends: 962 [2020-09-04 13:46:26,284 INFO L226 Difference]: Without dead ends: 959 [2020-09-04 13:46:26,285 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-09-04 13:46:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-09-04 13:46:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 820. [2020-09-04 13:46:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-09-04 13:46:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1043 transitions. [2020-09-04 13:46:26,391 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1043 transitions. Word has length 98 [2020-09-04 13:46:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:26,392 INFO L479 AbstractCegarLoop]: Abstraction has 820 states and 1043 transitions. [2020-09-04 13:46:26,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:46:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1043 transitions. [2020-09-04 13:46:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-04 13:46:26,394 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:26,395 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-09-04 13:46:26,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:46:26,395 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:26,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-09-04 13:46:26,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:26,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050898997] [2020-09-04 13:46:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:46:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:46:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:46:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 13:46:26,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050898997] [2020-09-04 13:46:26,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529959124] [2020-09-04 13:46:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:46:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:26,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2020-09-04 13:46:26,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:46:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:46:26,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:46:26,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-09-04 13:46:26,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406452951] [2020-09-04 13:46:26,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:46:26,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:26,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:46:26,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:46:26,933 INFO L87 Difference]: Start difference. First operand 820 states and 1043 transitions. Second operand 16 states. [2020-09-04 13:46:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:31,918 INFO L93 Difference]: Finished difference Result 2540 states and 3915 transitions. [2020-09-04 13:46:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-09-04 13:46:31,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2020-09-04 13:46:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:31,939 INFO L225 Difference]: With dead ends: 2540 [2020-09-04 13:46:31,939 INFO L226 Difference]: Without dead ends: 2537 [2020-09-04 13:46:31,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 13:46:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2020-09-04 13:46:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2338. [2020-09-04 13:46:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-09-04 13:46:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3577 transitions. [2020-09-04 13:46:32,381 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3577 transitions. Word has length 99 [2020-09-04 13:46:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:32,382 INFO L479 AbstractCegarLoop]: Abstraction has 2338 states and 3577 transitions. [2020-09-04 13:46:32,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:46:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3577 transitions. [2020-09-04 13:46:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-09-04 13:46:32,393 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:32,394 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-09-04 13:46:32,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-09-04 13:46:32,609 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-09-04 13:46:32,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:32,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749814518] [2020-09-04 13:46:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:46:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:46:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:46:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 13:46:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-09-04 13:46:32,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749814518] [2020-09-04 13:46:32,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:46:32,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:46:32,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224429314] [2020-09-04 13:46:32,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:46:32,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:32,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:46:32,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:46:32,859 INFO L87 Difference]: Start difference. First operand 2338 states and 3577 transitions. Second operand 7 states. [2020-09-04 13:46:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:34,089 INFO L93 Difference]: Finished difference Result 3773 states and 6055 transitions. [2020-09-04 13:46:34,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:46:34,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2020-09-04 13:46:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:34,107 INFO L225 Difference]: With dead ends: 3773 [2020-09-04 13:46:34,107 INFO L226 Difference]: Without dead ends: 2107 [2020-09-04 13:46:34,127 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-09-04 13:46:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2020-09-04 13:46:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2006. [2020-09-04 13:46:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2020-09-04 13:46:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2998 transitions. [2020-09-04 13:46:34,467 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2998 transitions. Word has length 125 [2020-09-04 13:46:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:34,468 INFO L479 AbstractCegarLoop]: Abstraction has 2006 states and 2998 transitions. [2020-09-04 13:46:34,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:46:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2998 transitions. [2020-09-04 13:46:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-09-04 13:46:34,475 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:46:34,475 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-09-04 13:46:34,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:46:34,476 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:46:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:46:34,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2020-09-04 13:46:34,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:46:34,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896769848] [2020-09-04 13:46:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:46:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:46:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:46:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:46:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:46:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:46:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:46:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 13:46:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 13:46:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:46:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 13:46:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:46:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:46:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-09-04 13:46:34,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896769848] [2020-09-04 13:46:34,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567252386] [2020-09-04 13:46:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:46:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:46:34,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:46:34,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:46:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-09-04 13:46:34,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:46:34,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-09-04 13:46:34,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049609394] [2020-09-04 13:46:34,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:46:34,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:46:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:46:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:46:34,964 INFO L87 Difference]: Start difference. First operand 2006 states and 2998 transitions. Second operand 3 states. [2020-09-04 13:46:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:46:35,052 INFO L93 Difference]: Finished difference Result 2401 states and 3609 transitions. [2020-09-04 13:46:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:46:35,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-09-04 13:46:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:46:35,054 INFO L225 Difference]: With dead ends: 2401 [2020-09-04 13:46:35,054 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:46:35,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:46:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:46:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:46:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:46:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:46:35,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-09-04 13:46:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:46:35,070 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:46:35,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:46:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:46:35,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:46:35,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-09-04 13:46:35,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:46:35,853 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2020-09-04 13:46:35,990 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:36,139 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-09-04 13:46:36,251 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-09-04 13:46:36,528 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2020-09-04 13:46:36,656 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:36,949 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-09-04 13:46:37,186 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-09-04 13:46:37,297 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2020-09-04 13:46:37,428 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-09-04 13:46:37,561 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2020-09-04 13:46:37,692 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2020-09-04 13:46:37,820 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-09-04 13:46:38,168 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2020-09-04 13:46:38,313 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2020-09-04 13:46:39,029 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:39,446 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2020-09-04 13:46:39,569 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:39,965 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2020-09-04 13:46:40,139 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-09-04 13:46:41,700 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-09-04 13:46:41,933 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2020-09-04 13:46:42,139 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 67 [2020-09-04 13:46:42,259 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2020-09-04 13:46:42,447 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-09-04 13:46:42,643 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-09-04 13:46:42,745 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2020-09-04 13:46:42,984 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2020-09-04 13:46:43,135 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2020-09-04 13:46:43,240 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2020-09-04 13:46:43,395 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2020-09-04 13:46:43,499 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2020-09-04 13:46:43,653 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2020-09-04 13:46:44,214 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:44,388 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:44,914 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:45,271 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-09-04 13:46:45,607 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:45,720 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:46,081 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:46,558 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:46,852 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-09-04 13:46:47,130 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:47,336 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-09-04 13:46:48,013 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:48,480 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:48,653 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:49,201 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:49,829 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:49,940 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:50,293 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:50,766 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:51,261 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:52,080 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:52,476 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 112 [2020-09-04 13:46:52,626 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2020-09-04 13:46:52,773 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 67 [2020-09-04 13:46:52,933 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2020-09-04 13:46:53,155 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-09-04 13:46:53,331 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 108 [2020-09-04 13:46:53,483 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-09-04 13:46:53,680 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2020-09-04 13:46:53,830 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 103 [2020-09-04 13:46:53,937 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2020-09-04 13:46:54,091 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2020-09-04 13:46:54,248 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-09-04 13:46:54,459 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 114 [2020-09-04 13:46:55,744 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:55,939 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:46:56,303 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2020-09-04 13:46:56,517 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2020-09-04 13:46:56,723 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2020-09-04 13:46:57,031 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2020-09-04 13:46:57,232 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2020-09-04 13:46:57,435 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2020-09-04 13:46:57,643 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2020-09-04 13:46:57,927 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2020-09-04 13:46:58,042 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 49 [2020-09-04 13:46:58,156 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 49 [2020-09-04 13:46:58,285 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2020-09-04 13:46:58,600 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 99 [2020-09-04 13:46:58,969 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2020-09-04 13:46:59,233 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 99 [2020-09-04 13:46:59,560 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2020-09-04 13:46:59,874 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2020-09-04 13:47:00,146 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 99 [2020-09-04 13:47:00,418 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 99 [2020-09-04 13:47:00,686 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 99 [2020-09-04 13:47:00,843 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2020-09-04 13:47:01,033 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 67 [2020-09-04 13:47:01,139 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2020-09-04 13:47:01,306 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-09-04 13:47:01,479 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-09-04 13:47:01,793 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2020-09-04 13:47:01,942 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2020-09-04 13:47:02,048 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2020-09-04 13:47:02,203 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2020-09-04 13:47:02,307 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2020-09-04 13:47:02,462 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2020-09-04 13:47:03,026 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:47:03,451 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2020-09-04 13:47:03,563 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2020-09-04 13:47:05,814 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2020-09-04 13:47:06,192 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2020-09-04 13:47:06,646 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 103 [2020-09-04 13:47:07,019 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 106 [2020-09-04 13:47:07,304 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2020-09-04 13:47:07,439 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-09-04 13:47:07,725 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2020-09-04 13:47:08,039 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2020-09-04 13:47:08,549 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2020-09-04 13:47:08,798 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2020-09-04 13:47:09,082 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2020-09-04 13:47:09,460 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2020-09-04 13:47:09,836 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2020-09-04 13:47:10,068 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2020-09-04 13:47:10,418 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-09-04 13:47:11,690 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-09-04 13:47:11,800 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-09-04 13:47:13,097 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-09-04 13:47:13,468 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 79 [2020-09-04 13:47:13,616 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-09-04 13:47:14,438 WARN L193 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 77 [2020-09-04 13:47:14,743 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-09-04 13:47:16,044 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 150 DAG size of output: 74 [2020-09-04 13:47:16,951 WARN L193 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2020-09-04 13:47:17,701 WARN L193 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2020-09-04 13:47:18,050 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 35 [2020-09-04 13:47:19,329 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-09-04 13:47:19,499 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-09-04 13:47:19,686 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-09-04 13:47:23,165 WARN L193 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 215 DAG size of output: 153 [2020-09-04 13:47:23,392 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-09-04 13:47:24,099 WARN L193 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2020-09-04 13:47:24,823 WARN L193 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2020-09-04 13:47:25,198 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-09-04 13:47:25,518 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-09-04 13:47:29,188 WARN L193 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 227 DAG size of output: 156 [2020-09-04 13:47:32,300 WARN L193 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 179 DAG size of output: 134 [2020-09-04 13:47:34,209 WARN L193 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 180 DAG size of output: 114 [2020-09-04 13:47:35,336 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 149 DAG size of output: 89 [2020-09-04 13:47:35,561 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-09-04 13:47:36,746 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 187 DAG size of output: 101 [2020-09-04 13:47:40,237 WARN L193 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 215 DAG size of output: 153 [2020-09-04 13:47:40,580 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-09-04 13:47:40,943 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2020-09-04 13:47:41,075 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-09-04 13:47:41,227 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-09-04 13:47:42,037 WARN L193 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2020-09-04 13:47:42,301 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-09-04 13:47:42,892 WARN L193 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 52 [2020-09-04 13:47:46,336 WARN L193 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 195 DAG size of output: 120 [2020-09-04 13:47:47,249 WARN L193 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2020-09-04 13:47:48,850 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 193 DAG size of output: 86 [2020-09-04 13:47:48,855 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-09-04 13:47:48,855 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-09-04 13:47:48,856 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-09-04 13:47:48,856 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-09-04 13:47:48,856 INFO L271 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: true [2020-09-04 13:47:48,856 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-09-04 13:47:48,856 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-09-04 13:47:48,857 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-09-04 13:47:48,857 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (= ~p_num_write~0 0)) (not (= ~p_dw_i~0 1)) (not (= ~c_num_read~0 0)) (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_dw_st~0 0)) (not (<= ~p_dw_pc~0 0)) (not (= ~q_free~0 1)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~p_dw_st~0)| 0)) (= ~c_dr_pc~0 1) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-09-04 13:47:48,857 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-09-04 13:47:48,858 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_last_write~0 ~q_buf_0~0) (<= ~p_dw_pc~0 0) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (= |old(~p_dw_i~0)| 1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-09-04 13:47:48,858 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (not (<= |old(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (= |old(~p_dw_i~0)| 1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~c_num_read~0)| 0))) [2020-09-04 13:47:48,859 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-09-04 13:47:48,859 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-09-04 13:47:48,859 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-09-04 13:47:48,859 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (not (<= |old(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (= |old(~p_dw_i~0)| 1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~c_num_read~0)| 0))) [2020-09-04 13:47:48,860 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse10 (= ~c_dr_pc~0 1))) (let ((.cse12 (not .cse10)) (.cse13 (= ~q_free~0 0)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= ~p_dw_pc~0 1))) (let ((.cse1 (not (= |old(~q_free~0)| 1))) (.cse2 (not (<= |old(~p_dw_pc~0)| 0))) (.cse3 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (not (= ~c_num_read~0 0))) (.cse8 (and .cse13 .cse15 .cse16 .cse17 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0))) (.cse7 (not (= |old(~p_num_write~0)| 0))) (.cse9 (and .cse12 (<= 2 ~c_dr_st~0) (not (= ~p_dw_st~0 1)) .cse17 (not (= ~p_dw_st~0 ~q_free~0)) (not (= ~p_dw_pc~0 ~q_free~0)))) (.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= |old(~p_dw_pc~0)| 1))) (.cse4 (let ((.cse18 (not (= ~p_dw_i~0 1)))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse18) (or (= |old(~q_free~0)| 0) .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse1 .cse2 .cse4 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7 .cse10) (or .cse0 .cse9 .cse11 .cse4 .cse10) (or .cse12 .cse0 .cse11 .cse4 (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse13 (<= .cse14 ~p_num_write~0) .cse15 (<= ~p_num_write~0 .cse14) .cse16 .cse17)) (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse6 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))))))) [2020-09-04 13:47:48,860 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse12 (= |old(~q_free~0)| ~q_free~0)) (.cse13 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse14 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse15 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse16 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse17 (= ~p_num_write~0 |old(~p_num_write~0)|))) (let ((.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= |old(~p_dw_pc~0)| 1))) (.cse2 (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (.cse1 (not (= |old(~q_free~0)| 1))) (.cse3 (not (<= |old(~p_dw_pc~0)| 0))) (.cse4 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (let ((.cse18 (not (= ~p_dw_i~0 1)))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse18) (or (= |old(~q_free~0)| 0) .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse8 (not (= |old(~p_num_write~0)| 0))) (.cse9 (= ~c_dr_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse9) (or .cse0 .cse10 .cse5 (and .cse11 .cse12 (= ~p_dw_pc~0 1) .cse13 .cse14 .cse15 .cse16 .cse17) (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse7 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse0 .cse2 .cse10 .cse5 .cse9) (or .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-09-04 13:47:48,860 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse15 (+ |old(~p_num_write~0)| 1))) (let ((.cse1 (not (= |old(~q_free~0)| 1))) (.cse2 (not (<= |old(~p_dw_pc~0)| 0))) (.cse3 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse13 (not (= |old(~p_num_write~0)| 0))) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= ~p_dw_pc~0 0)) (.cse9 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse10 (= .cse15 ~p_num_write~0)) (.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse16 (= ~p_dw_pc~0 1)) (.cse17 (not (= |old(~p_dw_pc~0)| 1))) (.cse4 (let ((.cse18 (not (= ~p_dw_i~0 1)))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse18) (or (= |old(~q_free~0)| 0) .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse14 (= ~c_dr_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13) (or (not .cse14) .cse0 (and .cse5 .cse6 .cse8 (<= .cse15 ~p_num_write~0) .cse16 .cse9 (<= ~p_num_write~0 .cse15)) .cse17 .cse4 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse12 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse0 .cse1 .cse2 (and .cse6 .cse7 .cse9) .cse4 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse10) .cse14) (or .cse0 (and (<= 2 ~c_dr_st~0) .cse16) .cse17 .cse4 .cse14)))) [2020-09-04 13:47:48,860 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-09-04 13:47:48,861 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-09-04 13:47:48,861 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-09-04 13:47:48,861 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse17 (= ~p_dw_i~0 1))) (let ((.cse8 (not (= |old(~q_free~0)| 1))) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse9 (not (<= |old(~p_dw_pc~0)| 0))) (.cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse12 (not (= ~c_num_read~0 0))) (.cse14 (not (= |old(~p_num_write~0)| 0))) (.cse1 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= |old(~q_free~0)| ~q_free~0)) (.cse20 (= ~p_dw_pc~0 1)) (.cse4 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse6 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse7 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse18 (not (= ~q_free~0 0))) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (not (<= 2 |old(~c_dr_st~0)|))) (.cse19 (not (= |old(~p_dw_pc~0)| 1))) (.cse11 (let ((.cse21 (not .cse17))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse21) (or (= |old(~q_free~0)| 0) .cse21 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse13 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse8 .cse9 (and .cse1 (<= ~p_dw_pc~0 0) .cse4 .cse17 .cse18) .cse11 .cse15) (or .cse16 .cse8 (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse7) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse16 .cse19 .cse11 (and (<= 2 ~c_dr_st~0) .cse20 .cse17 .cse18) .cse15) (or (and .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18) (not .cse15) .cse16 .cse19 .cse11 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse13 (not (<= ~c_num_read~0 |old(~p_num_write~0)|)))))) [2020-09-04 13:47:48,861 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse20 (= ~p_dw_i~0 1)) (.cse8 (= ~q_free~0 0)) (.cse17 (+ |old(~p_num_write~0)| 1))) (let ((.cse13 (= .cse17 ~p_num_write~0)) (.cse0 (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse9 (= |old(~q_free~0)| ~q_free~0) .cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) .cse20 (= ~p_num_write~0 |old(~p_num_write~0)|) (not .cse8))) (.cse3 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (not (= ~c_num_read~0 0))) (.cse7 (not (= |old(~p_num_write~0)| 0))) (.cse1 (not (= |old(~q_free~0)| 1))) (.cse2 (not (<= |old(~p_dw_pc~0)| 0))) (.cse11 (<= ~p_dw_pc~0 0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not (<= 2 |old(~c_dr_st~0)|))) (.cse18 (= ~p_dw_pc~0 1)) (.cse16 (not (= |old(~p_dw_pc~0)| 1))) (.cse4 (let ((.cse19 (not .cse20))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse19) (or (= |old(~q_free~0)| 0) .cse19 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse14 (= ~c_dr_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 (and .cse8 .cse10 .cse11 .cse13) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse15 .cse1 .cse2 (and .cse9 .cse11 .cse12) .cse4 .cse14) (or (not .cse14) .cse15 .cse16 (and .cse8 .cse10 (<= .cse17 ~p_num_write~0) .cse18 (<= ~p_num_write~0 .cse17)) .cse4 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse6 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse15 (and (<= 2 ~c_dr_st~0) .cse18) .cse16 .cse4 .cse14)))) [2020-09-04 13:47:48,861 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-09-04 13:47:48,861 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-09-04 13:47:48,862 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-09-04 13:47:48,862 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-09-04 13:47:48,862 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-09-04 13:47:48,862 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse2 (not (= ~c_num_read~0 0))) (.cse6 (not (= ~p_num_write~0 1))) (.cse3 (not (<= ~p_dw_pc~0 0))) (.cse5 (= ~c_dr_pc~0 1)) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~p_dw_st~0)| ~p_dw_st~0))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~p_dw_pc~0 1))) (.cse7 (not (= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse9 (not (= ~c_num_read~0 1)) .cse10 .cse4 .cse11 .cse12 .cse6) (or .cse0 .cse8 .cse1 .cse11 .cse5) (or .cse0 .cse8 .cse1 .cse3 .cse5) (or (not .cse5) .cse0 (not (<= ~c_num_read~0 ~p_num_write~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) .cse1 .cse9 .cse10 .cse4 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse8 .cse1 (not (<= ~p_num_write~0 .cse13)) (not (<= .cse13 ~p_num_write~0)) .cse4 .cse11 .cse7)))) [2020-09-04 13:47:48,862 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-09-04 13:47:48,862 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-09-04 13:47:48,863 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-09-04 13:47:48,863 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-09-04 13:47:48,863 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-09-04 13:47:48,863 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse2 (not (= ~c_num_read~0 0))) (.cse6 (not (= ~p_num_write~0 1))) (.cse3 (not (<= ~p_dw_pc~0 0))) (.cse5 (= ~c_dr_pc~0 1)) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~p_dw_st~0)| ~p_dw_st~0))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~p_dw_pc~0 1))) (.cse7 (not (= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse9 (not (= ~c_num_read~0 1)) .cse10 .cse4 .cse11 .cse12 .cse6) (or .cse0 .cse8 .cse1 .cse11 .cse5) (or .cse0 .cse8 .cse1 .cse3 .cse5) (or (not .cse5) .cse0 (not (<= ~c_num_read~0 ~p_num_write~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) .cse1 .cse9 .cse10 .cse4 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse8 .cse1 (not (<= ~p_num_write~0 .cse13)) (not (<= .cse13 ~p_num_write~0)) .cse4 .cse11 .cse7)))) [2020-09-04 13:47:48,863 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse16 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse17 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (= ~p_dw_st~0 0))) (let ((.cse9 (not (<= 2 |old(~c_dr_st~0)|))) (.cse12 (and (<= 2 ~c_dr_st~0) (or (and .cse16 .cse17) .cse1))) (.cse13 (not (= ~c_num_read~0 0))) (.cse10 (not (<= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_num_write~0 1))) (.cse14 (not (= ~q_free~0 0))) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (and .cse16 .cse17 (<= immediate_notify_threads_~tmp~0 0) (<= 0 immediate_notify_threads_~tmp~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= ~q_free~0 1))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~p_dw_pc~0 1))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~c_num_read~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse2 .cse10 .cse11) (or .cse9 .cse2 .cse12 .cse6 .cse11) (or .cse9 .cse0 .cse2 .cse13 .cse10 .cse5 .cse8 .cse14) (let ((.cse15 (+ ~c_num_read~0 1))) (or .cse9 .cse2 (not (<= ~p_num_write~0 .cse15)) (not (<= .cse15 ~p_num_write~0)) .cse5 .cse12 .cse6 .cse14)) (or .cse0 .cse2 .cse13 .cse10 .cse5 .cse11 .cse8 .cse14) (or (not .cse11) .cse0 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse1 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-09-04 13:47:48,864 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-09-04 13:47:48,864 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:47:48,864 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_free~0 |old(~q_free~0)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_num_read~0 |old(~c_num_read~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~p_dw_st~0 |old(~p_dw_st~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~c_dr_i~0 |old(~c_dr_i~0)|)) [2020-09-04 13:47:48,864 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:47:48,864 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse41 (= ~p_dw_i~0 1))) (let ((.cse38 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse39 (not (<= 1 |old(~q_free~0)|))) (.cse37 (not .cse41)) (.cse40 (<= 1 ~q_free~0)) (.cse28 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse29 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse30 (= ~a_t~0 |old(~a_t~0)|)) (.cse3 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse31 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse33 (= ~p_dw_st~0 0)) (.cse32 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse34 (= |old(~q_free~0)| ~q_free~0)) (.cse5 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse42 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse43 (= |old(~q_free~0)| 0))) (let ((.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse26 (not (= |old(~p_num_write~0)| 0))) (.cse22 (not (= |old(~q_free~0)| 1))) (.cse23 (not (<= |old(~p_dw_pc~0)| 0))) (.cse2 (= |old(~c_dr_pc~0)| 1)) (.cse17 (not .cse43)) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse21 (= ~c_num_read~0 0)) (.cse27 (not (= |old(~c_num_read~0)| 0))) (.cse19 (or (and .cse28 .cse29 .cse30 .cse40 .cse3 .cse31 .cse33 .cse32 .cse34 .cse5 .cse41) (and .cse28 .cse29 .cse30 .cse3 .cse31 .cse33 .cse32 .cse34 .cse5 .cse41 .cse42 (not (= ~q_free~0 0))))) (.cse24 (let ((.cse44 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse43 .cse37 .cse38 .cse44) (or .cse39 .cse37 .cse44)))) (.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse6 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse8 (or (and .cse28 .cse30 .cse40 .cse31 .cse32 .cse34 .cse41) (and .cse28 .cse30 .cse31 .cse32 .cse34 (not (= ~p_dw_st~0 ~q_free~0)) .cse41 .cse42))) (.cse10 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse11 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse1 (not (= |old(~p_dw_pc~0)| 1))) (.cse16 (not (<= 2 |old(~p_dw_st~0)|))) (.cse35 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse18 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse37 .cse38) (or .cse39 .cse37))) (.cse36 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 (= |old(~p_dw_st~0)| 1) .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (let ((.cse15 (+ |old(~c_num_read~0)| 1))) (or (not .cse2) (let ((.cse13 (+ ~c_num_read~0 1))) (and .cse3 (<= .cse13 ~p_num_write~0) (<= ~p_num_write~0 .cse13) .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11)) .cse1 (not (<= .cse15 |old(~p_num_write~0)|)) .cse16 .cse17 .cse18 (not (<= |old(~p_num_write~0)| .cse15)) .cse12)) (or (and .cse19 .cse20 .cse7 .cse9 .cse21 .cse11) .cse22 .cse23 .cse24 .cse2 .cse25 .cse18 .cse26 .cse27) (or .cse0 (and .cse28 .cse29 .cse30 .cse3 .cse31 .cse32 .cse7 .cse6 .cse33 .cse34 .cse20 .cse9 .cse11) .cse22 .cse23 .cse24 .cse25 .cse18 .cse26 .cse27) (or .cse0 .cse22 .cse23 .cse24 (and .cse19 .cse6 .cse7 .cse9 .cse10 .cse11) .cse2) (or .cse1 .cse16 (not (= |old(~p_num_write~0)| 1)) .cse17 (and .cse3 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse21 .cse11) .cse18 .cse12 .cse27) (or .cse0 (and .cse19 .cse14 .cse6 .cse7 .cse10 .cse11) .cse24 .cse1 .cse35 .cse18 .cse36) (or .cse0 (and .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) .cse1 .cse16 .cse35 .cse18 .cse12 .cse36))))) [2020-09-04 13:47:48,865 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse36 (= ~p_dw_i~0 1))) (let ((.cse35 (= ~p_dw_pc~0 1)) (.cse37 (not (= ~q_free~0 0))) (.cse38 (+ |old(~c_num_read~0)| 1)) (.cse19 (= |old(~c_dr_pc~0)| 1)) (.cse39 (= |old(~q_free~0)| 0)) (.cse32 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse33 (not (<= 1 |old(~q_free~0)|))) (.cse31 (not .cse36)) (.cse29 (<= 2 ~c_dr_st~0)) (.cse23 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse27 (= ~c_num_read~0 0)) (.cse34 (= ~c_dr_pc~0 1))) (let ((.cse0 (and .cse29 .cse23 (<= ~p_dw_pc~0 0) .cse25 (= ~q_free~0 1) .cse28 .cse27 .cse34)) (.cse6 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (not (= |old(~p_num_write~0)| 0))) (.cse10 (not (= |old(~c_num_read~0)| 0))) (.cse2 (not (= |old(~q_free~0)| 1))) (.cse5 (not (<= |old(~p_dw_pc~0)| 0))) (.cse20 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse21 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse22 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse24 (= |old(~q_free~0)| ~q_free~0)) (.cse26 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse3 (let ((.cse40 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse39 .cse31 .cse32 .cse40) (or .cse33 .cse31 .cse40)))) (.cse15 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse16 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse4 (not .cse19)) (.cse17 (not (<= .cse38 |old(~p_num_write~0)|))) (.cse12 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (and .cse29 (<= ~p_num_write~0 ~c_num_read~0) .cse23 .cse35 .cse36 (<= ~c_num_read~0 ~p_num_write~0) .cse37 .cse34)) (.cse13 (not .cse39)) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse18 (not (<= |old(~p_num_write~0)| .cse38))) (.cse1 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= |old(~p_dw_pc~0)| 1))) (.cse30 (and .cse29 (not .cse34) .cse35 .cse36 .cse37)) (.cse14 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse31 .cse32) (or .cse33 .cse31)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse7 (not (= |old(~p_num_write~0)| 1)) .cse13 .cse8 .cse14 .cse10) (or .cse1 .cse4 .cse11 .cse12 .cse15 .cse8 .cse14 .cse16) (or .cse1 .cse4 .cse11 .cse17 .cse12 .cse13 .cse8 .cse18 .cse14) (or .cse0 .cse2 .cse3 .cse5 .cse19 .cse6 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse5 .cse3 .cse19 (and .cse29 .cse20 .cse21 .cse22 .cse24 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse26 .cse28) .cse30) (or .cse1 .cse4 .cse3 .cse11 .cse7 .cse15 .cse8 .cse16) (or .cse4 .cse11 .cse17 .cse12 .cse7 .cse13 .cse8 .cse18 .cse14) (or .cse1 .cse11 (= |old(~p_dw_st~0)| 1) .cse19 .cse30 .cse14))))) [2020-09-04 13:47:48,865 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-09-04 13:47:48,865 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-09-04 13:47:48,865 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-09-04 13:47:48,866 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse54 (+ ~c_num_read~0 1)) (.cse35 (= ~q_free~0 0)) (.cse55 (<= 1 ~q_free~0)) (.cse56 (= ~p_dw_i~0 1))) (let ((.cse51 (+ |old(~c_num_read~0)| 1)) (.cse34 (= |old(~c_dr_pc~0)| 1)) (.cse45 (not (= ~p_dw_st~0 1))) (.cse52 (= |old(~q_free~0)| 0)) (.cse49 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse50 (not (<= 1 |old(~q_free~0)|))) (.cse48 (not .cse56)) (.cse37 (<= 2 ~c_dr_st~0)) (.cse46 (<= ~p_num_write~0 ~c_num_read~0)) (.cse30 (let ((.cse57 (= ~p_dw_st~0 0))) (or (and .cse57 .cse56 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse35)) (and .cse55 .cse57 .cse56)))) (.cse44 (<= ~c_num_read~0 ~p_num_write~0)) (.cse47 (<= .cse54 ~p_num_write~0)) (.cse36 (<= 2 ~p_dw_st~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse43 (or (and .cse55 .cse56) (and (not (= ~p_dw_st~0 ~q_free~0)) .cse56))) (.cse27 (= ~c_dr_pc~0 1))) (let ((.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (not (= |old(~p_num_write~0)| 0))) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_num_read~0 0)) (.cse8 (not (= |old(~c_num_read~0)| 0))) (.cse0 (and .cse35 .cse47 .cse36 (<= ~p_num_write~0 .cse54) .cse17 .cse19 .cse43 .cse27)) (.cse1 (and .cse37 .cse46 .cse17 .cse19 .cse30 .cse44 .cse27)) (.cse3 (and .cse37 .cse46 .cse36 .cse17 .cse19 .cse43 .cse44 .cse27)) (.cse23 (not (= |old(~q_free~0)| 1))) (.cse33 (not (<= |old(~p_dw_pc~0)| 0))) (.cse31 (let ((.cse53 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse52 .cse48 .cse49 .cse53) (or .cse50 .cse48 .cse53)))) (.cse26 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse13 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse28 (<= ~p_dw_pc~0 0)) (.cse42 (and (not .cse27) .cse37 .cse45 .cse19 .cse43)) (.cse18 (= |old(~q_free~0)| ~q_free~0)) (.cse40 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse41 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse22 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse12 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse14 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse20 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse32 (not .cse34)) (.cse2 (not (= |old(~p_dw_pc~0)| 1))) (.cse38 (not (<= .cse51 |old(~p_num_write~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not .cse52)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse39 (not (<= |old(~p_num_write~0)| .cse51))) (.cse7 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse48 .cse49) (or .cse50 .cse48)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~p_num_write~0)| 1)) .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or .cse0 .cse22 .cse23 .cse3 .cse24 .cse6 .cse25 (and .cse10 .cse26 .cse11 .cse12 .cse15 .cse16 .cse27 .cse28 .cse17 .cse18 .cse29 .cse20 .cse30 .cse21) .cse1 .cse31 .cse32 .cse33 .cse8) (or .cse0 .cse23 .cse3 .cse34 .cse24 (and .cse35 .cse36 .cse17 .cse19 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse16) .cse6 .cse25 (and .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse18 .cse29 .cse20 .cse30 .cse21) .cse1 .cse31 .cse33 (and .cse37 .cse17 .cse28 .cse29 (= ~q_free~0 1) .cse30 .cse21 .cse16 .cse27) .cse8) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse39 .cse7) (or .cse0 .cse22 .cse1 .cse32 .cse31 .cse2 .cse3 .cse40 .cse6 .cse41) (or .cse22 .cse23 .cse33 .cse42 .cse31 .cse34 (and .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse15 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse28 .cse18 .cse20 .cse30 .cse21)) (or .cse22 .cse42 .cse2 (= |old(~p_dw_st~0)| 1) .cse34 .cse7) (or .cse22 .cse32 .cse2 .cse4 (and .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse43 .cse44 .cse27 .cse37 .cse45 .cse46 .cse17 .cse19 .cse18 .cse20 .cse21) .cse40 .cse6 .cse7 .cse41) (or .cse22 (and .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse43 .cse27 .cse37 .cse47 .cse45 .cse17 .cse19 .cse20 .cse21) .cse32 .cse2 .cse38 .cse4 .cse5 .cse6 .cse39 .cse7))))) [2020-09-04 13:47:48,866 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse36 (= ~p_dw_i~0 1))) (let ((.cse33 (+ |old(~c_num_read~0)| 1)) (.cse22 (= ~q_free~0 0)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= ~p_dw_pc~0 1)) (.cse19 (= |old(~c_dr_pc~0)| 1)) (.cse34 (= |old(~q_free~0)| 0)) (.cse31 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse32 (not (<= 1 |old(~q_free~0)|))) (.cse30 (not .cse36))) (let ((.cse3 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse4 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse7 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse8 (= |old(~q_free~0)| ~q_free~0)) (.cse9 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse26 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse27 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse16 (not (= |old(~q_free~0)| 1))) (.cse17 (not (<= |old(~p_dw_pc~0)| 0))) (.cse18 (let ((.cse37 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse34 .cse30 .cse31 .cse37) (or .cse32 .cse30 .cse37)))) (.cse20 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse24 (not (= |old(~p_num_write~0)| 0))) (.cse14 (not (= |old(~c_num_read~0)| 0))) (.cse25 (not .cse19)) (.cse1 (let ((.cse35 (+ ~c_num_read~0 1))) (and .cse22 (<= .cse35 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse35) .cse6 .cse23 .cse36 (= ~c_dr_pc~0 1)))) (.cse28 (not (<= .cse33 |old(~p_num_write~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not .cse34)) (.cse12 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse29 (not (<= |old(~p_num_write~0)| .cse33))) (.cse15 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= |old(~p_dw_pc~0)| 1))) (.cse13 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse30 .cse31) (or .cse32 .cse30)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~p_num_write~0)| 1)) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse9 .cse10) .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse21 (= ~c_num_read~0 0))) (or .cse16 .cse18 .cse17 .cse19 .cse1 .cse20 (and .cse3 .cse4 (= ~p_dw_st~0 0) .cse7 .cse6 .cse8 (= ~c_last_read~0 ~p_last_write~0) .cse9 .cse21 .cse10) (and .cse22 .cse5 .cse6 .cse23 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse21) .cse12 .cse24 .cse14)) (or .cse15 .cse25 .cse0 .cse2 .cse26 .cse12 .cse13 .cse27) (or .cse15 .cse25 .cse0 .cse28 .cse2 .cse11 .cse12 .cse29 .cse13) (or .cse15 .cse18 .cse0 .cse1 .cse26 .cse12 .cse27) (or .cse15 .cse16 .cse17 .cse18 .cse1 .cse20 .cse12 .cse24 .cse14) (or .cse25 .cse0 .cse1 .cse28 .cse2 .cse11 .cse12 .cse29 .cse13) (or .cse15 .cse0 (= |old(~p_dw_st~0)| 1) .cse19 .cse13))))) [2020-09-04 13:47:48,866 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-09-04 13:47:48,866 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-09-04 13:47:48,866 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-09-04 13:47:48,867 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse43 (= ~q_free~0 0)) (.cse56 (<= 1 ~q_free~0)) (.cse14 (= ~p_dw_i~0 1))) (let ((.cse50 (<= ~p_num_write~0 ~c_num_read~0)) (.cse34 (let ((.cse57 (= ~p_dw_st~0 0))) (or (and .cse57 .cse14 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse43)) (and .cse56 .cse57 .cse14)))) (.cse52 (<= ~c_num_read~0 ~p_num_write~0)) (.cse44 (<= 2 ~p_dw_st~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (<= 2 ~c_dr_st~0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse51 (or (and .cse56 .cse14) (and (not (= ~p_dw_st~0 ~q_free~0)) .cse14))) (.cse49 (= |old(~q_free~0)| 0)) (.cse47 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse48 (not (<= 1 |old(~q_free~0)|))) (.cse46 (not .cse14)) (.cse42 (= |old(~c_dr_pc~0)| 1)) (.cse55 (+ |old(~c_num_read~0)| 1))) (let ((.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse29 (not (= |old(~p_num_write~0)| 0))) (.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse31 (= ~c_num_read~0 0)) (.cse3 (not (<= .cse55 |old(~p_num_write~0)|))) (.cse23 (not (<= |old(~p_num_write~0)| .cse55))) (.cse1 (not .cse42)) (.cse40 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse41 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse26 (not (= |old(~q_free~0)| 1))) (.cse37 (not (<= |old(~p_dw_pc~0)| 0))) (.cse36 (let ((.cse54 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse49 .cse46 .cse47 .cse54) (or .cse48 .cse46 .cse54)))) (.cse30 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse32 (<= ~p_dw_pc~0 0)) (.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse45 (and (not .cse15) .cse16 (not (= ~p_dw_st~0 1)) .cse19 .cse51)) (.cse25 (let ((.cse53 (+ ~c_num_read~0 1))) (and .cse43 (<= .cse53 ~p_num_write~0) .cse44 (<= ~p_num_write~0 .cse53) .cse17 .cse19 .cse51 .cse15))) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse7 (= ~a_t~0 |old(~a_t~0)|)) (.cse8 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse10 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse11 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse39 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse18 (= |old(~q_free~0)| ~q_free~0)) (.cse20 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse35 (and .cse16 .cse50 .cse17 .cse19 .cse34 .cse52 .cse15)) (.cse2 (not (= |old(~p_dw_pc~0)| 1))) (.cse27 (and .cse16 .cse50 .cse44 .cse17 .cse19 .cse51 .cse52 .cse15)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not .cse49)) (.cse22 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse24 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse46 .cse47) (or .cse48 .cse46))) (.cse38 (not (= |old(~c_num_read~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24) (or .cse25 .cse0 .cse26 .cse27 .cse28 .cse22 .cse29 (and .cse7 .cse30 .cse8 .cse9 .cse13 .cse31 .cse15 .cse17 .cse32 .cse18 .cse33 .cse20 .cse34 .cse21) .cse35 .cse36 .cse1 .cse37 .cse38) (or .cse0 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse39 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) .cse1 .cse2 .cse4 .cse40 .cse22 .cse24 .cse41) (or .cse25 .cse26 .cse27 .cse42 .cse28 (and .cse43 .cse44 .cse17 .cse19 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse31) .cse22 .cse29 (and .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse31 .cse17 .cse32 .cse18 .cse33 .cse20 .cse34 .cse21) .cse35 .cse36 .cse37 (and .cse16 .cse17 .cse32 .cse33 (= ~q_free~0 1) .cse34 .cse21 .cse31 .cse15) .cse38) (or .cse25 .cse35 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse22 .cse23 .cse24) (or .cse25 .cse0 .cse35 .cse1 .cse36 .cse2 .cse27 .cse40 .cse22 .cse41) (or .cse0 .cse26 .cse37 .cse45 .cse36 .cse42 (and .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse13 .cse39 .cse32 .cse18 .cse20 .cse34 .cse21)) (or .cse0 .cse45 .cse2 (= |old(~p_dw_st~0)| 1) .cse42 .cse24) (or .cse25 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse39 .cse19 .cse18 .cse20 .cse21) .cse35 .cse2 .cse27 .cse4 (not (= |old(~p_num_write~0)| 1)) .cse5 .cse22 .cse24 .cse38))))) [2020-09-04 13:47:48,867 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-09-04 13:47:48,868 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse54 (+ ~c_num_read~0 1)) (.cse35 (= ~q_free~0 0)) (.cse55 (<= 1 ~q_free~0)) (.cse56 (= ~p_dw_i~0 1))) (let ((.cse51 (+ |old(~c_num_read~0)| 1)) (.cse34 (= |old(~c_dr_pc~0)| 1)) (.cse45 (not (= ~p_dw_st~0 1))) (.cse52 (= |old(~q_free~0)| 0)) (.cse49 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse50 (not (<= 1 |old(~q_free~0)|))) (.cse48 (not .cse56)) (.cse37 (<= 2 ~c_dr_st~0)) (.cse46 (<= ~p_num_write~0 ~c_num_read~0)) (.cse30 (let ((.cse57 (= ~p_dw_st~0 0))) (or (and .cse57 .cse56 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse35)) (and .cse55 .cse57 .cse56)))) (.cse44 (<= ~c_num_read~0 ~p_num_write~0)) (.cse47 (<= .cse54 ~p_num_write~0)) (.cse36 (<= 2 ~p_dw_st~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse43 (or (and .cse55 .cse56) (and (not (= ~p_dw_st~0 ~q_free~0)) .cse56))) (.cse27 (= ~c_dr_pc~0 1))) (let ((.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (not (= |old(~p_num_write~0)| 0))) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_num_read~0 0)) (.cse8 (not (= |old(~c_num_read~0)| 0))) (.cse0 (and .cse35 .cse47 .cse36 (<= ~p_num_write~0 .cse54) .cse17 .cse19 .cse43 .cse27)) (.cse1 (and .cse37 .cse46 .cse17 .cse19 .cse30 .cse44 .cse27)) (.cse3 (and .cse37 .cse46 .cse36 .cse17 .cse19 .cse43 .cse44 .cse27)) (.cse23 (not (= |old(~q_free~0)| 1))) (.cse33 (not (<= |old(~p_dw_pc~0)| 0))) (.cse31 (let ((.cse53 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse52 .cse48 .cse49 .cse53) (or .cse50 .cse48 .cse53)))) (.cse26 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse13 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse28 (<= ~p_dw_pc~0 0)) (.cse42 (and (not .cse27) .cse37 .cse45 .cse19 .cse43)) (.cse18 (= |old(~q_free~0)| ~q_free~0)) (.cse40 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse41 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse22 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse12 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse14 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse20 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse32 (not .cse34)) (.cse2 (not (= |old(~p_dw_pc~0)| 1))) (.cse38 (not (<= .cse51 |old(~p_num_write~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not .cse52)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse39 (not (<= |old(~p_num_write~0)| .cse51))) (.cse7 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse48 .cse49) (or .cse50 .cse48)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~p_num_write~0)| 1)) .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or .cse0 .cse22 .cse23 .cse3 .cse24 .cse6 .cse25 (and .cse10 .cse26 .cse11 .cse12 .cse15 .cse16 .cse27 .cse28 .cse17 .cse18 .cse29 .cse20 .cse30 .cse21) .cse1 .cse31 .cse32 .cse33 .cse8) (or .cse0 .cse23 .cse3 .cse34 .cse24 (and .cse35 .cse36 .cse17 .cse19 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse16) .cse6 .cse25 (and .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse18 .cse29 .cse20 .cse30 .cse21) .cse1 .cse31 .cse33 (and .cse37 .cse17 .cse28 .cse29 (= ~q_free~0 1) .cse30 .cse21 .cse16 .cse27) .cse8) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse39 .cse7) (or .cse0 .cse22 .cse1 .cse32 .cse31 .cse2 .cse3 .cse40 .cse6 .cse41) (or .cse22 .cse23 .cse33 .cse42 .cse31 .cse34 (and .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse15 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse28 .cse18 .cse20 .cse30 .cse21)) (or .cse22 .cse42 .cse2 (= |old(~p_dw_st~0)| 1) .cse34 .cse7) (or .cse22 .cse32 .cse2 .cse4 (and .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse43 .cse44 .cse27 .cse37 .cse45 .cse46 .cse17 .cse19 .cse18 .cse20 .cse21) .cse40 .cse6 .cse7 .cse41) (or .cse22 (and .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse43 .cse27 .cse37 .cse47 .cse45 .cse17 .cse19 .cse20 .cse21) .cse32 .cse2 .cse38 .cse4 .cse5 .cse6 .cse39 .cse7))))) [2020-09-04 13:47:48,868 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-09-04 13:47:48,868 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-09-04 13:47:48,868 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-09-04 13:47:48,868 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-09-04 13:47:48,869 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-09-04 13:47:48,869 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-09-04 13:47:48,869 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-09-04 13:47:48,869 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~c_dr_st~0))) (.cse5 (not (= ~c_num_read~0 1))) (.cse6 (not (= ~q_free~0 1))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (<= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (and (<= 0 is_do_read_c_triggered_~__retres1~1) (<= is_do_read_c_triggered_~__retres1~1 0))) (.cse4 (= ~c_dr_pc~0 1)) (.cse10 (not (= ~p_num_write~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= ~p_dw_st~0 0)) .cse1 .cse5 .cse6 .cse7 .cse3 .cse8 .cse4 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse8 .cse4) (or .cse1 .cse5 .cse6 .cse7 .cse3 (not (<= 2 ~p_dw_st~0)) .cse8 .cse4 .cse9 .cse10) (or .cse1 (not (= ~c_num_read~0 0)) .cse2 .cse7 .cse3 .cse4 .cse10 (not (= ~q_free~0 0))))) [2020-09-04 13:47:48,869 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-09-04 13:47:48,869 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-09-04 13:47:48,869 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-09-04 13:47:48,870 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-09-04 13:47:48,870 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-09-04 13:47:48,870 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-09-04 13:47:48,870 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (not (= |old(~q_free~0)| 1)) (not (<= |old(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= ~p_dw_i~0 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-09-04 13:47:48,870 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-09-04 13:47:48,870 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-09-04 13:47:48,871 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse16 (= ~q_free~0 0)) (.cse19 (<= 1 ~q_free~0)) (.cse20 (= ~p_dw_i~0 1))) (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse1 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse2 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= |old(~q_free~0)| ~q_free~0)) (.cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse14 (= ~p_dw_pc~0 1)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (let ((.cse21 (= ~p_dw_st~0 0))) (or (and .cse21 .cse20 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse16)) (and .cse19 .cse21 .cse20)))) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse9 (= ~c_num_read~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (or (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (= |old(~c_dr_pc~0)| 1) (and .cse11 .cse12 .cse4 .cse14 .cse15 .cse8) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse16 .cse13 .cse4 .cse14 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse9) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (let ((.cse17 (+ ~c_num_read~0 1))) (and .cse16 (<= .cse17 ~p_num_write~0) .cse13 (<= ~p_num_write~0 .cse17) .cse4 .cse14 .cse18)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse7 .cse8 .cse10) (not (<= |old(~p_dw_pc~0)| 0)) (and (not .cse18) .cse11 (not (= ~p_dw_st~0 1)) .cse14 (or .cse19 (not (= ~p_dw_st~0 ~q_free~0)))) (and .cse11 .cse3 .cse4 .cse6 (= ~q_free~0 1) .cse8 .cse10 .cse9 .cse18) (not .cse20) (not (= |old(~c_num_read~0)| 0))))) [2020-09-04 13:47:48,871 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse16 (= ~q_free~0 0)) (.cse19 (<= 1 ~q_free~0)) (.cse20 (= ~p_dw_i~0 1))) (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse1 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse2 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= |old(~q_free~0)| ~q_free~0)) (.cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse14 (= ~p_dw_pc~0 1)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (let ((.cse21 (= ~p_dw_st~0 0))) (or (and .cse21 .cse20 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse16)) (and .cse19 .cse21 .cse20)))) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse9 (= ~c_num_read~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (or (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (= |old(~c_dr_pc~0)| 1) (and .cse11 .cse12 .cse4 .cse14 .cse15 .cse8) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse16 .cse13 .cse4 .cse14 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse9) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (let ((.cse17 (+ ~c_num_read~0 1))) (and .cse16 (<= .cse17 ~p_num_write~0) .cse13 (<= ~p_num_write~0 .cse17) .cse4 .cse14 .cse18)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse7 .cse8 .cse10) (not (<= |old(~p_dw_pc~0)| 0)) (and (not .cse18) .cse11 (not (= ~p_dw_st~0 1)) .cse14 (or .cse19 (not (= ~p_dw_st~0 ~q_free~0)))) (and .cse11 .cse3 .cse4 .cse6 (= ~q_free~0 1) .cse8 .cse10 .cse9 .cse18) (not .cse20) (not (= |old(~c_num_read~0)| 0))))) [2020-09-04 13:47:48,871 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-09-04 13:47:48,871 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-09-04 13:47:48,872 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse16 (= ~q_free~0 0)) (.cse19 (<= 1 ~q_free~0)) (.cse20 (= ~p_dw_i~0 1))) (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse1 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse2 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= |old(~q_free~0)| ~q_free~0)) (.cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse14 (= ~p_dw_pc~0 1)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (let ((.cse21 (= ~p_dw_st~0 0))) (or (and .cse21 .cse20 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse16)) (and .cse19 .cse21 .cse20)))) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse9 (= ~c_num_read~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (or (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (= |old(~c_dr_pc~0)| 1) (and .cse11 .cse12 .cse4 .cse14 .cse15 .cse8) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse16 .cse13 .cse4 .cse14 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse9) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (let ((.cse17 (+ ~c_num_read~0 1))) (and .cse16 (<= .cse17 ~p_num_write~0) .cse13 (<= ~p_num_write~0 .cse17) .cse4 .cse14 .cse18)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse7 .cse8 .cse10) (not (<= |old(~p_dw_pc~0)| 0)) (and (not .cse18) .cse11 (not (= ~p_dw_st~0 1)) .cse14 (or .cse19 (not (= ~p_dw_st~0 ~q_free~0)))) (and .cse11 .cse3 .cse4 .cse6 (= ~q_free~0 1) .cse8 .cse10 .cse9 .cse18) (not .cse20) (not (= |old(~c_num_read~0)| 0))))) [2020-09-04 13:47:48,872 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (not (= |old(~q_free~0)| 1)) (not (<= |old(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= ~p_dw_i~0 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-09-04 13:47:48,872 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-09-04 13:47:48,872 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:47:48,872 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~q_free~0 0) (not (= ~c_dr_pc~0 1)) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~p_dw_i~0 1)) (= ~p_num_write~0 0) (= ~c_num_read~0 0)) [2020-09-04 13:47:48,873 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:47:48,873 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:47:48,873 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-09-04 13:47:48,873 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-09-04 13:47:48,873 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-09-04 13:47:48,873 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-09-04 13:47:48,873 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-09-04 13:47:48,873 INFO L264 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~c_dr_st~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse5 (not (= ~c_num_read~0 0))) (.cse2 (not (<= ~p_dw_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (and (<= 0 is_do_write_p_triggered_~__retres1~0) (<= is_do_write_p_triggered_~__retres1~0 0))) (.cse4 (= ~c_dr_pc~0 1)) (.cse7 (not (= ~p_num_write~0 1))) (.cse8 (not (= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7 .cse8) (or .cse1 .cse5 .cse2 .cse6 .cse3 .cse4 .cse7 .cse8))) [2020-09-04 13:47:48,874 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-09-04 13:47:48,874 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-09-04 13:47:48,874 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse8 (not (= |old(~c_num_read~0)| 0))) (.cse10 (<= 2 ~p_dw_st~0)) (.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse11 (not (<= 2 |old(~p_dw_st~0)|))) (.cse12 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse13 (not (= |old(~q_free~0)| 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) (and .cse2 .cse3 .cse4 .cse5 (= ~c_num_read~0 0) .cse6) .cse7 (not (= |old(~p_dw_st~0)| 0)) .cse8) (let ((.cse9 (= ~c_num_read~0 1))) (or (and .cse2 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse9 .cse10 .cse4 .cse5 .cse6) .cse11 .cse12 .cse13 .cse7 .cse8 .cse14 (not (= ~p_num_write~0 1)))) (let ((.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse15 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse15 ~p_num_write~0)) (and .cse2 .cse16 .cse10 .cse4 .cse5 .cse17 .cse6) (not .cse0) (and .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6) (not (<= ~p_num_write~0 .cse15)) .cse11 .cse12 .cse13 .cse7 .cse14))))) [2020-09-04 13:47:48,874 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-09-04 13:47:48,874 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse3 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) .cse2 (not (= |old(~p_dw_st~0)| 0)) .cse3) (or .cse4 .cse5 .cse6 .cse2 .cse3 .cse7 (not (= ~p_num_write~0 1))) (let ((.cse8 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse8 ~p_num_write~0)) (not .cse0) (not (<= ~p_num_write~0 .cse8)) .cse4 .cse5 .cse6 .cse2 .cse7))))) [2020-09-04 13:47:48,875 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse10 (= ~p_dw_pc~0 1)) (.cse5 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse12 (= ~q_free~0 1)) (.cse13 (= ~p_dw_i~0 1))) (let ((.cse21 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= ~a_t~0 |old(~a_t~0)|)) (.cse1 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse4 (= |old(~q_free~0)| ~q_free~0)) (.cse6 (= ~c_num_read~0 0)) (.cse23 (= |old(~c_dr_pc~0)| 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse14 (not .cse13)) (.cse15 (not (<= 2 |old(~p_dw_st~0)|))) (.cse16 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse19 (let ((.cse27 (<= 1 ~q_free~0))) (or (and .cse27 (not (= ~p_dw_st~0 1)) .cse10 .cse12 .cse13 (= ~c_dr_pc~0 1)) (and .cse27 .cse2 .cse10 .cse5 .cse12 .cse13)))) (.cse20 (<= 2 ~p_dw_st~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= |old(~q_free~0)| 0))) (.cse17 (not .cse9)) (.cse22 (not .cse10))) (and (let ((.cse7 (= ~c_num_read~0 1))) (or (and (= ~c_last_read~0 |old(~c_last_read~0)|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse7 .cse19 .cse20 .cse11) .cse21 .cse22 (not (= ~p_num_write~0 1)))) (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse23 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse14 (not (<= ~p_dw_pc~0 0)) .cse17 (not (= |old(~p_dw_st~0)| 0)) .cse21 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6)) (let ((.cse24 (+ |old(~c_num_read~0)| 1)) (.cse25 (<= ~p_num_write~0 ~c_num_read~0)) (.cse26 (<= ~c_num_read~0 ~p_num_write~0))) (or (not (<= .cse24 ~p_num_write~0)) (not .cse23) (not (<= ~p_num_write~0 .cse24)) (and .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26) .cse14 .cse15 .cse16 (and .cse19 .cse25 .cse20 .cse11 .cse26) .cse18 .cse17 .cse22))))) [2020-09-04 13:47:48,875 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse6 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= |old(~c_num_read~0)| 0))) (.cse9 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) .cse2 (not (= |old(~p_dw_st~0)| 0)) .cse3) (let ((.cse4 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse4 ~p_num_write~0)) (let ((.cse5 (+ ~c_num_read~0 1))) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (<= .cse5 ~p_num_write~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (<= ~p_num_write~0 .cse5) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= |old(~q_free~0)| ~q_free~0) (= |old(~p_dw_st~0)| ~p_dw_st~0))) (not .cse0) (not (<= ~p_num_write~0 .cse4)) .cse6 .cse7 .cse8 .cse2 .cse9)) (or .cse0 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 (not (= ~p_num_write~0 1)))))) [2020-09-04 13:47:48,875 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-09-04 13:47:48,875 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-09-04 13:47:48,876 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse18 (= ~p_dw_i~0 1))) (let ((.cse15 (not .cse18)) (.cse12 (= ~a_t~0 |old(~a_t~0)|)) (.cse13 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|))) (let ((.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (let ((.cse16 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse17 (= |old(~q_free~0)| ~q_free~0))) (or (and .cse16 .cse12 (<= 1 ~q_free~0) .cse13 .cse14 .cse17 .cse18) (and .cse16 .cse12 .cse13 .cse14 .cse17 (not (= ~p_dw_st~0 ~q_free~0)) .cse18 (not (= ~p_dw_pc~0 ~q_free~0)))))) (.cse5 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse15 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse15))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse0 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse3 (= ~c_num_read~0 0)) (.cse11 (= |old(~c_dr_pc~0)| 1)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= |old(~c_num_read~0)| 0)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~p_num_write~0 1))) (let ((.cse10 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse10 ~p_num_write~0)) (not .cse11) (not (<= ~p_num_write~0 .cse10)) .cse4 (and .cse0 .cse1 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse2) .cse5 .cse6 .cse7 .cse9)) (or (and .cse12 .cse0 .cse13 .cse14 .cse1 (= ~c_last_read~0 ~p_last_write~0) (= ~q_free~0 1) .cse3) (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse11 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse15 (not (<= ~p_dw_pc~0 0)) .cse7 (not (= |old(~p_dw_st~0)| 0)) .cse8))))) [2020-09-04 13:47:48,876 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-09-04 13:47:48,876 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse3 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) .cse2 (not (= |old(~p_dw_st~0)| 0)) .cse3) (or .cse4 .cse5 .cse6 .cse2 .cse3 .cse7 (not (= ~p_num_write~0 1))) (let ((.cse8 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse8 ~p_num_write~0)) (not .cse0) (not (<= ~p_num_write~0 .cse8)) .cse4 .cse5 .cse6 .cse2 .cse7))))) [2020-09-04 13:47:48,876 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-09-04 13:47:48,876 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-09-04 13:47:48,877 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse3 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse6 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= ~q_free~0 1)) (.cse5 (= ~c_dr_pc~0 1)) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) .cse2 (not (= |old(~p_dw_st~0)| 0)) .cse3) (or .cse0 .cse4 (and (not .cse5) (= ~c_num_read~0 1) .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse2 .cse3 .cse12 (not (= ~p_num_write~0 1))) (let ((.cse13 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse13 ~p_num_write~0)) (not .cse0) (not (<= ~p_num_write~0 .cse13)) .cse4 .cse10 (and .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (<= ~c_num_read~0 ~p_num_write~0) .cse5) .cse11 .cse2 .cse12))))) [2020-09-04 13:47:48,877 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-09-04 13:47:48,877 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-09-04 13:47:48,877 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-09-04 13:47:48,877 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= |old(~q_free~0)| ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_num_read~0 0) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= ~p_dw_st~0 0)) (= |old(~c_dr_pc~0)| 1) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~c_num_read~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-09-04 13:47:48,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:47:48 BoogieIcfgContainer [2020-09-04 13:47:48,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:47:48,972 INFO L168 Benchmark]: Toolchain (without parser) took 103907.11 ms. Allocated memory was 140.0 MB in the beginning and 788.5 MB in the end (delta: 648.5 MB). Free memory was 103.0 MB in the beginning and 251.0 MB in the end (delta: -148.0 MB). Peak memory consumption was 658.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:48,973 INFO L168 Benchmark]: CDTParser took 3.36 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-04 13:47:48,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.42 ms. Allocated memory is still 140.0 MB. Free memory was 103.0 MB in the beginning and 90.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:48,973 INFO L168 Benchmark]: Boogie Preprocessor took 132.95 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 90.7 MB in the beginning and 180.2 MB in the end (delta: -89.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:48,975 INFO L168 Benchmark]: RCFGBuilder took 554.73 ms. Allocated memory is still 202.9 MB. Free memory was 180.2 MB in the beginning and 153.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:48,975 INFO L168 Benchmark]: TraceAbstraction took 102808.52 ms. Allocated memory was 202.9 MB in the beginning and 788.5 MB in the end (delta: 585.6 MB). Free memory was 153.0 MB in the beginning and 251.0 MB in the end (delta: -98.0 MB). Peak memory consumption was 645.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:48,977 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.36 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 404.42 ms. Allocated memory is still 140.0 MB. Free memory was 103.0 MB in the beginning and 90.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.95 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 90.7 MB in the beginning and 180.2 MB in the end (delta: -89.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 554.73 ms. Allocated memory is still 202.9 MB. Free memory was 180.2 MB in the beginning and 153.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102808.52 ms. Allocated memory was 202.9 MB in the beginning and 788.5 MB in the end (delta: 585.6 MB). Free memory was 153.0 MB in the beginning and 251.0 MB in the end (delta: -98.0 MB). Peak memory consumption was 645.8 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: ((((((((((((((((!(2 <= \old(c_dr_st)) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || (((((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_dw_i == 1) && c_dr_pc == 1) && 2 <= c_dr_st) && p_last_write == q_buf_0) && \old(q_free) == q_free) && p_dw_pc == 1) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) && (((((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(q_free) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((((((((((a_t == \old(a_t) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && c_dr_pc == 1) && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) <= 0)) || !(\old(c_num_read) == 0))) && ((((((((!(2 <= \old(c_dr_st)) || (((((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_dw_i == 1) && p_last_write == \old(p_last_write)) && c_dr_pc == 1) && 2 <= c_dr_st) && p_last_write == q_buf_0) && \old(q_free) == q_free) && p_dw_pc == 1) && p_num_write == \old(p_num_write))) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(q_buf_0) == \old(p_last_write))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(c_num_read) <= \old(p_num_write)))) && ((((((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(\old(q_free) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || \old(c_dr_pc) == 1) || !(\old(c_last_read) == \old(p_last_write))) || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((((((((((a_t == \old(a_t) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(p_dw_pc) <= 0)) || ((((((((2 <= c_dr_st && p_last_write == q_buf_0) && p_dw_pc <= 0) && c_last_read == p_last_write) && q_free == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)) && c_num_read == 0) && c_dr_pc == 1)) || !(\old(c_num_read) == 0))) && (((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1))))) && ((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(c_num_read) <= \old(p_num_write)))) && ((((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1)))) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || \old(c_dr_pc) == 1) || (((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && p_dw_pc <= 0) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)))) && (((((!(2 <= \old(c_dr_st)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1)))) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 1) || \old(c_dr_pc) == 1) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1))))) && (((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && p_dw_pc == 1) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) == 1)) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(c_num_read) == 0)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((!(p_num_write == 0) || !(\old(q_free) == 1)) || \old(c_dr_pc) == 1) || !(p_last_write == \old(c_last_read))) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == 0)) && ((((((((!(\old(c_num_read) + 1 <= p_num_write) || ((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_num_read + 1 <= p_num_write) && c_dr_st == \old(c_dr_st)) && p_num_write <= c_num_read + 1) && c_dr_pc == \old(c_dr_pc)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st)) || !(\old(c_dr_pc) == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(q_free) == p_dw_pc) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1))) && (((((((\old(c_dr_pc) == 1 || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(q_free) == p_dw_pc) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_dw_i == 1) && p_num_write == \old(p_num_write)) && !(q_free == 0)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((q_free == 0 && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(p_dw_st) == p_dw_st) && \old(p_num_write) + 1 == p_num_write)) || c_dr_pc == 1) && (((((((((!(2 <= \old(c_dr_st)) || (((q_free == 0 && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(p_num_write) + 1 == p_num_write)) || (((((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_dw_i == 1) && p_num_write == \old(p_num_write)) && !(q_free == 0))) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0))) && (((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((c_dr_st == \old(c_dr_st) && p_dw_pc <= 0) && \old(p_dw_st) == p_dw_st)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1)) && (((((((!(c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || ((((q_free == 0 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_dw_pc == 1) && p_num_write <= \old(p_num_write) + 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_num_read <= \old(p_num_write)))) && ((((!(2 <= \old(c_dr_st)) || (2 <= c_dr_st && p_dw_pc == 1)) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && c_num_read == 0) || ((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(p_dw_i == 1)) || !(2 <= \old(p_dw_st))) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || (((c_num_read == 1 && ((((((1 <= q_free && !(p_dw_st == 1)) && p_dw_pc == 1) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || (((((1 <= q_free && c_dr_st == \old(c_dr_st)) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) && q_free == 1) && p_dw_i == 1))) && 2 <= p_dw_st) && c_last_read == p_last_write)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1)) && (((((((((!(p_num_write == 0) || !(\old(q_free) == 1)) || \old(c_dr_pc) == 1) || !(p_last_write == \old(c_last_read))) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == 0)) || (((((((a_t == \old(a_t) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && c_last_read == p_last_write) && c_num_read == 0))) && ((((((((((!(\old(c_num_read) + 1 <= p_num_write) || !(\old(c_dr_pc) == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || (((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write)) || !(p_dw_i == 1)) || !(2 <= \old(p_dw_st))) || \old(q_free) == p_dw_pc) || ((((((((((1 <= q_free && !(p_dw_st == 1)) && p_dw_pc == 1) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || (((((1 <= q_free && c_dr_st == \old(c_dr_st)) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) && q_free == 1) && p_dw_i == 1)) && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_num_read <= p_num_write)) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((!(2 <= c_dr_st) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || (0 <= __retres1 && __retres1 <= 0)) || c_dr_pc == 1) && (((((((!(2 <= c_dr_st) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(p_dw_pc <= 0)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_num_write == 1)) || !(q_free == 0))) && (((((((!(p_dw_i == 1) || !(c_num_read == 0)) || !(p_dw_pc <= 0)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || c_dr_pc == 1) || !(p_num_write == 1)) || !(q_free == 0)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(q_free) == 1) || ((((((((((\old(p_dw_pc) == p_dw_pc && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && p_dw_pc <= 0) && p_last_write == q_buf_0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_write_ev == \old(q_write_ev)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read == 0) && p_num_write == \old(p_num_write))) || (((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read <= p_num_write)) || \old(c_dr_pc) == 1) || (((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read <= p_num_write) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1)))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_num_read == 0)) || !(\old(p_num_write) == 0)) || !(\old(p_dw_st) == 0)) || ((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || (((((((((2 <= c_dr_st && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && p_dw_pc <= 0) && \old(q_free) == q_free) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && (1 <= q_free || !(p_dw_st == q_free)))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)) && c_num_read == 0) && c_dr_pc == 1)) || !(p_dw_i == 1)) || !(\old(c_num_read) == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) == 1)) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(c_num_read) == 0)) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && p_last_write == q_buf_0) && \old(q_free) == q_free) && p_dw_pc == 1) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) && (((((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(q_free) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((((((((((a_t == \old(a_t) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc <= 0) && p_last_write == q_buf_0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) <= 0)) || !(\old(c_num_read) == 0))) && ((((((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(\old(q_free) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || \old(c_dr_pc) == 1) || !(\old(c_last_read) == \old(p_last_write))) || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((((((((((a_t == \old(a_t) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(p_dw_pc) <= 0)) || ((((((((2 <= c_dr_st && p_last_write == q_buf_0) && p_dw_pc <= 0) && c_last_read == p_last_write) && q_free == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)) && c_num_read == 0) && c_dr_pc == 1)) || !(\old(c_num_read) == 0))) && (((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1))))) && ((((((((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(c_num_read) <= \old(p_num_write)))) && ((((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1)))) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || \old(c_dr_pc) == 1) || (((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && p_dw_pc <= 0) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)))) && (((((!(2 <= \old(c_dr_st)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1)))) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 1) || \old(c_dr_pc) == 1) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1))))) && ((((((((!(2 <= \old(c_dr_st)) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || !(2 <= \old(p_dw_st))) || ((((((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(q_buf_0) == \old(p_last_write))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(c_num_read) <= \old(p_num_write)))) && (((((((((!(2 <= \old(c_dr_st)) || ((((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) && 2 <= c_dr_st) && c_num_read + 1 <= p_num_write) && !(p_dw_st == 1)) && p_last_write == q_buf_0) && p_dw_pc == 1) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || ((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write)) && (((((!(2 <= \old(c_dr_st)) || (((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && !(p_dw_st == q_free)) && !(p_dw_pc == q_free))) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1)) && ((((((((!(\old(q_free) == 1) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || ((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || c_dr_pc == 1)) && ((((!(2 <= \old(c_dr_st)) || (((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && !(p_dw_st == q_free)) && !(p_dw_pc == q_free))) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1)) && (((((((!(c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || (((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1)) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_num_read <= \old(p_num_write))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((!(2 <= c_dr_st) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || (0 <= __retres1 && __retres1 <= 0)) || c_dr_pc == 1) && (((((((((!(p_dw_st == 0) || !(p_dw_i == 1)) || !(c_num_read == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_dw_pc == 1)) || c_dr_pc == 1) || !(c_last_read == p_last_write)) || !(p_num_write == 1))) && ((((!(2 <= c_dr_st) || !(p_dw_i == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_dw_pc == 1)) || c_dr_pc == 1)) && (((((((((!(p_dw_i == 1) || !(c_num_read == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || c_dr_pc == 1) || !(c_last_read == p_last_write)) || !(p_num_write == 1))) && (((((((!(p_dw_i == 1) || !(c_num_read == 0)) || !(p_dw_pc <= 0)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || c_dr_pc == 1) || !(p_num_write == 1)) || !(q_free == 0)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((!(p_num_write == 0) || !(\old(q_free) == 1)) || \old(c_dr_pc) == 1) || !(p_last_write == \old(c_last_read))) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || (((((2 <= c_dr_st && p_dw_st == 0) && c_last_read == p_last_write) && q_free == 1) && c_num_read == 0) && c_dr_pc == 1)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == 0)) && (((((((((((((2 <= c_dr_st && c_num_read == 1) && p_dw_st == 0) && c_last_read == p_last_write) && q_free == 1) && c_dr_pc == 1) || (((((2 <= c_dr_st && c_num_read == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && q_free == 1) && c_dr_pc == 1)) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(q_free) == p_dw_pc) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1))) && (((((((((!(\old(c_num_read) + 1 <= p_num_write) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && q_free == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_dw_st == 0) && c_last_read == p_last_write) && q_free == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(q_free) == p_dw_pc) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || c_dr_pc == 1) && (((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((((c_dr_st == \old(c_dr_st) && p_dw_pc <= 0) && \old(p_dw_st) == p_dw_st) && p_dw_i == 1) && !(q_free == 0))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1)) && ((((((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0))) && ((((!(2 <= \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || (((2 <= c_dr_st && p_dw_pc == 1) && p_dw_i == 1) && !(q_free == 0))) || c_dr_pc == 1)) && ((((((((((((((((c_dr_st == \old(c_dr_st) && p_last_write == q_buf_0) && \old(q_free) == q_free) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_dw_i == 1) && p_num_write == \old(p_num_write)) && !(q_free == 0)) || !(c_dr_pc == 1)) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_num_read <= \old(p_num_write))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 29.0s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 73.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2090 SDtfs, 4979 SDslu, 2214 SDs, 0 SdLazy, 10328 SolverSat, 2052 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 623 SyntacticMatches, 3 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 5.2s 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.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 1555 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3013 PreInvPairs, 3531 NumberOfFragments, 12855 HoareAnnotationTreeSize, 3013 FomulaSimplifications, 38256310 FormulaSimplificationTreeSizeReduction, 34.7s HoareSimplificationTime, 45 FomulaSimplificationsInter, 1266568 FormulaSimplificationTreeSizeReductionInter, 38.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1483 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1466 ConstructedInterpolants, 0 QuantifiedInterpolants, 378715 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1910 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...