/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 04:11:03,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 04:11:03,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 04:11:03,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 04:11:03,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 04:11:03,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 04:11:03,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 04:11:03,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 04:11:03,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 04:11:03,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 04:11:03,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 04:11:03,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 04:11:03,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 04:11:03,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 04:11:03,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 04:11:03,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 04:11:03,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 04:11:03,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 04:11:03,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 04:11:03,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 04:11:03,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 04:11:03,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 04:11:03,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 04:11:03,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 04:11:03,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 04:11:03,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 04:11:03,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 04:11:03,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 04:11:03,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 04:11:03,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 04:11:03,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 04:11:03,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 04:11:03,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 04:11:03,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 04:11:03,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 04:11:03,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 04:11:03,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 04:11:03,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 04:11:03,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 04:11:03,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 04:11:03,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 04:11:03,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 04:11:03,885 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 04:11:03,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 04:11:03,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 04:11:03,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 04:11:03,888 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 04:11:03,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 04:11:03,888 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 04:11:03,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 04:11:03,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 04:11:03,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 04:11:03,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 04:11:03,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 04:11:03,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 04:11:03,890 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 04:11:03,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 04:11:03,890 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 04:11:03,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 04:11:03,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 04:11:03,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 04:11:03,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 04:11:03,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 04:11:03,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 04:11:03,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 04:11:03,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 04:11:03,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 04:11:03,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 04:11:03,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 04:11:03,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 04:11:03,900 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 04:11:03,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 04:11:04,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 04:11:04,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 04:11:04,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 04:11:04,331 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 04:11:04,332 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 04:11:04,333 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 04:11:04,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72664d7a/8b3028e96f604f27b58921c268e5f2ef/FLAGfe0784d10 [2020-07-20 04:11:05,139 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 04:11:05,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 04:11:05,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72664d7a/8b3028e96f604f27b58921c268e5f2ef/FLAGfe0784d10 [2020-07-20 04:11:05,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72664d7a/8b3028e96f604f27b58921c268e5f2ef [2020-07-20 04:11:05,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 04:11:05,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 04:11:05,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 04:11:05,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 04:11:05,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 04:11:05,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:11:05" (1/1) ... [2020-07-20 04:11:05,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4923a046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05, skipping insertion in model container [2020-07-20 04:11:05,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:11:05" (1/1) ... [2020-07-20 04:11:05,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 04:11:05,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 04:11:05,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 04:11:05,874 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 04:11:05,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 04:11:05,961 INFO L208 MainTranslator]: Completed translation [2020-07-20 04:11:05,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05 WrapperNode [2020-07-20 04:11:05,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 04:11:05,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 04:11:05,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 04:11:05,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 04:11:06,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05" (1/1) ... [2020-07-20 04:11:06,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05" (1/1) ... [2020-07-20 04:11:06,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05" (1/1) ... [2020-07-20 04:11:06,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05" (1/1) ... [2020-07-20 04:11:06,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05" (1/1) ... [2020-07-20 04:11:06,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05" (1/1) ... [2020-07-20 04:11:06,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05" (1/1) ... [2020-07-20 04:11:06,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 04:11:06,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 04:11:06,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 04:11:06,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 04:11:06,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 04:11:06,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 04:11:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 04:11:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 04:11:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-20 04:11:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-20 04:11:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-20 04:11:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-20 04:11:06,268 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-20 04:11:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 04:11:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 04:11:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 04:11:06,270 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 04:11:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 04:11:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 04:11:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 04:11:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 04:11:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 04:11:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 04:11:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-20 04:11:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-20 04:11:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-20 04:11:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-20 04:11:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-20 04:11:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 04:11:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 04:11:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 04:11:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 04:11:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 04:11:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 04:11:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 04:11:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 04:11:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 04:11:06,868 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 04:11:06,869 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 04:11:06,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:11:06 BoogieIcfgContainer [2020-07-20 04:11:06,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 04:11:06,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 04:11:06,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 04:11:06,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 04:11:06,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:11:05" (1/3) ... [2020-07-20 04:11:06,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f0d229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:11:06, skipping insertion in model container [2020-07-20 04:11:06,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:05" (2/3) ... [2020-07-20 04:11:06,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f0d229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:11:06, skipping insertion in model container [2020-07-20 04:11:06,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:11:06" (3/3) ... [2020-07-20 04:11:06,893 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-20 04:11:06,909 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 04:11:06,919 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 04:11:06,937 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 04:11:06,986 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 04:11:06,986 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 04:11:06,987 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 04:11:06,987 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 04:11:06,987 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 04:11:06,987 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 04:11:06,987 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 04:11:06,987 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 04:11:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-20 04:11:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 04:11:07,041 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:07,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:07,044 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:07,053 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-20 04:11:07,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:07,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918820482] [2020-07-20 04:11:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:07,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918820482] [2020-07-20 04:11:07,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:07,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 04:11:07,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265935069] [2020-07-20 04:11:07,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 04:11:07,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:07,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 04:11:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 04:11:07,844 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 6 states. [2020-07-20 04:11:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:09,445 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2020-07-20 04:11:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 04:11:09,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-07-20 04:11:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:09,473 INFO L225 Difference]: With dead ends: 356 [2020-07-20 04:11:09,473 INFO L226 Difference]: Without dead ends: 248 [2020-07-20 04:11:09,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:11:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-07-20 04:11:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 185. [2020-07-20 04:11:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-07-20 04:11:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2020-07-20 04:11:09,640 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 65 [2020-07-20 04:11:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:09,642 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2020-07-20 04:11:09,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 04:11:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2020-07-20 04:11:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 04:11:09,650 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:09,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:09,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 04:11:09,651 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:09,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1537976919, now seen corresponding path program 1 times [2020-07-20 04:11:09,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:09,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633746731] [2020-07-20 04:11:09,653 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:09,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633746731] [2020-07-20 04:11:09,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:09,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 04:11:09,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648527737] [2020-07-20 04:11:09,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 04:11:09,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:09,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 04:11:09,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 04:11:09,978 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand 7 states. [2020-07-20 04:11:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:10,954 INFO L93 Difference]: Finished difference Result 406 states and 562 transitions. [2020-07-20 04:11:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 04:11:10,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2020-07-20 04:11:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:10,960 INFO L225 Difference]: With dead ends: 406 [2020-07-20 04:11:10,961 INFO L226 Difference]: Without dead ends: 238 [2020-07-20 04:11:10,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:11:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-20 04:11:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 182. [2020-07-20 04:11:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-20 04:11:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 241 transitions. [2020-07-20 04:11:11,017 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 241 transitions. Word has length 66 [2020-07-20 04:11:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:11,018 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 241 transitions. [2020-07-20 04:11:11,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 04:11:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 241 transitions. [2020-07-20 04:11:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-20 04:11:11,022 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:11,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:11,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 04:11:11,023 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash -478173211, now seen corresponding path program 1 times [2020-07-20 04:11:11,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:11,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158284222] [2020-07-20 04:11:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:11,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158284222] [2020-07-20 04:11:11,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:11,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 04:11:11,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455927889] [2020-07-20 04:11:11,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 04:11:11,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:11,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 04:11:11,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:11:11,463 INFO L87 Difference]: Start difference. First operand 182 states and 241 transitions. Second operand 9 states. [2020-07-20 04:11:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:13,171 INFO L93 Difference]: Finished difference Result 582 states and 869 transitions. [2020-07-20 04:11:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 04:11:13,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-07-20 04:11:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:13,185 INFO L225 Difference]: With dead ends: 582 [2020-07-20 04:11:13,185 INFO L226 Difference]: Without dead ends: 417 [2020-07-20 04:11:13,188 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-07-20 04:11:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-07-20 04:11:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2020-07-20 04:11:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-07-20 04:11:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2020-07-20 04:11:13,346 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 72 [2020-07-20 04:11:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:13,350 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2020-07-20 04:11:13,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 04:11:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2020-07-20 04:11:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-20 04:11:13,359 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:13,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:13,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 04:11:13,360 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:13,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:13,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2098500188, now seen corresponding path program 1 times [2020-07-20 04:11:13,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:13,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097686084] [2020-07-20 04:11:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:13,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097686084] [2020-07-20 04:11:13,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:13,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-20 04:11:13,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654576172] [2020-07-20 04:11:13,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 04:11:13,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 04:11:13,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-20 04:11:13,760 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand 12 states. [2020-07-20 04:11:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:17,792 INFO L93 Difference]: Finished difference Result 873 states and 1358 transitions. [2020-07-20 04:11:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-20 04:11:17,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-07-20 04:11:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:17,806 INFO L225 Difference]: With dead ends: 873 [2020-07-20 04:11:17,806 INFO L226 Difference]: Without dead ends: 554 [2020-07-20 04:11:17,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2020-07-20 04:11:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-07-20 04:11:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 211. [2020-07-20 04:11:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-20 04:11:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2020-07-20 04:11:17,908 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 73 [2020-07-20 04:11:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:17,909 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2020-07-20 04:11:17,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 04:11:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2020-07-20 04:11:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 04:11:17,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:17,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:17,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 04:11:17,911 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:17,912 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-07-20 04:11:17,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:17,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898240338] [2020-07-20 04:11:17,912 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:18,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898240338] [2020-07-20 04:11:18,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:18,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 04:11:18,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528938561] [2020-07-20 04:11:18,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 04:11:18,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:18,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 04:11:18,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-20 04:11:18,183 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand 8 states. [2020-07-20 04:11:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:19,880 INFO L93 Difference]: Finished difference Result 612 states and 874 transitions. [2020-07-20 04:11:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 04:11:19,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2020-07-20 04:11:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:19,897 INFO L225 Difference]: With dead ends: 612 [2020-07-20 04:11:19,897 INFO L226 Difference]: Without dead ends: 418 [2020-07-20 04:11:19,900 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-20 04:11:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-07-20 04:11:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 323. [2020-07-20 04:11:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-20 04:11:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 419 transitions. [2020-07-20 04:11:19,992 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 419 transitions. Word has length 66 [2020-07-20 04:11:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:19,994 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 419 transitions. [2020-07-20 04:11:19,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 04:11:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 419 transitions. [2020-07-20 04:11:19,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 04:11:19,995 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:19,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:19,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 04:11:19,997 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2020-07-20 04:11:20,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:20,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246154296] [2020-07-20 04:11:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:20,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246154296] [2020-07-20 04:11:20,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:20,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 04:11:20,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099052664] [2020-07-20 04:11:20,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 04:11:20,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:20,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 04:11:20,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:11:20,307 INFO L87 Difference]: Start difference. First operand 323 states and 419 transitions. Second operand 9 states. [2020-07-20 04:11:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:21,716 INFO L93 Difference]: Finished difference Result 727 states and 1002 transitions. [2020-07-20 04:11:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 04:11:21,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-07-20 04:11:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:21,723 INFO L225 Difference]: With dead ends: 727 [2020-07-20 04:11:21,723 INFO L226 Difference]: Without dead ends: 421 [2020-07-20 04:11:21,727 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-07-20 04:11:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-07-20 04:11:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 341. [2020-07-20 04:11:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-07-20 04:11:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 437 transitions. [2020-07-20 04:11:21,794 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 437 transitions. Word has length 66 [2020-07-20 04:11:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:21,795 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 437 transitions. [2020-07-20 04:11:21,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 04:11:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2020-07-20 04:11:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 04:11:21,797 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:21,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:21,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 04:11:21,798 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2020-07-20 04:11:21,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:21,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121579056] [2020-07-20 04:11:21,800 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:22,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121579056] [2020-07-20 04:11:22,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:22,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 04:11:22,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021516218] [2020-07-20 04:11:22,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 04:11:22,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:22,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 04:11:22,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:11:22,061 INFO L87 Difference]: Start difference. First operand 341 states and 437 transitions. Second operand 9 states. [2020-07-20 04:11:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:25,993 INFO L93 Difference]: Finished difference Result 1164 states and 1617 transitions. [2020-07-20 04:11:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-20 04:11:25,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-07-20 04:11:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:26,004 INFO L225 Difference]: With dead ends: 1164 [2020-07-20 04:11:26,005 INFO L226 Difference]: Without dead ends: 840 [2020-07-20 04:11:26,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2020-07-20 04:11:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-07-20 04:11:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 643. [2020-07-20 04:11:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-07-20 04:11:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 815 transitions. [2020-07-20 04:11:26,103 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 815 transitions. Word has length 66 [2020-07-20 04:11:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:26,104 INFO L479 AbstractCegarLoop]: Abstraction has 643 states and 815 transitions. [2020-07-20 04:11:26,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 04:11:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 815 transitions. [2020-07-20 04:11:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 04:11:26,106 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:26,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:26,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 04:11:26,107 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2020-07-20 04:11:26,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:26,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589289586] [2020-07-20 04:11:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:26,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589289586] [2020-07-20 04:11:26,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:26,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 04:11:26,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064173747] [2020-07-20 04:11:26,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 04:11:26,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 04:11:26,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:11:26,412 INFO L87 Difference]: Start difference. First operand 643 states and 815 transitions. Second operand 9 states. [2020-07-20 04:11:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:27,709 INFO L93 Difference]: Finished difference Result 1352 states and 1804 transitions. [2020-07-20 04:11:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 04:11:27,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-07-20 04:11:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:27,720 INFO L225 Difference]: With dead ends: 1352 [2020-07-20 04:11:27,721 INFO L226 Difference]: Without dead ends: 764 [2020-07-20 04:11:27,725 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-07-20 04:11:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-07-20 04:11:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 669. [2020-07-20 04:11:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-07-20 04:11:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 834 transitions. [2020-07-20 04:11:27,821 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 834 transitions. Word has length 66 [2020-07-20 04:11:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:27,822 INFO L479 AbstractCegarLoop]: Abstraction has 669 states and 834 transitions. [2020-07-20 04:11:27,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 04:11:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 834 transitions. [2020-07-20 04:11:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 04:11:27,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:27,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:27,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 04:11:27,826 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:27,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:27,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2020-07-20 04:11:27,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:27,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026163483] [2020-07-20 04:11:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:28,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026163483] [2020-07-20 04:11:28,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:28,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 04:11:28,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263457873] [2020-07-20 04:11:28,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 04:11:28,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:28,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 04:11:28,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 04:11:28,028 INFO L87 Difference]: Start difference. First operand 669 states and 834 transitions. Second operand 6 states. [2020-07-20 04:11:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:28,972 INFO L93 Difference]: Finished difference Result 1262 states and 1648 transitions. [2020-07-20 04:11:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 04:11:28,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-20 04:11:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:28,985 INFO L225 Difference]: With dead ends: 1262 [2020-07-20 04:11:28,985 INFO L226 Difference]: Without dead ends: 814 [2020-07-20 04:11:28,989 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-20 04:11:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2020-07-20 04:11:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 708. [2020-07-20 04:11:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2020-07-20 04:11:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 908 transitions. [2020-07-20 04:11:29,086 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 908 transitions. Word has length 66 [2020-07-20 04:11:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:29,087 INFO L479 AbstractCegarLoop]: Abstraction has 708 states and 908 transitions. [2020-07-20 04:11:29,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 04:11:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 908 transitions. [2020-07-20 04:11:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-20 04:11:29,090 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:29,091 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:29,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 04:11:29,092 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1757954899, now seen corresponding path program 1 times [2020-07-20 04:11:29,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:29,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317810819] [2020-07-20 04:11:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 04:11:29,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317810819] [2020-07-20 04:11:29,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243395877] [2020-07-20 04:11:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@745c972a No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:11:29,463 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@745c972a issued 1 check-sat command(s) [2020-07-20 04:11:29,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:11:29,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 04:11:29,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:11:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:29,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:11:29,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 04:11:29,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924742210] [2020-07-20 04:11:29,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:11:29,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:29,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:11:29,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:11:29,544 INFO L87 Difference]: Start difference. First operand 708 states and 908 transitions. Second operand 3 states. [2020-07-20 04:11:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:29,779 INFO L93 Difference]: Finished difference Result 1674 states and 2250 transitions. [2020-07-20 04:11:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:11:29,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-20 04:11:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:29,791 INFO L225 Difference]: With dead ends: 1674 [2020-07-20 04:11:29,792 INFO L226 Difference]: Without dead ends: 812 [2020-07-20 04:11:29,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:11:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-07-20 04:11:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-07-20 04:11:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-07-20 04:11:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1048 transitions. [2020-07-20 04:11:29,953 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1048 transitions. Word has length 86 [2020-07-20 04:11:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:29,955 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 1048 transitions. [2020-07-20 04:11:29,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:11:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1048 transitions. [2020-07-20 04:11:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-20 04:11:29,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:29,964 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:30,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 04:11:30,178 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash -232030383, now seen corresponding path program 1 times [2020-07-20 04:11:30,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:30,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253260154] [2020-07-20 04:11:30,183 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 04:11:30,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253260154] [2020-07-20 04:11:30,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:30,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 04:11:30,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727793927] [2020-07-20 04:11:30,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 04:11:30,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:30,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 04:11:30,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 04:11:30,615 INFO L87 Difference]: Start difference. First operand 812 states and 1048 transitions. Second operand 8 states. [2020-07-20 04:11:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:31,946 INFO L93 Difference]: Finished difference Result 962 states and 1270 transitions. [2020-07-20 04:11:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 04:11:31,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2020-07-20 04:11:31,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:31,958 INFO L225 Difference]: With dead ends: 962 [2020-07-20 04:11:31,959 INFO L226 Difference]: Without dead ends: 959 [2020-07-20 04:11:31,961 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-07-20 04:11:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-07-20 04:11:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 820. [2020-07-20 04:11:32,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-07-20 04:11:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1043 transitions. [2020-07-20 04:11:32,136 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1043 transitions. Word has length 98 [2020-07-20 04:11:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:32,137 INFO L479 AbstractCegarLoop]: Abstraction has 820 states and 1043 transitions. [2020-07-20 04:11:32,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 04:11:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1043 transitions. [2020-07-20 04:11:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 04:11:32,148 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:32,149 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:32,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 04:11:32,149 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:32,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-07-20 04:11:32,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:32,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702844729] [2020-07-20 04:11:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 04:11:32,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702844729] [2020-07-20 04:11:32,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226250525] [2020-07-20 04:11:32,577 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@55ec602e No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:11:32,705 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@55ec602e issued 3 check-sat command(s) [2020-07-20 04:11:32,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:11:32,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-20 04:11:32,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:11:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 04:11:32,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 04:11:32,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-07-20 04:11:32,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795105875] [2020-07-20 04:11:32,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 04:11:32,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 04:11:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-07-20 04:11:32,918 INFO L87 Difference]: Start difference. First operand 820 states and 1043 transitions. Second operand 16 states. [2020-07-20 04:11:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:38,042 INFO L93 Difference]: Finished difference Result 2540 states and 3915 transitions. [2020-07-20 04:11:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-07-20 04:11:38,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2020-07-20 04:11:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:38,062 INFO L225 Difference]: With dead ends: 2540 [2020-07-20 04:11:38,063 INFO L226 Difference]: Without dead ends: 2537 [2020-07-20 04:11:38,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2020-07-20 04:11:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2020-07-20 04:11:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2338. [2020-07-20 04:11:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-07-20 04:11:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3577 transitions. [2020-07-20 04:11:38,517 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3577 transitions. Word has length 99 [2020-07-20 04:11:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:38,517 INFO L479 AbstractCegarLoop]: Abstraction has 2338 states and 3577 transitions. [2020-07-20 04:11:38,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 04:11:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3577 transitions. [2020-07-20 04:11:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-20 04:11:38,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:38,531 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:38,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-20 04:11:38,746 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:38,748 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-07-20 04:11:38,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:38,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404720826] [2020-07-20 04:11:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-07-20 04:11:39,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404720826] [2020-07-20 04:11:39,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 04:11:39,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 04:11:39,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294553438] [2020-07-20 04:11:39,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 04:11:39,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 04:11:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 04:11:39,149 INFO L87 Difference]: Start difference. First operand 2338 states and 3577 transitions. Second operand 7 states. [2020-07-20 04:11:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:40,544 INFO L93 Difference]: Finished difference Result 3773 states and 6055 transitions. [2020-07-20 04:11:40,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 04:11:40,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2020-07-20 04:11:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:40,571 INFO L225 Difference]: With dead ends: 3773 [2020-07-20 04:11:40,571 INFO L226 Difference]: Without dead ends: 2107 [2020-07-20 04:11:40,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-20 04:11:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2020-07-20 04:11:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2006. [2020-07-20 04:11:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2020-07-20 04:11:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2998 transitions. [2020-07-20 04:11:40,995 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2998 transitions. Word has length 125 [2020-07-20 04:11:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:40,996 INFO L479 AbstractCegarLoop]: Abstraction has 2006 states and 2998 transitions. [2020-07-20 04:11:40,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 04:11:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2998 transitions. [2020-07-20 04:11:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-20 04:11:41,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 04:11:41,007 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 04:11:41,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 04:11:41,008 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 04:11:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 04:11:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2020-07-20 04:11:41,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 04:11:41,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687018169] [2020-07-20 04:11:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@36ae6424 [2020-07-20 04:11:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 04:11:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-07-20 04:11:41,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687018169] [2020-07-20 04:11:41,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174634318] [2020-07-20 04:11:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@29a6f06b No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 04:11:41,517 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@29a6f06b issued 1 check-sat command(s) [2020-07-20 04:11:41,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 04:11:41,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 04:11:41,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 04:11:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-20 04:11:41,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 04:11:41,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-20 04:11:41,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835969197] [2020-07-20 04:11:41,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 04:11:41,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 04:11:41,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 04:11:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:11:41,577 INFO L87 Difference]: Start difference. First operand 2006 states and 2998 transitions. Second operand 3 states. [2020-07-20 04:11:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 04:11:41,718 INFO L93 Difference]: Finished difference Result 2401 states and 3609 transitions. [2020-07-20 04:11:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 04:11:41,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-07-20 04:11:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 04:11:41,721 INFO L225 Difference]: With dead ends: 2401 [2020-07-20 04:11:41,722 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 04:11:41,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-20 04:11:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 04:11:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 04:11:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 04:11:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 04:11:41,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-20 04:11:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 04:11:41,740 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 04:11:41,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 04:11:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 04:11:41,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 04:11:41,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-20 04:11:41,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 04:11:43,488 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2020-07-20 04:11:50,418 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 04:11:51,675 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-07-20 04:11:52,996 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-07-20 04:11:53,399 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 74 [2020-07-20 04:11:53,523 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-07-20 04:11:54,360 WARN L193 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 83 [2020-07-20 04:11:54,677 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 04:11:55,820 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 150 DAG size of output: 77 [2020-07-20 04:11:56,583 WARN L193 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2020-07-20 04:11:57,238 WARN L193 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2020-07-20 04:11:57,507 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 36 [2020-07-20 04:11:58,781 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-07-20 04:11:58,949 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-07-20 04:11:59,109 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-07-20 04:12:02,612 WARN L193 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 214 DAG size of output: 150 [2020-07-20 04:12:02,814 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-07-20 04:12:03,432 WARN L193 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2020-07-20 04:12:04,095 WARN L193 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2020-07-20 04:12:04,422 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 04:12:04,728 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 04:12:08,331 WARN L193 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 227 DAG size of output: 153 [2020-07-20 04:12:11,255 WARN L193 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 178 DAG size of output: 127 [2020-07-20 04:12:13,040 WARN L193 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 179 DAG size of output: 116 [2020-07-20 04:12:14,037 WARN L193 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 89 [2020-07-20 04:12:14,221 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-07-20 04:12:15,497 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 181 DAG size of output: 100 [2020-07-20 04:12:19,050 WARN L193 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 214 DAG size of output: 150 [2020-07-20 04:12:19,354 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-20 04:12:19,797 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-07-20 04:12:19,913 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-07-20 04:12:20,038 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-07-20 04:12:20,773 WARN L193 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-07-20 04:12:21,031 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-07-20 04:12:21,563 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 53 [2020-07-20 04:12:24,317 WARN L193 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 214 DAG size of output: 130 [2020-07-20 04:12:25,149 WARN L193 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2020-07-20 04:12:26,765 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 200 DAG size of output: 90 [2020-07-20 04:12:26,772 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-20 04:12:26,773 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-20 04:12:26,773 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-20 04:12:26,773 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-20 04:12:26,774 INFO L271 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: true [2020-07-20 04:12:26,774 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-20 04:12:26,774 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-20 04:12:26,774 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-20 04:12:26,774 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 ~p_dw_i~0)) (= ~c_dr_pc~0 1) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (not (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 04:12:26,774 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-20 04:12:26,774 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (<= ~p_dw_pc~0 0) (not (= ~c_dr_pc~0 1)) (= 1 ~p_dw_i~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~q_free~0)) (not (= 0 |old(~c_num_read~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 04:12:26,775 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (and (= 0 ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 04:12:26,775 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-20 04:12:26,775 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-20 04:12:26,775 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-20 04:12:26,776 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (and (= 0 ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 04:12:26,777 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse12 (= ~c_dr_pc~0 1))) (let ((.cse2 (not .cse12)) (.cse19 (= 1 ~p_dw_i~0)) (.cse4 (= 0 ~q_free~0)) (.cse6 (= 1 ~p_dw_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~p_dw_st~0))) (let ((.cse14 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (and .cse4 .cse6 (= 1 ~p_num_write~0) .cse7 .cse8)) (.cse17 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse13 (not (<= |old(~p_dw_pc~0)| 0))) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse11 (and (<= 2 ~c_dr_st~0) (not (= 1 ~p_dw_st~0)) .cse2 .cse6 .cse19 (not (= ~p_dw_pc~0 ~q_free~0)) (not (= ~p_dw_st~0 ~q_free~0)))) (.cse3 (let ((.cse18 (not .cse19))) (and (or .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse18)))) (.cse9 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 .cse3 (let ((.cse5 (+ |old(~p_num_write~0)| 1))) (and .cse4 (<= ~p_num_write~0 .cse5) .cse6 (<= .cse5 ~p_num_write~0) .cse7 .cse8)) .cse9) (or .cse10 .cse11 .cse3 .cse12 .cse9 .cse13) (or .cse14 .cse0 .cse10 .cse15 .cse3 .cse16 .cse17 .cse9 .cse13) (or .cse14 .cse0 .cse10 .cse15 .cse3 .cse16 .cse17 .cse12 .cse13) (or .cse1 .cse11 .cse3 .cse12 .cse9))))) [2020-07-20 04:12:26,777 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse5 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse21 (= 1 ~p_dw_i~0)) (.cse6 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse8 (= |old(~q_free~0)| ~q_free~0))) (let ((.cse3 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse22 (or (and .cse2 .cse5 .cse21 .cse6 .cse7 (not (= 0 ~q_free~0)) (not (= ~p_dw_pc~0 ~q_free~0)) .cse8) (and .cse2 (<= 1 ~q_free~0) .cse5 .cse21 .cse6 .cse7 .cse8))) (.cse4 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse9 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse14 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (not (= 0 |old(~p_num_write~0)|))) (.cse17 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse18 (and .cse22 .cse4 (= ~c_last_read~0 ~p_last_write~0) .cse9)) (.cse12 (and .cse3 .cse22 .cse4 .cse9)) (.cse15 (not (= 1 |old(~q_free~0)|))) (.cse10 (let ((.cse20 (not .cse21))) (and (or .cse20 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse20)))) (.cse13 (= ~c_dr_pc~0 1)) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) .cse10 .cse11) (or .cse12 .cse1 .cse10 .cse13 .cse11) (or .cse14 .cse0 .cse15 .cse16 .cse10 .cse17 .cse18 .cse11 .cse19) (or .cse14 .cse0 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18 .cse19) (or .cse12 .cse15 .cse10 .cse13 .cse11 .cse19))))) [2020-07-20 04:12:26,778 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse9 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse15 (= 0 ~q_free~0)) (.cse10 (<= ~p_dw_pc~0 0)) (.cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (not (= 1 |old(~p_dw_pc~0)|))) (.cse14 (= 1 ~p_dw_pc~0)) (.cse7 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= 0 ~c_num_read~0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse4 (let ((.cse17 (not (= 1 ~p_dw_i~0)))) (and (or .cse17 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse17)))) (.cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse12 (= ~c_dr_pc~0 1)) (.cse6 (and .cse9 .cse15 .cse10 .cse11 (= 1 ~p_num_write~0) .cse16)) (.cse8 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10 .cse11) .cse2 .cse4 .cse12 .cse7 .cse8) (or .cse13 (and (<= 2 ~c_dr_st~0) .cse14) .cse4 .cse12 .cse7) (or .cse1 .cse13 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (not .cse12) .cse4 (and .cse9 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse14 .cse11 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse16) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse8)))) [2020-07-20 04:12:26,778 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-20 04:12:26,778 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-20 04:12:26,778 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-20 04:12:26,779 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse19 (= 1 ~p_dw_i~0))) (let ((.cse16 (not (= 1 |old(~p_dw_pc~0)|))) (.cse18 (= 1 ~p_dw_pc~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (not (= 0 ~c_num_read~0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse9 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse10 (= 0 ~p_num_write~0)) (.cse12 (= |old(~q_free~0)| ~q_free~0)) (.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse4 (let ((.cse21 (not .cse19))) (and (or .cse21 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse21)))) (.cse17 (= ~c_dr_pc~0 1)) (.cse14 (not (<= 2 |old(~c_dr_st~0)|))) (.cse15 (not (<= |old(~p_dw_pc~0)| 0))) (.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse8 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse20 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (or .cse16 .cse4 .cse17 .cse14 (and (<= 2 ~c_dr_st~0) .cse18 .cse19 .cse20)) (or .cse1 .cse16 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (not .cse17) .cse4 .cse14 (and .cse6 (<= ~p_num_write~0 ~c_num_read~0) (<= ~c_num_read~0 ~p_num_write~0) .cse7 .cse18 .cse19 .cse8 .cse20 .cse11 .cse12 .cse13)) (or .cse0 .cse1 .cse2 (and .cse6 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) .cse3 .cse4 .cse5 .cse17 .cse15) (or .cse2 .cse4 .cse17 .cse14 .cse15 (and .cse6 (<= ~p_dw_pc~0 0) .cse19 .cse8 .cse20))))) [2020-07-20 04:12:26,779 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse13 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse15 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse6 (= 1 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 1)) (.cse8 (and .cse13 (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) .cse19 .cse15 (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_free~0)| ~q_free~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse5 (= 0 ~q_free~0)) (.cse14 (<= ~p_dw_pc~0 0)) (.cse16 (= 1 ~p_num_write~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse3 (let ((.cse18 (not .cse19))) (and (or .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse18)))) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse17 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (not .cse2) .cse3 .cse4 (and .cse5 .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse7)) (or .cse8 .cse9 .cse0 .cse10 .cse11 .cse3 .cse12 .cse2 (and .cse13 .cse5 .cse14 .cse15 .cse16 .cse7) .cse17) (or (and .cse13 .cse14 .cse15) .cse10 .cse3 .cse2 .cse4 .cse17) (or .cse1 (and (<= 2 ~c_dr_st~0) .cse6) .cse3 .cse2 .cse4) (or .cse8 .cse9 .cse0 .cse10 (and .cse5 .cse14 .cse16 .cse7) .cse11 .cse3 .cse12 .cse4 .cse17)))) [2020-07-20 04:12:26,780 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-20 04:12:26,780 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-20 04:12:26,780 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-20 04:12:26,780 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-20 04:12:26,781 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-20 04:12:26,781 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 1 ~q_free~0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (not (<= ~p_dw_pc~0 0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= 1 ~p_num_write~0))) (.cse12 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse0 .cse4 .cse3 .cse5 .cse8) (or .cse9 .cse10 .cse1 .cse4 .cse3 .cse5 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse1 (not (<= ~p_num_write~0 .cse13)) .cse4 .cse5 .cse8 .cse12 (not (<= .cse13 ~p_num_write~0)))) (or .cse9 .cse4 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 (not (= 1 ~c_num_read~0)) .cse7) (or .cse9 .cse10 .cse1 .cse4 .cse5 .cse8 .cse11 .cse12))) [2020-07-20 04:12:26,781 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-20 04:12:26,781 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-20 04:12:26,782 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-20 04:12:26,782 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-20 04:12:26,782 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-20 04:12:26,782 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 1 ~q_free~0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (not (<= ~p_dw_pc~0 0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= 1 ~p_num_write~0))) (.cse12 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse0 .cse4 .cse3 .cse5 .cse8) (or .cse9 .cse10 .cse1 .cse4 .cse3 .cse5 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse1 (not (<= ~p_num_write~0 .cse13)) .cse4 .cse5 .cse8 .cse12 (not (<= .cse13 ~p_num_write~0)))) (or .cse9 .cse4 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 (not (= 1 ~c_num_read~0)) .cse7) (or .cse9 .cse10 .cse1 .cse4 .cse5 .cse8 .cse11 .cse12))) [2020-07-20 04:12:26,783 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse16 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse17 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse4 (= 0 ~p_dw_st~0))) (let ((.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 1 ~q_free~0))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (and (<= 2 ~c_dr_st~0) (or (and .cse16 .cse17) .cse4))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (<= ~p_dw_pc~0 0))) (.cse12 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse13 (not (= 0 ~q_free~0))) (.cse7 (and .cse16 (< 0 (+ immediate_notify_threads_~tmp~0 1)) .cse17 (<= immediate_notify_threads_~tmp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 ~c_num_read~0)) .cse8) (or .cse0 .cse1 .cse2 (not .cse9) .cse3 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse7 .cse8) (or .cse10 .cse3 .cse9 .cse11 .cse7) (or .cse10 .cse12 .cse1 .cse3 .cse11 .cse6 .cse13 .cse7) (let ((.cse15 (+ ~c_num_read~0 1))) (or .cse14 .cse0 .cse1 (not (<= ~p_num_write~0 .cse15)) .cse3 .cse11 .cse13 (not (<= .cse15 ~p_num_write~0)))) (or .cse14 .cse0 .cse3 .cse9 .cse11) (or .cse10 .cse12 .cse1 .cse3 .cse9 .cse6 .cse13 .cse7)))) [2020-07-20 04:12:26,783 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-20 04:12:26,783 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 04:12:26,783 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~c_num_read~0 |old(~c_num_read~0)|) (= ~p_dw_st~0 |old(~p_dw_st~0)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_free~0 |old(~q_free~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_dr_i~0 |old(~c_dr_i~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2020-07-20 04:12:26,783 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 04:12:26,784 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse40 (<= 1 ~q_free~0)) (.cse9 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse39 (= 1 ~p_dw_i~0)) (.cse41 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse42 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse28 (or (and .cse9 .cse40 .cse39) (and .cse9 .cse39 .cse41 .cse42))) (.cse34 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse36 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse37 (not (<= 1 |old(~q_free~0)|))) (.cse35 (not .cse39)) (.cse26 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse11 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse12 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse13 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse14 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse15 (= ~a_t~0 |old(~a_t~0)|)) (.cse16 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse17 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse18 (= 0 ~p_dw_st~0)) (.cse19 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse27 (= |old(~q_free~0)| ~q_free~0)) (.cse20 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (not (= 1 |old(~q_free~0)|))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (and (or (and .cse26 .cse9 .cse10 .cse39 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27) (and .cse26 .cse9 .cse10 .cse39 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse41 .cse27 .cse42)) .cse20)) (.cse4 (let ((.cse38 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse34 .cse38 .cse35 .cse36) (or .cse38 .cse37 .cse35)))) (.cse5 (not (<= |old(~p_dw_pc~0)| 0))) (.cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse24 (not (= 0 |old(~q_free~0)|))) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse30 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse22 (not (= 1 |old(~p_dw_pc~0)|))) (.cse23 (not (<= 2 |old(~p_dw_st~0)|))) (.cse25 (and (or .cse34 .cse35 .cse36) (or .cse37 .cse35))) (.cse29 (and .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28)) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse1 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 1 ~q_free~0)) .cse3 .cse4 .cse5 .cse21) (or .cse6 .cse22 (not (= 1 |old(~p_num_write~0)|)) .cse23 .cse24 .cse25 .cse8 (and .cse26 .cse11 .cse12 (= 1 ~p_num_write~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28)) (or .cse0 .cse22 (= 1 |old(~p_dw_st~0)|) .cse25 .cse29 .cse3) (or .cse30 .cse6 .cse22 .cse2 .cse3 .cse4 .cse31) (or .cse0 .cse6 .cse1 .cse7 .cse8 .cse2 .cse4 .cse5 .cse21) (let ((.cse32 (+ |old(~c_num_read~0)| 1))) (or .cse6 .cse22 .cse23 .cse24 (not (<= |old(~p_num_write~0)| .cse32)) .cse25 (not (<= .cse32 |old(~p_num_write~0)|)) (let ((.cse33 (+ ~c_num_read~0 1))) (and .cse26 (<= ~p_num_write~0 .cse33) .cse11 .cse12 .cse13 .cse14 (<= .cse33 ~p_num_write~0) .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28)) (not .cse0))) (or .cse30 .cse6 .cse22 .cse23 .cse25 .cse29 .cse3 .cse31))))) [2020-07-20 04:12:26,785 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse41 (= 1 ~p_dw_i~0))) (let ((.cse9 (= 1 |old(~c_dr_pc~0)|)) (.cse34 (+ |old(~c_num_read~0)| 1)) (.cse35 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse37 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse38 (not (<= 1 |old(~q_free~0)|))) (.cse36 (not .cse41)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse39 (= 1 ~p_dw_pc~0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse17 (or (and .cse41 (not (= ~p_dw_pc~0 ~q_free~0)) (not (= 0 ~q_free~0))) (and (<= 1 ~q_free~0) .cse41))) (.cse19 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse0 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse12 .cse39 .cse14 .cse17 .cse19)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse21 (not (= 0 |old(~c_num_read~0)|))) (.cse13 (<= ~p_dw_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~c_num_read~0)) (.cse18 (= 0 ~p_num_write~0)) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse29 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse23 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse24 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (= 1 ~q_free~0)) (.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse27 (let ((.cse40 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse35 .cse40 .cse36 .cse37) (or .cse40 .cse38 .cse36)))) (.cse26 (not (<= |old(~p_dw_pc~0)| 0))) (.cse33 (and .cse12 (not .cse14) .cse39 .cse17)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_dw_pc~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse32 (= 1 |old(~p_dw_st~0)|)) (.cse5 (not (<= |old(~p_num_write~0)| .cse34))) (.cse6 (and (or .cse35 .cse36 .cse37) (or .cse38 .cse36))) (.cse7 (not (<= .cse34 |old(~p_num_write~0)|))) (.cse30 (not (<= 2 |old(~c_dr_st~0)|))) (.cse8 (not .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21 (and .cse22 .cse15 .cse23 .cse16 .cse24 .cse18 .cse19 .cse20 .cse25) .cse26 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse2 .cse30 .cse8 .cse27 .cse31) (or .cse0 .cse1 .cse2 (not (= 1 |old(~p_num_write~0)|)) .cse3 .cse4 .cse6 .cse21) (or .cse0 .cse1 .cse10 .cse11 .cse21 (and .cse12 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18 .cse20 .cse19) .cse30 .cse8 .cse26 .cse27 .cse28) (or .cse29 .cse1 .cse2 .cse4 .cse32 .cse6 .cse30 .cse8 .cse31) (or .cse9 .cse33 .cse10 (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse12 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse22 .cse23 .cse24 .cse20 .cse25) .cse30 .cse27 .cse26) (or .cse9 .cse33 .cse2 .cse32 .cse6 .cse30) (or .cse1 .cse2 .cse4 .cse3 .cse32 .cse5 .cse6 .cse7 .cse30 .cse8))))) [2020-07-20 04:12:26,785 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-20 04:12:26,785 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-20 04:12:26,785 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-20 04:12:26,786 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse62 (<= 1 ~q_free~0)) (.cse57 (= 1 ~p_dw_i~0)) (.cse64 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse65 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse49 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse50 (= |old(~q_free~0)| ~q_free~0)) (.cse56 (+ |old(~c_num_read~0)| 1)) (.cse38 (= 0 ~q_free~0)) (.cse55 (or (and .cse62 .cse57) (and .cse57 .cse64 .cse65))) (.cse41 (<= 2 ~p_dw_st~0)) (.cse59 (<= ~c_num_read~0 ~p_num_write~0)) (.cse60 (<= ~p_num_write~0 ~c_num_read~0)) (.cse32 (<= 2 ~c_dr_st~0)) (.cse39 (= 1 ~p_dw_pc~0)) (.cse33 (= ~c_dr_pc~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse51 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse53 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse54 (not (<= 1 |old(~q_free~0)|))) (.cse52 (not .cse57)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse5 (let ((.cse63 (= 0 ~p_dw_st~0))) (or (and .cse62 .cse57 .cse63) (and .cse57 .cse63 .cse64 .cse65)))) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse34 (= 0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= 0 ~p_num_write~0)) (.cse14 (= 1 ~q_free~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse28 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse29 (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse36 .cse14 .cse15)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse18 (let ((.cse61 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse51 .cse61 .cse52 .cse53) (or .cse61 .cse54 .cse52)))) (.cse31 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse20 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse25 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse23 (and .cse59 .cse60 .cse32 .cse5 .cse39 .cse33 .cse37)) (.cse30 (not (= 0 |old(~c_num_read~0)|))) (.cse26 (and .cse59 .cse60 .cse32 .cse39 .cse55 .cse33 .cse37 .cse41)) (.cse27 (let ((.cse58 (+ ~c_num_read~0 1))) (and .cse38 (<= .cse58 ~p_num_write~0) (<= ~p_num_write~0 .cse58) .cse39 .cse55 .cse33 .cse37 .cse41))) (.cse40 (= 1 ~p_num_write~0)) (.cse21 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse43 (not (<= 2 |old(~p_dw_st~0)|))) (.cse42 (not (= 0 |old(~q_free~0)|))) (.cse44 (not (<= |old(~p_num_write~0)| .cse56))) (.cse48 (and .cse2 .cse49 .cse4 .cse39 .cse57 .cse6 .cse7 .cse37 .cse32 .cse8 .cse33 .cse10 .cse11 .cse13 .cse50 .cse15)) (.cse46 (not (<= .cse56 |old(~p_num_write~0)|))) (.cse24 (not .cse0)) (.cse22 (not (= 1 |old(~p_dw_pc~0)|))) (.cse47 (= 1 |old(~p_dw_st~0)|)) (.cse16 (and .cse32 (not (= 1 ~p_dw_st~0)) (not .cse33) .cse39 .cse55)) (.cse45 (and (or .cse51 .cse52 .cse53) (or .cse54 .cse52))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse22 .cse23 .cse17 .cse24 .cse18 .cse25 .cse26 .cse27) (or .cse21 .cse23 .cse28 .cse19 .cse26 .cse29 .cse1 .cse30 .cse17 .cse24 .cse18 .cse27 .cse31) (or .cse0 .cse21 .cse23 .cse28 .cse26 .cse19 .cse29 .cse1 (and .cse32 .cse3 .cse33 .cse5 .cse34 .cse35 .cse36 .cse14 .cse37) (and .cse38 .cse39 .cse34 .cse40 .cse37 .cse41) .cse30 .cse18 .cse27 .cse31) (or .cse21 .cse23 .cse22 .cse42 .cse43 .cse44 .cse45 .cse46 .cse24 .cse26 .cse27) (or .cse20 .cse21 .cse22 .cse43 .cse47 .cse48 .cse45 .cse17 .cse24 .cse25) (or .cse21 .cse23 .cse22 (not (= 1 |old(~p_num_write~0)|)) .cse42 .cse43 .cse45 .cse30 .cse26 .cse27 (and .cse49 .cse6 .cse7 .cse40 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse50 .cse15)) (or .cse21 .cse22 .cse43 .cse42 .cse47 .cse44 .cse48 .cse45 .cse46 .cse17 .cse24) (or .cse0 .cse22 .cse47 .cse16 .cse45 .cse17))))) [2020-07-20 04:12:26,787 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse35 (= 1 ~p_dw_i~0))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse28 (+ |old(~c_num_read~0)| 1)) (.cse29 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse31 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse32 (not (<= 1 |old(~q_free~0)|))) (.cse30 (not .cse35)) (.cse26 (= 0 ~q_free~0)) (.cse18 (= 1 ~p_dw_pc~0)) (.cse21 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (<= 2 ~p_dw_st~0))) (let ((.cse1 (not (= 1 |old(~q_free~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (not (= 0 |old(~c_num_read~0)|))) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse20 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse22 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse4 (not (<= |old(~p_dw_pc~0)| 0))) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse24 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse12 (let ((.cse34 (+ ~c_num_read~0 1))) (and .cse26 (<= .cse34 ~p_num_write~0) (<= ~p_num_write~0 .cse34) .cse18 .cse35 (= ~c_dr_pc~0 1) .cse21 .cse23))) (.cse3 (let ((.cse33 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse29 .cse33 .cse30 .cse31) (or .cse33 .cse32 .cse30)))) (.cse25 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= 1 |old(~p_dw_pc~0)|))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 0 |old(~q_free~0)|))) (.cse14 (= 1 |old(~p_dw_st~0)|)) (.cse9 (not (<= |old(~p_num_write~0)| .cse28))) (.cse10 (and (or .cse29 .cse30 .cse31) (or .cse32 .cse30))) (.cse11 (not (<= .cse28 |old(~p_num_write~0)|))) (.cse2 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (not .cse0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse6 .cse14 .cse10 .cse2) (or .cse5 .cse1 .cse15 .cse16 .cse12 .cse2 .cse3 .cse4 .cse17) (or .cse5 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 .cse8 (and (= ~c_num_read~0 |old(~c_num_read~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) .cse18 .cse19 .cse20 .cse21 (= |old(~q_free~0)| ~q_free~0) .cse22 .cse23) .cse10 .cse16 .cse12) (or .cse24 .cse5 .cse6 .cse7 .cse14 .cse10 .cse2 .cse13 .cse25) (let ((.cse27 (= 0 ~c_num_read~0))) (or .cse0 .cse5 .cse1 .cse15 (and .cse26 .cse18 .cse27 (= 1 ~p_num_write~0) .cse21 .cse23) .cse16 .cse12 (and .cse19 .cse27 .cse20 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0) .cse21 (= 1 ~q_free~0) .cse22) .cse4 .cse3 .cse17)) (or .cse24 .cse5 .cse6 .cse12 .cse2 .cse3 .cse25) (or .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse2 .cse13))))) [2020-07-20 04:12:26,787 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-20 04:12:26,787 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-20 04:12:26,787 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-20 04:12:26,788 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse61 (<= 1 ~q_free~0)) (.cse60 (= 1 ~p_dw_i~0)) (.cse63 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse64 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse45 (= 0 ~q_free~0)) (.cse54 (or (and .cse61 .cse60) (and .cse60 .cse63 .cse64))) (.cse47 (<= 2 ~p_dw_st~0)) (.cse56 (<= ~c_num_read~0 ~p_num_write~0)) (.cse57 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse58 (+ |old(~c_num_read~0)| 1)) (.cse50 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse52 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse53 (not (<= 1 |old(~q_free~0)|))) (.cse51 (not .cse60)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse5 (let ((.cse62 (= 0 ~p_dw_st~0))) (or (and .cse61 .cse60 .cse62) (and .cse60 .cse62 .cse63 .cse64)))) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse41 (= 0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse42 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (= 0 ~p_num_write~0)) (.cse14 (= 1 ~q_free~0)) (.cse2 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse48 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse46 (= 1 ~p_dw_pc~0)) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse44 (= ~p_last_write~0 ~q_buf_0~0)) (.cse39 (<= 2 ~c_dr_st~0)) (.cse8 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse40 (= ~c_dr_pc~0 1)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse49 (= |old(~q_free~0)| ~q_free~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse29 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse35 (and .cse2 .cse48 .cse4 .cse46 .cse60 .cse6 .cse7 .cse44 .cse39 .cse8 .cse10 .cse40 .cse11 .cse13 .cse49 .cse15)) (.cse21 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse23 (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse41 .cse12 .cse42 .cse13 .cse43 .cse14 .cse15)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse18 (let ((.cse59 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse50 .cse59 .cse51 .cse52) (or .cse59 .cse53 .cse51)))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse37 (not (<= |old(~p_num_write~0)| .cse58))) (.cse38 (not (<= .cse58 |old(~p_num_write~0)|))) (.cse26 (not .cse0)) (.cse20 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse24 (and .cse56 .cse57 .cse39 .cse46 .cse5 .cse40 .cse44)) (.cse36 (not (= 0 |old(~q_free~0)|))) (.cse32 (not (<= 2 |old(~p_dw_st~0)|))) (.cse25 (not (= 0 |old(~c_num_read~0)|))) (.cse22 (and .cse56 .cse57 .cse39 .cse46 .cse54 .cse40 .cse44 .cse47)) (.cse27 (let ((.cse55 (+ ~c_num_read~0 1))) (and .cse45 (<= .cse55 ~p_num_write~0) (<= ~p_num_write~0 .cse55) .cse46 .cse54 .cse40 .cse44 .cse47))) (.cse30 (not (= 1 |old(~p_dw_pc~0)|))) (.cse33 (= 1 |old(~p_dw_st~0)|)) (.cse16 (and .cse39 (not (= 1 ~p_dw_st~0)) (not .cse40) .cse46 .cse54)) (.cse34 (and (or .cse50 .cse51 .cse52) (or .cse53 .cse51))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse19 .cse22 .cse23 .cse1 .cse24 .cse25 .cse17 .cse26 .cse18 .cse27 .cse28) (or .cse29 .cse20 .cse30 .cse24 .cse17 .cse26 .cse18 .cse31 .cse22 .cse27) (or .cse29 .cse20 .cse30 .cse32 .cse33 .cse34 .cse17 .cse26 .cse31 .cse35) (or .cse20 .cse30 .cse32 .cse36 .cse33 .cse37 .cse34 .cse38 .cse17 .cse26 .cse35) (or .cse0 .cse20 .cse21 .cse22 .cse19 .cse23 .cse1 (and .cse39 .cse3 .cse40 .cse5 .cse41 .cse42 .cse43 .cse14 .cse44) .cse24 (and .cse45 .cse46 .cse41 (= 1 ~p_num_write~0) .cse44 .cse47) .cse25 .cse18 .cse27 .cse28) (or .cse20 .cse30 .cse24 .cse36 .cse32 .cse37 .cse34 .cse38 .cse26 .cse22 .cse27) (or .cse20 .cse30 (not (= 1 |old(~p_num_write~0)|)) .cse24 .cse36 .cse32 .cse34 .cse25 (and .cse2 .cse48 .cse4 .cse46 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse49 .cse15) .cse22 .cse27) (or .cse0 .cse30 .cse33 .cse16 .cse34 .cse17))))) [2020-07-20 04:12:26,788 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-20 04:12:26,789 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse62 (<= 1 ~q_free~0)) (.cse57 (= 1 ~p_dw_i~0)) (.cse64 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse65 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse49 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse50 (= |old(~q_free~0)| ~q_free~0)) (.cse56 (+ |old(~c_num_read~0)| 1)) (.cse38 (= 0 ~q_free~0)) (.cse55 (or (and .cse62 .cse57) (and .cse57 .cse64 .cse65))) (.cse41 (<= 2 ~p_dw_st~0)) (.cse59 (<= ~c_num_read~0 ~p_num_write~0)) (.cse60 (<= ~p_num_write~0 ~c_num_read~0)) (.cse32 (<= 2 ~c_dr_st~0)) (.cse39 (= 1 ~p_dw_pc~0)) (.cse33 (= ~c_dr_pc~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse51 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse53 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse54 (not (<= 1 |old(~q_free~0)|))) (.cse52 (not .cse57)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse5 (let ((.cse63 (= 0 ~p_dw_st~0))) (or (and .cse62 .cse57 .cse63) (and .cse57 .cse63 .cse64 .cse65)))) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse34 (= 0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= 0 ~p_num_write~0)) (.cse14 (= 1 ~q_free~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse28 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse29 (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse36 .cse14 .cse15)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse18 (let ((.cse61 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse51 .cse61 .cse52 .cse53) (or .cse61 .cse54 .cse52)))) (.cse31 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse20 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse25 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse23 (and .cse59 .cse60 .cse32 .cse5 .cse39 .cse33 .cse37)) (.cse30 (not (= 0 |old(~c_num_read~0)|))) (.cse26 (and .cse59 .cse60 .cse32 .cse39 .cse55 .cse33 .cse37 .cse41)) (.cse27 (let ((.cse58 (+ ~c_num_read~0 1))) (and .cse38 (<= .cse58 ~p_num_write~0) (<= ~p_num_write~0 .cse58) .cse39 .cse55 .cse33 .cse37 .cse41))) (.cse40 (= 1 ~p_num_write~0)) (.cse21 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse43 (not (<= 2 |old(~p_dw_st~0)|))) (.cse42 (not (= 0 |old(~q_free~0)|))) (.cse44 (not (<= |old(~p_num_write~0)| .cse56))) (.cse48 (and .cse2 .cse49 .cse4 .cse39 .cse57 .cse6 .cse7 .cse37 .cse32 .cse8 .cse33 .cse10 .cse11 .cse13 .cse50 .cse15)) (.cse46 (not (<= .cse56 |old(~p_num_write~0)|))) (.cse24 (not .cse0)) (.cse22 (not (= 1 |old(~p_dw_pc~0)|))) (.cse47 (= 1 |old(~p_dw_st~0)|)) (.cse16 (and .cse32 (not (= 1 ~p_dw_st~0)) (not .cse33) .cse39 .cse55)) (.cse45 (and (or .cse51 .cse52 .cse53) (or .cse54 .cse52))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse22 .cse23 .cse17 .cse24 .cse18 .cse25 .cse26 .cse27) (or .cse21 .cse23 .cse28 .cse19 .cse26 .cse29 .cse1 .cse30 .cse17 .cse24 .cse18 .cse27 .cse31) (or .cse0 .cse21 .cse23 .cse28 .cse26 .cse19 .cse29 .cse1 (and .cse32 .cse3 .cse33 .cse5 .cse34 .cse35 .cse36 .cse14 .cse37) (and .cse38 .cse39 .cse34 .cse40 .cse37 .cse41) .cse30 .cse18 .cse27 .cse31) (or .cse21 .cse23 .cse22 .cse42 .cse43 .cse44 .cse45 .cse46 .cse24 .cse26 .cse27) (or .cse20 .cse21 .cse22 .cse43 .cse47 .cse48 .cse45 .cse17 .cse24 .cse25) (or .cse21 .cse23 .cse22 (not (= 1 |old(~p_num_write~0)|)) .cse42 .cse43 .cse45 .cse30 .cse26 .cse27 (and .cse49 .cse6 .cse7 .cse40 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse50 .cse15)) (or .cse21 .cse22 .cse43 .cse42 .cse47 .cse44 .cse48 .cse45 .cse46 .cse17 .cse24) (or .cse0 .cse22 .cse47 .cse16 .cse45 .cse17))))) [2020-07-20 04:12:26,789 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-20 04:12:26,789 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-20 04:12:26,790 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-20 04:12:26,790 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-20 04:12:26,790 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-20 04:12:26,790 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-20 04:12:26,790 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-20 04:12:26,790 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (not (<= ~p_dw_pc~0 0))) (.cse3 (not (<= 2 ~c_dr_st~0))) (.cse7 (not (= 1 ~p_dw_pc~0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse8 (not (= 1 ~q_free~0))) (.cse6 (not (= 1 ~p_num_write~0))) (.cse4 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))) (.cse9 (not (= 1 ~c_num_read~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= 0 ~c_num_read~0)) .cse5 .cse1 .cse2 .cse6 (not (= 0 ~q_free~0)) .cse4) (or .cse7 .cse5 (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse8 .cse6 .cse4 .cse9 .cse10) (or .cse7 .cse1 .cse2 .cse3 .cse4) (or .cse7 .cse5 .cse1 .cse2 .cse8 .cse6 (not (<= 2 ~p_dw_st~0)) .cse4 .cse9 .cse10))) [2020-07-20 04:12:26,791 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-20 04:12:26,791 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-20 04:12:26,791 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-20 04:12:26,791 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-20 04:12:26,791 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-20 04:12:26,791 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-20 04:12:26,792 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 1 ~q_free~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 04:12:26,792 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-20 04:12:26,792 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-20 04:12:26,792 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse20 (<= 1 ~q_free~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse21 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_dw_pc~0 0)) (.cse2 (let ((.cse22 (= 0 ~p_dw_st~0))) (or (and .cse20 .cse19 .cse22) (and .cse19 .cse22 (not (= ~p_dw_pc~0 ~q_free~0)) .cse21)))) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse6 (= 0 ~p_num_write~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~q_free~0)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse10 ~p_num_write~0) (<= ~p_num_write~0 .cse10) .cse11 .cse3 .cse8 .cse12)) (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse0 .cse1 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse2 .cse13 .cse14 .cse15 .cse7 .cse16) (and .cse17 .cse18 .cse0 .cse2 .cse11 .cse8) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not .cse19) (and .cse17 .cse18 .cse0 .cse11 .cse8 .cse12) (and .cse9 .cse11 .cse4 (= 1 ~p_num_write~0) .cse8 .cse12) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 (not (= 1 ~p_dw_st~0)) (not .cse3) .cse11 (or .cse20 .cse21)) (and .cse1 .cse2 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse7 .cse16) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))))) [2020-07-20 04:12:26,793 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse20 (<= 1 ~q_free~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse21 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_dw_pc~0 0)) (.cse2 (let ((.cse22 (= 0 ~p_dw_st~0))) (or (and .cse20 .cse19 .cse22) (and .cse19 .cse22 (not (= ~p_dw_pc~0 ~q_free~0)) .cse21)))) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse6 (= 0 ~p_num_write~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~q_free~0)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse10 ~p_num_write~0) (<= ~p_num_write~0 .cse10) .cse11 .cse3 .cse8 .cse12)) (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse0 .cse1 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse2 .cse13 .cse14 .cse15 .cse7 .cse16) (and .cse17 .cse18 .cse0 .cse2 .cse11 .cse8) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not .cse19) (and .cse17 .cse18 .cse0 .cse11 .cse8 .cse12) (and .cse9 .cse11 .cse4 (= 1 ~p_num_write~0) .cse8 .cse12) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 (not (= 1 ~p_dw_st~0)) (not .cse3) .cse11 (or .cse20 .cse21)) (and .cse1 .cse2 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse7 .cse16) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))))) [2020-07-20 04:12:26,793 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-20 04:12:26,793 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-20 04:12:26,793 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse20 (<= 1 ~q_free~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse21 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_dw_pc~0 0)) (.cse2 (let ((.cse22 (= 0 ~p_dw_st~0))) (or (and .cse20 .cse19 .cse22) (and .cse19 .cse22 (not (= ~p_dw_pc~0 ~q_free~0)) .cse21)))) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse6 (= 0 ~p_num_write~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~q_free~0)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse10 ~p_num_write~0) (<= ~p_num_write~0 .cse10) .cse11 .cse3 .cse8 .cse12)) (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse0 .cse1 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse2 .cse13 .cse14 .cse15 .cse7 .cse16) (and .cse17 .cse18 .cse0 .cse2 .cse11 .cse8) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not .cse19) (and .cse17 .cse18 .cse0 .cse11 .cse8 .cse12) (and .cse9 .cse11 .cse4 (= 1 ~p_num_write~0) .cse8 .cse12) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 (not (= 1 ~p_dw_st~0)) (not .cse3) .cse11 (or .cse20 .cse21)) (and .cse1 .cse2 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse7 .cse16) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))))) [2020-07-20 04:12:26,794 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 1 ~q_free~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 04:12:26,794 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-20 04:12:26,794 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 04:12:26,794 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (not (= ~c_dr_pc~0 1)) (not (= 1 ~p_dw_i~0)) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) [2020-07-20 04:12:26,795 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 04:12:26,795 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 04:12:26,795 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-20 04:12:26,795 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-20 04:12:26,795 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-20 04:12:26,795 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-20 04:12:26,795 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-20 04:12:26,796 INFO L264 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse1 (not (= 0 ~c_num_read~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= 0 ~q_free~0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse3 (and (<= 0 is_do_write_p_triggered_~__retres1~0) (<= is_do_write_p_triggered_~__retres1~0 0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse7 (not (<= 2 ~c_dr_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (or .cse0 .cse3 .cse4 .cse8 .cse7))) [2020-07-20 04:12:26,796 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-20 04:12:26,796 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-20 04:12:26,796 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse14 (<= 2 ~p_dw_st~0)) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse11 (not (<= 2 |old(~p_dw_st~0)|))) (.cse12 (not (= 0 |old(~q_free~0)|))) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (<= 2 ~c_dr_st~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 0 ~p_dw_st~0)) (.cse10 (= 1 ~q_free~0)) (.cse13 (not (= 1 ~p_dw_i~0))) (.cse17 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (<= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 (not (<= ~p_num_write~0 .cse3)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse14) (not .cse15))) (let ((.cse16 (= 1 ~c_num_read~0))) (or .cse0 (and .cse16 .cse6 .cse7 .cse8 .cse10 .cse14) .cse1 .cse2 (and .cse16 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse17 (not (= 1 ~p_num_write~0)))) (or (not (<= ~p_dw_pc~0 0)) .cse15 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (and .cse6 .cse7 (= 0 ~c_num_read~0) .cse8 .cse9 .cse10) .cse13 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse17 (not (= 0 ~p_num_write~0))))) [2020-07-20 04:12:26,796 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-20 04:12:26,797 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse7 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 .cse6 (not (<= ~p_num_write~0 .cse3)) (not .cse7))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse7 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse8 (not (= 0 ~p_num_write~0))))) [2020-07-20 04:12:26,797 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse17 (= 1 ~p_dw_i~0))) (let ((.cse20 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (not .cse17)) (.cse10 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse13 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (= 1 ~q_free~0)) (.cse16 (= 1 ~p_dw_pc~0))) (let ((.cse0 (not .cse16)) (.cse7 (or (and .cse16 .cse17 (= ~c_dr_pc~0 1) .cse19) (and .cse10 .cse16 .cse17 .cse13 .cse19))) (.cse8 (<= 2 ~p_dw_st~0)) (.cse2 (and (or (= |old(~q_free~0)| ~p_dw_pc~0) .cse25) (or (not (<= 1 |old(~q_free~0)|)) .cse25))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse24 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not .cse20)) (.cse11 (= ~a_t~0 |old(~a_t~0)|)) (.cse12 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse14 (= 0 ~c_num_read~0)) (.cse15 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= 0 ~p_dw_st~0)) (.cse9 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse5 (= 1 ~c_num_read~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8) .cse9 (and .cse10 (= 0 ~q_free~0) .cse11 (= ~c_last_read~0 |old(~c_last_read~0)|) .cse12 .cse13 .cse14 .cse15) (not (= 1 ~p_num_write~0)) (and .cse5 .cse16 .cse17 .cse6 .cse18 .cse19 .cse20))) (let ((.cse23 (+ |old(~c_num_read~0)| 1)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0))) (or .cse0 (and .cse21 .cse22 .cse6 .cse7 .cse8) .cse1 .cse2 (not (<= .cse23 ~p_num_write~0)) .cse4 .cse3 (not (<= ~p_num_write~0 .cse23)) (and .cse21 .cse22 .cse16 .cse17 .cse6 .cse18 .cse19 .cse20) (not .cse24))) (or (not (<= ~p_dw_pc~0 0)) .cse24 .cse1 (and .cse11 .cse13 .cse12 .cse14 .cse15 .cse6 .cse18 .cse19) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse25 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse9 (not (= 0 ~p_num_write~0))))))) [2020-07-20 04:12:26,798 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse7 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 .cse6 (not (<= ~p_num_write~0 .cse3)) (not .cse7) (and (= ~c_num_read~0 |old(~c_num_read~0)|) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_pc~0 1) (= ~c_last_read~0 |old(~c_last_read~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~q_free~0)| ~q_free~0)))) (or .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse7 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse8 (not (= 0 ~p_num_write~0))))) [2020-07-20 04:12:26,798 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-20 04:12:26,798 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-20 04:12:26,798 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse17 (= 1 ~p_dw_i~0))) (let ((.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse3 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse8 (not (= 1 ~p_dw_pc~0))) (.cse9 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= 0 |old(~q_free~0)|))) (.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse0 (= ~a_t~0 |old(~a_t~0)|)) (.cse13 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse1 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse2 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse14 (= |old(~q_free~0)| ~q_free~0)) (.cse15 (let ((.cse18 (= ~c_num_read~0 |old(~c_num_read~0)|))) (or (and .cse18 (<= 1 ~q_free~0) .cse17) (and .cse18 .cse17 (not (= ~p_dw_pc~0 ~q_free~0)))))) (.cse6 (not .cse17)) (.cse4 (= 1 |old(~c_dr_pc~0)|))) (and (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 1 ~q_free~0)) (not (<= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse7 (not (= 0 ~p_num_write~0))) (or .cse8 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7 (not (= 1 ~p_num_write~0)) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15)) (let ((.cse16 (+ |old(~c_num_read~0)| 1))) (or .cse8 .cse9 .cse5 (not (<= .cse16 ~p_num_write~0)) .cse10 .cse11 (and .cse12 (= ~c_dr_pc~0 1) .cse0 .cse13 .cse1 .cse2 .cse14 .cse15) .cse6 (not (<= ~p_num_write~0 .cse16)) (not .cse4)))))) [2020-07-20 04:12:26,798 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-20 04:12:26,799 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse7 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 .cse6 (not (<= ~p_num_write~0 .cse3)) (not .cse7))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse7 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse8 (not (= 0 ~p_num_write~0))))) [2020-07-20 04:12:26,799 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-20 04:12:26,799 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-20 04:12:26,799 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 1 ~q_free~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse12 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= 1 ~p_dw_i~0))) (.cse13 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 (not (<= ~p_num_write~0 .cse3)) (not .cse12))) (or .cse0 .cse12 .cse1 .cse2 (and .cse6 (= 1 ~c_num_read~0) (not .cse7) .cse9 .cse8 .cse10) .cse4 .cse5 .cse11 .cse13 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse12 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse11 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse13 (not (= 0 ~p_num_write~0))))) [2020-07-20 04:12:26,799 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-20 04:12:26,800 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-20 04:12:26,800 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-20 04:12:26,800 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 ~p_dw_st~0)) (not (= 0 |old(~q_free~0)|)) (and (= |old(~c_dr_i~0)| ~c_dr_i~0) (= 0 ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 04:12:26,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 04:12:26 BoogieIcfgContainer [2020-07-20 04:12:26,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 04:12:26,949 INFO L168 Benchmark]: Toolchain (without parser) took 81471.49 ms. Allocated memory was 137.4 MB in the beginning and 871.9 MB in the end (delta: 734.5 MB). Free memory was 100.7 MB in the beginning and 699.5 MB in the end (delta: -598.8 MB). Peak memory consumption was 732.6 MB. Max. memory is 7.1 GB. [2020-07-20 04:12:26,950 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 137.4 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-20 04:12:26,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.79 ms. Allocated memory is still 137.4 MB. Free memory was 100.2 MB in the beginning and 88.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2020-07-20 04:12:26,951 INFO L168 Benchmark]: Boogie Preprocessor took 187.92 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 88.1 MB in the beginning and 180.1 MB in the end (delta: -92.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-20 04:12:26,952 INFO L168 Benchmark]: RCFGBuilder took 724.87 ms. Allocated memory is still 202.9 MB. Free memory was 180.1 MB in the beginning and 153.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-20 04:12:26,953 INFO L168 Benchmark]: TraceAbstraction took 80067.03 ms. Allocated memory was 202.9 MB in the beginning and 871.9 MB in the end (delta: 669.0 MB). Free memory was 152.8 MB in the beginning and 699.5 MB in the end (delta: -546.7 MB). Peak memory consumption was 719.2 MB. Max. memory is 7.1 GB. [2020-07-20 04:12:26,956 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 137.4 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 479.79 ms. Allocated memory is still 137.4 MB. Free memory was 100.2 MB in the beginning and 88.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 187.92 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 88.1 MB in the beginning and 180.1 MB in the end (delta: -92.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 724.87 ms. Allocated memory is still 202.9 MB. Free memory was 180.1 MB in the beginning and 153.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80067.03 ms. Allocated memory was 202.9 MB in the beginning and 871.9 MB in the end (delta: 669.0 MB). Free memory was 152.8 MB in the beginning and 699.5 MB in the end (delta: -546.7 MB). Peak memory consumption was 719.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((1 == \old(c_dr_pc) || !(1 == \old(q_free))) || (((((((((((((c_num_read == \old(c_num_read) && p_dw_pc <= 0) && p_num_write == \old(p_num_write)) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || !(2 <= \old(c_dr_st))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_dw_pc) <= 0)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_num_write) <= \old(c_num_read))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || 1 == \old(p_dw_st)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read))) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && a_t == \old(a_t)) && c_dr_pc == 1) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || 1 == \old(p_dw_st)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && a_t == \old(a_t)) && c_dr_pc == 1) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && (((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && c_dr_pc == 1) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || (((((0 == q_free && 1 == p_dw_pc) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(1 == \old(c_dr_pc))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(1 == \old(p_num_write))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(0 == \old(c_num_read))) || ((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((1 == \old(c_dr_pc) || !(1 == \old(p_dw_pc))) || 1 == \old(p_dw_st)) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(1 == p_dw_pc) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 <= p_num_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(p_num_write <= \old(c_num_read) + 1)) || !(1 == \old(c_dr_pc))) || (((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && a_t == \old(a_t)) && c_dr_pc == 1) && c_last_read == \old(c_last_read)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free)) && ((((((((!(1 == p_dw_pc) || 1 == \old(c_dr_pc)) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(1 == p_num_write))) && ((((((((!(p_dw_pc <= 0) || 1 == \old(c_dr_pc)) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(\old(p_num_write) <= c_num_read)) || !(c_num_read <= \old(p_num_write))) || !(c_dr_pc == 1)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || ((((0 == q_free && 1 == p_dw_pc) && p_num_write <= c_num_read + 1) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0)) && (((((((((((((((((\old(p_dw_st) == p_dw_st && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)) || !(0 == c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || c_dr_pc == 1) || (((((\old(p_dw_st) == p_dw_st && 0 == q_free) && p_dw_pc <= 0) && c_dr_st == \old(c_dr_st)) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0))) && (((((((\old(p_dw_st) == p_dw_st && p_dw_pc <= 0) && c_dr_st == \old(c_dr_st)) || !(1 == \old(q_free))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((!(1 == \old(p_dw_pc)) || (2 <= c_dr_st && 1 == p_dw_pc)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st)))) && (((((((((((((((((\old(p_dw_st) == p_dw_st && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)) || !(0 == c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || (((0 == q_free && p_dw_pc <= 0) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || ((\old(q_free) == p_dw_pc || !(1 == p_dw_i)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || (((1 == c_num_read && c_last_read == p_last_write) && ((((1 == p_dw_pc && 1 == p_dw_i) && c_dr_pc == 1) && 1 == q_free) || ((((\old(p_dw_st) == p_dw_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && 1 == q_free))) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || (((((((\old(p_dw_st) == p_dw_st && 0 == q_free) && a_t == \old(a_t)) && c_last_read == \old(c_last_read)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc))) || !(1 == p_num_write)) || ((((((1 == c_num_read && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) && (((((((((!(1 == p_dw_pc) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && ((((1 == p_dw_pc && 1 == p_dw_i) && c_dr_pc == 1) && 1 == q_free) || ((((\old(p_dw_st) == p_dw_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && 1 == q_free))) && 2 <= p_dw_st)) || !(p_last_write == q_buf_0)) || ((\old(q_free) == p_dw_pc || !(1 == p_dw_i)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= p_num_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(p_num_write <= \old(c_num_read) + 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == \old(c_dr_pc)))) && (((((((((!(p_dw_pc <= 0) || 1 == \old(c_dr_pc)) || !(p_last_write == q_buf_0)) || (((((((a_t == \old(a_t) && c_dr_st == \old(c_dr_st)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == p_dw_i)) || !(1 == p_num_write)) || !(0 == q_free)) || !(2 <= c_dr_st)) && (((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == p_num_write)) || !(0 == q_free))) && ((((!(p_dw_pc <= 0) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(2 <= c_dr_st)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((((c_num_read == \old(c_num_read) && 2 <= c_dr_st) && p_dw_pc <= 0) && p_num_write == \old(p_num_write)) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((0 == q_free && 1 == p_dw_pc) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && (1 <= q_free || !(p_dw_st == q_free)))) || ((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && p_last_write == q_buf_0) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((1 == \old(c_dr_pc) || !(1 == \old(q_free))) || (((((((((((((c_num_read == \old(c_num_read) && p_dw_pc <= 0) && p_num_write == \old(p_num_write)) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || !(2 <= \old(c_dr_st))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_dw_pc) <= 0)) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_num_write) <= \old(c_num_read))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && c_dr_pc == 1) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || (((((0 == q_free && 1 == p_dw_pc) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(1 == \old(p_dw_pc))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(1 == \old(c_dr_pc))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || 1 == \old(p_dw_st)) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && c_dr_pc == 1) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(1 == \old(p_dw_pc))) || !(1 == \old(p_num_write))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(0 == \old(c_num_read))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((((((((\old(p_dw_st) == p_dw_st && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && 1 == p_num_write) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || 1 == \old(p_dw_st)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && c_dr_pc == 1) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc)))) && (((((1 == \old(c_dr_pc) || !(1 == \old(p_dw_pc))) || 1 == \old(p_dw_st)) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(\old(p_num_write) <= c_num_read)) || !(c_num_read <= \old(p_num_write))) || !(c_dr_pc == 1)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || (((((0 == q_free && p_num_write <= \old(p_num_write) + 1) && 1 == p_dw_pc) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) && (((((!(1 == \old(q_free)) || ((((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && 1 == p_dw_i) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || ((((0 == q_free && 1 == p_dw_pc) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || ((((0 == q_free && 1 == p_dw_pc) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(c_last_read == \old(p_last_write))) || c_dr_pc == 1) || !(\old(p_dw_pc) <= 0))) && ((((!(1 == \old(p_dw_pc)) || ((((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && 1 == p_dw_i) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((!(p_dw_pc <= 0) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(2 <= c_dr_st)) || (__retres1 <= 0 && 0 <= __retres1)) && (((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == p_num_write)) || !(0 == q_free)) || (__retres1 <= 0 && 0 <= __retres1))) && (((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == q_free)) || !(1 == p_num_write)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_num_read)) || !(c_last_read == p_last_write))) && ((((!(1 == p_dw_pc) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(2 <= c_dr_st)) || (__retres1 <= 0 && 0 <= __retres1))) && (((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == q_free)) || !(1 == p_num_write)) || !(2 <= p_dw_st)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_num_read)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((!(1 == p_dw_pc) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 <= p_num_write)) || ((((((p_num_write <= c_num_read && c_num_read <= p_num_write) && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(p_num_write <= \old(c_num_read) + 1)) || ((((((p_num_write <= c_num_read && c_num_read <= p_num_write) && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) && (((((((((!(1 == p_dw_pc) || (((((1 == c_num_read && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st)) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || (((((1 == c_num_read && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(1 == p_num_write))) && (((((((((!(p_dw_pc <= 0) || 1 == \old(c_dr_pc)) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || (((((2 <= c_dr_st && c_dr_pc == 1) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || (((((((\old(p_dw_st) == p_dw_st && q_buf_0 == \old(q_buf_0)) && c_dr_st == \old(c_dr_st)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && p_last_write == q_buf_0) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) && ((((!(1 == \old(p_dw_pc)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || (((2 <= c_dr_st && 1 == p_dw_pc) && 1 == p_dw_i) && !(0 == q_free)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(\old(p_num_write) <= c_num_read)) || !(c_num_read <= \old(p_num_write))) || !(c_dr_pc == 1)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || ((((((((((\old(p_dw_st) == p_dw_st && p_num_write <= c_num_read) && c_num_read <= p_num_write) && q_buf_0 == \old(q_buf_0)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && !(0 == q_free)) && p_last_write == q_buf_0) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || (((((((\old(p_dw_st) == p_dw_st && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && c_dr_st == \old(c_dr_st)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || c_dr_pc == 1) || !(\old(p_dw_pc) <= 0))) && (((((!(1 == \old(q_free)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) || ((((\old(p_dw_st) == p_dw_st && p_dw_pc <= 0) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && !(0 == q_free))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 34.9s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 44.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2088 SDtfs, 4974 SDslu, 2213 SDs, 0 SdLazy, 10320 SolverSat, 2049 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 623 SyntacticMatches, 3 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 6.0s 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: 2.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 1555 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3013 PreInvPairs, 3531 NumberOfFragments, 13008 HoareAnnotationTreeSize, 3013 FomulaSimplifications, 38236070 FormulaSimplificationTreeSizeReduction, 8.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 1290290 FormulaSimplificationTreeSizeReductionInter, 36.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1466 ConstructedInterpolants, 0 QuantifiedInterpolants, 380667 SizeOfPredicates, 9 NumberOfNonLiveVariables, 882 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 310/340 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...