./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6d225bacde2ff4b43f974edb4824451ea41bcc5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:13:25,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:13:25,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:13:25,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:13:25,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:13:25,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:13:25,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:13:25,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:13:25,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:13:25,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:13:25,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:13:25,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:13:25,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:13:25,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:13:25,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:13:25,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:13:25,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:13:25,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:13:25,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:13:25,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:13:25,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:13:25,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:13:25,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:13:25,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:13:25,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:13:25,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:13:25,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:13:25,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:13:25,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:13:25,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:13:25,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:13:25,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:13:25,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:13:25,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:13:25,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:13:25,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:13:25,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:13:25,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:13:25,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:13:25,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:13:25,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:13:25,729 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:13:25,767 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:13:25,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:13:25,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:13:25,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:13:25,769 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:13:25,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:13:25,770 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:13:25,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:13:25,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:13:25,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:13:25,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:13:25,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:13:25,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:13:25,771 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:13:25,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:13:25,772 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:13:25,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:13:25,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:13:25,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:13:25,773 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:13:25,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:13:25,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:13:25,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:13:25,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:13:25,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:13:25,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:13:25,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:13:25,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:13:25,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:13:25,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6d225bacde2ff4b43f974edb4824451ea41bcc5 [2020-11-28 03:13:26,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:13:26,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:13:26,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:13:26,126 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:13:26,127 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:13:26,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2020-11-28 03:13:26,225 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/data/dadcf7832/48ded14c46294ea18e80d975acb7cce8/FLAG73d918f95 [2020-11-28 03:13:26,773 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:13:26,774 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2020-11-28 03:13:26,791 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/data/dadcf7832/48ded14c46294ea18e80d975acb7cce8/FLAG73d918f95 [2020-11-28 03:13:27,142 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/data/dadcf7832/48ded14c46294ea18e80d975acb7cce8 [2020-11-28 03:13:27,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:13:27,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:13:27,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:13:27,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:13:27,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:13:27,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53539348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27, skipping insertion in model container [2020-11-28 03:13:27,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:13:27,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:13:27,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:13:27,505 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:13:27,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:13:27,566 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:13:27,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27 WrapperNode [2020-11-28 03:13:27,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:13:27,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:13:27,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:13:27,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:13:27,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:13:27,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:13:27,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:13:27,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:13:27,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... [2020-11-28 03:13:27,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:13:27,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:13:27,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:13:27,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:13:27,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/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-11-28 03:13:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:13:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:13:27,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:13:27,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:13:28,546 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:13:28,546 INFO L298 CfgBuilder]: Removed 62 assume(true) statements. [2020-11-28 03:13:28,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:28 BoogieIcfgContainer [2020-11-28 03:13:28,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:13:28,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:13:28,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:13:28,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:13:28,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:13:27" (1/3) ... [2020-11-28 03:13:28,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2081f2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:28, skipping insertion in model container [2020-11-28 03:13:28,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:27" (2/3) ... [2020-11-28 03:13:28,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2081f2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:28, skipping insertion in model container [2020-11-28 03:13:28,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:28" (3/3) ... [2020-11-28 03:13:28,590 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2020-11-28 03:13:28,602 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:13:28,607 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:13:28,621 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-28 03:13:28,663 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:13:28,663 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:13:28,663 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:13:28,663 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:13:28,664 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:13:28,664 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:13:28,664 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:13:28,664 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:13:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2020-11-28 03:13:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:13:28,700 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:28,702 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] [2020-11-28 03:13:28,703 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:28,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1850595735, now seen corresponding path program 1 times [2020-11-28 03:13:28,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:28,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063651475] [2020-11-28 03:13:28,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:28,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063651475] [2020-11-28 03:13:28,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:28,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:28,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740747307] [2020-11-28 03:13:28,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:28,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:28,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:28,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:28,949 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2020-11-28 03:13:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:29,106 INFO L93 Difference]: Finished difference Result 268 states and 421 transitions. [2020-11-28 03:13:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:29,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-28 03:13:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:29,135 INFO L225 Difference]: With dead ends: 268 [2020-11-28 03:13:29,136 INFO L226 Difference]: Without dead ends: 174 [2020-11-28 03:13:29,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-28 03:13:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2020-11-28 03:13:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-11-28 03:13:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2020-11-28 03:13:29,260 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 39 [2020-11-28 03:13:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:29,261 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2020-11-28 03:13:29,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2020-11-28 03:13:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:13:29,267 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:29,268 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] [2020-11-28 03:13:29,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:13:29,269 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:29,273 INFO L82 PathProgramCache]: Analyzing trace with hash 32121210, now seen corresponding path program 1 times [2020-11-28 03:13:29,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:29,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718263265] [2020-11-28 03:13:29,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:29,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718263265] [2020-11-28 03:13:29,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:29,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:13:29,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359210302] [2020-11-28 03:13:29,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:13:29,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:13:29,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:29,417 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand 5 states. [2020-11-28 03:13:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:29,630 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2020-11-28 03:13:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:13:29,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-11-28 03:13:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:29,643 INFO L225 Difference]: With dead ends: 540 [2020-11-28 03:13:29,643 INFO L226 Difference]: Without dead ends: 400 [2020-11-28 03:13:29,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:13:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-11-28 03:13:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 176. [2020-11-28 03:13:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-28 03:13:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2020-11-28 03:13:29,701 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 39 [2020-11-28 03:13:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:29,702 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2020-11-28 03:13:29,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:13:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2020-11-28 03:13:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:13:29,716 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:29,716 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] [2020-11-28 03:13:29,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:13:29,717 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash 94160824, now seen corresponding path program 1 times [2020-11-28 03:13:29,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:29,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912407419] [2020-11-28 03:13:29,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:29,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912407419] [2020-11-28 03:13:29,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:29,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:29,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857488438] [2020-11-28 03:13:29,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:29,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:29,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:29,876 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand 4 states. [2020-11-28 03:13:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:30,091 INFO L93 Difference]: Finished difference Result 466 states and 666 transitions. [2020-11-28 03:13:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:13:30,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-28 03:13:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:30,095 INFO L225 Difference]: With dead ends: 466 [2020-11-28 03:13:30,096 INFO L226 Difference]: Without dead ends: 331 [2020-11-28 03:13:30,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-11-28 03:13:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 246. [2020-11-28 03:13:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-11-28 03:13:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 343 transitions. [2020-11-28 03:13:30,148 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 343 transitions. Word has length 39 [2020-11-28 03:13:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:30,149 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 343 transitions. [2020-11-28 03:13:30,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 343 transitions. [2020-11-28 03:13:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:13:30,160 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:30,160 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] [2020-11-28 03:13:30,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:13:30,161 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:30,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:30,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1899983882, now seen corresponding path program 1 times [2020-11-28 03:13:30,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:30,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583570813] [2020-11-28 03:13:30,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:30,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583570813] [2020-11-28 03:13:30,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:30,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:30,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359219880] [2020-11-28 03:13:30,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:30,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:30,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:30,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:30,298 INFO L87 Difference]: Start difference. First operand 246 states and 343 transitions. Second operand 3 states. [2020-11-28 03:13:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:30,367 INFO L93 Difference]: Finished difference Result 626 states and 868 transitions. [2020-11-28 03:13:30,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:30,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-28 03:13:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:30,371 INFO L225 Difference]: With dead ends: 626 [2020-11-28 03:13:30,371 INFO L226 Difference]: Without dead ends: 466 [2020-11-28 03:13:30,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-11-28 03:13:30,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2020-11-28 03:13:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2020-11-28 03:13:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 635 transitions. [2020-11-28 03:13:30,403 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 635 transitions. Word has length 39 [2020-11-28 03:13:30,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:30,403 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 635 transitions. [2020-11-28 03:13:30,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 635 transitions. [2020-11-28 03:13:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-28 03:13:30,407 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:30,407 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] [2020-11-28 03:13:30,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:13:30,408 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash -909810677, now seen corresponding path program 1 times [2020-11-28 03:13:30,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:30,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047454628] [2020-11-28 03:13:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:30,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047454628] [2020-11-28 03:13:30,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:30,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:30,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110874629] [2020-11-28 03:13:30,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:30,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:30,477 INFO L87 Difference]: Start difference. First operand 462 states and 635 transitions. Second operand 3 states. [2020-11-28 03:13:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:30,534 INFO L93 Difference]: Finished difference Result 1090 states and 1499 transitions. [2020-11-28 03:13:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:30,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-11-28 03:13:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:30,539 INFO L225 Difference]: With dead ends: 1090 [2020-11-28 03:13:30,540 INFO L226 Difference]: Without dead ends: 738 [2020-11-28 03:13:30,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-11-28 03:13:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 714. [2020-11-28 03:13:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2020-11-28 03:13:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 959 transitions. [2020-11-28 03:13:30,582 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 959 transitions. Word has length 40 [2020-11-28 03:13:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:30,582 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 959 transitions. [2020-11-28 03:13:30,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 959 transitions. [2020-11-28 03:13:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-28 03:13:30,584 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:30,584 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] [2020-11-28 03:13:30,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:13:30,584 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash -956850666, now seen corresponding path program 1 times [2020-11-28 03:13:30,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:30,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738475453] [2020-11-28 03:13:30,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:30,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738475453] [2020-11-28 03:13:30,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:30,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:30,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638812503] [2020-11-28 03:13:30,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:30,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:30,638 INFO L87 Difference]: Start difference. First operand 714 states and 959 transitions. Second operand 3 states. [2020-11-28 03:13:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:30,755 INFO L93 Difference]: Finished difference Result 1966 states and 2646 transitions. [2020-11-28 03:13:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:30,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-11-28 03:13:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:30,764 INFO L225 Difference]: With dead ends: 1966 [2020-11-28 03:13:30,764 INFO L226 Difference]: Without dead ends: 1257 [2020-11-28 03:13:30,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2020-11-28 03:13:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1237. [2020-11-28 03:13:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2020-11-28 03:13:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1648 transitions. [2020-11-28 03:13:30,863 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1648 transitions. Word has length 40 [2020-11-28 03:13:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:30,864 INFO L481 AbstractCegarLoop]: Abstraction has 1237 states and 1648 transitions. [2020-11-28 03:13:30,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1648 transitions. [2020-11-28 03:13:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-28 03:13:30,865 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:30,866 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] [2020-11-28 03:13:30,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:13:30,866 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:30,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1951308042, now seen corresponding path program 1 times [2020-11-28 03:13:30,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:30,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945335317] [2020-11-28 03:13:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:30,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945335317] [2020-11-28 03:13:30,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:30,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:30,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40742919] [2020-11-28 03:13:30,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:30,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:30,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:30,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:30,930 INFO L87 Difference]: Start difference. First operand 1237 states and 1648 transitions. Second operand 3 states. [2020-11-28 03:13:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:31,056 INFO L93 Difference]: Finished difference Result 2929 states and 3880 transitions. [2020-11-28 03:13:31,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:31,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-11-28 03:13:31,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:31,070 INFO L225 Difference]: With dead ends: 2929 [2020-11-28 03:13:31,070 INFO L226 Difference]: Without dead ends: 1729 [2020-11-28 03:13:31,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2020-11-28 03:13:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1705. [2020-11-28 03:13:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2020-11-28 03:13:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2236 transitions. [2020-11-28 03:13:31,205 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2236 transitions. Word has length 45 [2020-11-28 03:13:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:31,206 INFO L481 AbstractCegarLoop]: Abstraction has 1705 states and 2236 transitions. [2020-11-28 03:13:31,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2236 transitions. [2020-11-28 03:13:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-28 03:13:31,208 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:31,209 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:31,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:13:31,209 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1660744042, now seen corresponding path program 1 times [2020-11-28 03:13:31,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:31,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335863924] [2020-11-28 03:13:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:31,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335863924] [2020-11-28 03:13:31,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:31,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:31,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099493546] [2020-11-28 03:13:31,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:31,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:31,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:31,279 INFO L87 Difference]: Start difference. First operand 1705 states and 2236 transitions. Second operand 4 states. [2020-11-28 03:13:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:31,407 INFO L93 Difference]: Finished difference Result 1993 states and 2618 transitions. [2020-11-28 03:13:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:13:31,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-11-28 03:13:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:31,423 INFO L225 Difference]: With dead ends: 1993 [2020-11-28 03:13:31,423 INFO L226 Difference]: Without dead ends: 1991 [2020-11-28 03:13:31,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2020-11-28 03:13:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1703. [2020-11-28 03:13:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2020-11-28 03:13:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2227 transitions. [2020-11-28 03:13:31,550 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2227 transitions. Word has length 46 [2020-11-28 03:13:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:31,552 INFO L481 AbstractCegarLoop]: Abstraction has 1703 states and 2227 transitions. [2020-11-28 03:13:31,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2227 transitions. [2020-11-28 03:13:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-28 03:13:31,553 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:31,554 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:31,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:13:31,556 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:31,557 INFO L82 PathProgramCache]: Analyzing trace with hash -56555803, now seen corresponding path program 1 times [2020-11-28 03:13:31,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:31,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014936336] [2020-11-28 03:13:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:31,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014936336] [2020-11-28 03:13:31,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095504616] [2020-11-28 03:13:31,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/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-11-28 03:13:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:31,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 03:13:31,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:13:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:31,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:13:31,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-28 03:13:31,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090426454] [2020-11-28 03:13:31,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:13:31,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:31,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:13:31,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:13:31,891 INFO L87 Difference]: Start difference. First operand 1703 states and 2227 transitions. Second operand 6 states. [2020-11-28 03:13:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:32,186 INFO L93 Difference]: Finished difference Result 3615 states and 4764 transitions. [2020-11-28 03:13:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:13:32,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2020-11-28 03:13:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:32,208 INFO L225 Difference]: With dead ends: 3615 [2020-11-28 03:13:32,208 INFO L226 Difference]: Without dead ends: 3613 [2020-11-28 03:13:32,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:13:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2020-11-28 03:13:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3021. [2020-11-28 03:13:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3021 states. [2020-11-28 03:13:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 3971 transitions. [2020-11-28 03:13:32,451 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 3971 transitions. Word has length 47 [2020-11-28 03:13:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:32,453 INFO L481 AbstractCegarLoop]: Abstraction has 3021 states and 3971 transitions. [2020-11-28 03:13:32,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:13:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3971 transitions. [2020-11-28 03:13:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:13:32,456 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:32,456 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:32,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-11-28 03:13:32,684 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2073247729, now seen corresponding path program 2 times [2020-11-28 03:13:32,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:32,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225742158] [2020-11-28 03:13:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:32,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225742158] [2020-11-28 03:13:32,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:32,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:32,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166414589] [2020-11-28 03:13:32,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:32,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:32,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:32,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:32,746 INFO L87 Difference]: Start difference. First operand 3021 states and 3971 transitions. Second operand 3 states. [2020-11-28 03:13:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:32,976 INFO L93 Difference]: Finished difference Result 4413 states and 5844 transitions. [2020-11-28 03:13:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:32,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-28 03:13:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:32,990 INFO L225 Difference]: With dead ends: 4413 [2020-11-28 03:13:32,990 INFO L226 Difference]: Without dead ends: 2271 [2020-11-28 03:13:32,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2020-11-28 03:13:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2261. [2020-11-28 03:13:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2020-11-28 03:13:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2929 transitions. [2020-11-28 03:13:33,159 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2929 transitions. Word has length 50 [2020-11-28 03:13:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:33,159 INFO L481 AbstractCegarLoop]: Abstraction has 2261 states and 2929 transitions. [2020-11-28 03:13:33,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2929 transitions. [2020-11-28 03:13:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-28 03:13:33,161 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:33,162 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:33,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:13:33,162 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1744624096, now seen corresponding path program 1 times [2020-11-28 03:13:33,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:33,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674509503] [2020-11-28 03:13:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:13:33,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674509503] [2020-11-28 03:13:33,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:33,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:33,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141516330] [2020-11-28 03:13:33,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:33,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:33,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:33,227 INFO L87 Difference]: Start difference. First operand 2261 states and 2929 transitions. Second operand 4 states. [2020-11-28 03:13:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:33,582 INFO L93 Difference]: Finished difference Result 6497 states and 8385 transitions. [2020-11-28 03:13:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:13:33,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-11-28 03:13:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:33,607 INFO L225 Difference]: With dead ends: 6497 [2020-11-28 03:13:33,607 INFO L226 Difference]: Without dead ends: 4369 [2020-11-28 03:13:33,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2020-11-28 03:13:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 4335. [2020-11-28 03:13:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4335 states. [2020-11-28 03:13:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 5521 transitions. [2020-11-28 03:13:33,978 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 5521 transitions. Word has length 54 [2020-11-28 03:13:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:33,979 INFO L481 AbstractCegarLoop]: Abstraction has 4335 states and 5521 transitions. [2020-11-28 03:13:33,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 5521 transitions. [2020-11-28 03:13:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-28 03:13:33,983 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:33,983 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:33,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:13:33,984 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:33,985 INFO L82 PathProgramCache]: Analyzing trace with hash 550871454, now seen corresponding path program 1 times [2020-11-28 03:13:33,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:33,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483584340] [2020-11-28 03:13:33,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-28 03:13:34,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483584340] [2020-11-28 03:13:34,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:34,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:34,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167216727] [2020-11-28 03:13:34,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:34,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:34,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:34,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:34,046 INFO L87 Difference]: Start difference. First operand 4335 states and 5521 transitions. Second operand 4 states. [2020-11-28 03:13:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:34,477 INFO L93 Difference]: Finished difference Result 7753 states and 9875 transitions. [2020-11-28 03:13:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:13:34,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-28 03:13:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:34,504 INFO L225 Difference]: With dead ends: 7753 [2020-11-28 03:13:34,504 INFO L226 Difference]: Without dead ends: 4373 [2020-11-28 03:13:34,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2020-11-28 03:13:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4099. [2020-11-28 03:13:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4099 states. [2020-11-28 03:13:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 5131 transitions. [2020-11-28 03:13:34,890 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 5131 transitions. Word has length 62 [2020-11-28 03:13:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:34,891 INFO L481 AbstractCegarLoop]: Abstraction has 4099 states and 5131 transitions. [2020-11-28 03:13:34,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 5131 transitions. [2020-11-28 03:13:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-28 03:13:34,899 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:34,899 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:34,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:13:34,900 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:34,902 INFO L82 PathProgramCache]: Analyzing trace with hash -897301022, now seen corresponding path program 1 times [2020-11-28 03:13:34,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:34,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428832176] [2020-11-28 03:13:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-28 03:13:34,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428832176] [2020-11-28 03:13:34,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:34,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:13:34,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658521175] [2020-11-28 03:13:34,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:13:34,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:13:34,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:13:34,978 INFO L87 Difference]: Start difference. First operand 4099 states and 5131 transitions. Second operand 6 states. [2020-11-28 03:13:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:35,420 INFO L93 Difference]: Finished difference Result 6541 states and 8149 transitions. [2020-11-28 03:13:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-28 03:13:35,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2020-11-28 03:13:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:35,436 INFO L225 Difference]: With dead ends: 6541 [2020-11-28 03:13:35,436 INFO L226 Difference]: Without dead ends: 2561 [2020-11-28 03:13:35,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-11-28 03:13:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2020-11-28 03:13:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2056. [2020-11-28 03:13:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2020-11-28 03:13:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2538 transitions. [2020-11-28 03:13:35,622 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2538 transitions. Word has length 89 [2020-11-28 03:13:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:35,624 INFO L481 AbstractCegarLoop]: Abstraction has 2056 states and 2538 transitions. [2020-11-28 03:13:35,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:13:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2538 transitions. [2020-11-28 03:13:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-28 03:13:35,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:35,631 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:35,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:13:35,633 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1187170510, now seen corresponding path program 1 times [2020-11-28 03:13:35,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:35,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835402804] [2020-11-28 03:13:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-11-28 03:13:35,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835402804] [2020-11-28 03:13:35,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:35,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:35,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784987655] [2020-11-28 03:13:35,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:35,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:35,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:35,669 INFO L87 Difference]: Start difference. First operand 2056 states and 2538 transitions. Second operand 3 states. [2020-11-28 03:13:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:35,771 INFO L93 Difference]: Finished difference Result 2058 states and 2539 transitions. [2020-11-28 03:13:35,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:35,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-11-28 03:13:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:35,782 INFO L225 Difference]: With dead ends: 2058 [2020-11-28 03:13:35,782 INFO L226 Difference]: Without dead ends: 1569 [2020-11-28 03:13:35,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2020-11-28 03:13:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2020-11-28 03:13:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-11-28 03:13:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1947 transitions. [2020-11-28 03:13:35,921 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1947 transitions. Word has length 91 [2020-11-28 03:13:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:35,921 INFO L481 AbstractCegarLoop]: Abstraction has 1569 states and 1947 transitions. [2020-11-28 03:13:35,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1947 transitions. [2020-11-28 03:13:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-28 03:13:35,924 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:35,925 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:35,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:13:35,925 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1665450509, now seen corresponding path program 1 times [2020-11-28 03:13:35,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:35,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45969190] [2020-11-28 03:13:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-28 03:13:35,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45969190] [2020-11-28 03:13:35,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:35,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:35,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539153519] [2020-11-28 03:13:35,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:35,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:35,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:35,972 INFO L87 Difference]: Start difference. First operand 1569 states and 1947 transitions. Second operand 3 states. [2020-11-28 03:13:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:36,068 INFO L93 Difference]: Finished difference Result 2545 states and 3158 transitions. [2020-11-28 03:13:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:36,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-11-28 03:13:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:36,087 INFO L225 Difference]: With dead ends: 2545 [2020-11-28 03:13:36,093 INFO L226 Difference]: Without dead ends: 1095 [2020-11-28 03:13:36,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-11-28 03:13:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1026. [2020-11-28 03:13:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2020-11-28 03:13:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1255 transitions. [2020-11-28 03:13:36,186 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1255 transitions. Word has length 102 [2020-11-28 03:13:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:36,186 INFO L481 AbstractCegarLoop]: Abstraction has 1026 states and 1255 transitions. [2020-11-28 03:13:36,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1255 transitions. [2020-11-28 03:13:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-28 03:13:36,189 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:36,189 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:36,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:13:36,190 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:36,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:36,190 INFO L82 PathProgramCache]: Analyzing trace with hash 60413158, now seen corresponding path program 1 times [2020-11-28 03:13:36,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:36,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911626024] [2020-11-28 03:13:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 03:13:36,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911626024] [2020-11-28 03:13:36,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:36,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:36,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761594135] [2020-11-28 03:13:36,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:36,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:36,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:36,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:36,258 INFO L87 Difference]: Start difference. First operand 1026 states and 1255 transitions. Second operand 3 states. [2020-11-28 03:13:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:36,372 INFO L93 Difference]: Finished difference Result 1802 states and 2227 transitions. [2020-11-28 03:13:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:36,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-11-28 03:13:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:36,384 INFO L225 Difference]: With dead ends: 1802 [2020-11-28 03:13:36,384 INFO L226 Difference]: Without dead ends: 1014 [2020-11-28 03:13:36,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2020-11-28 03:13:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 920. [2020-11-28 03:13:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-11-28 03:13:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1104 transitions. [2020-11-28 03:13:36,479 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1104 transitions. Word has length 104 [2020-11-28 03:13:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:36,480 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 1104 transitions. [2020-11-28 03:13:36,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1104 transitions. [2020-11-28 03:13:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-28 03:13:36,485 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:36,486 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:36,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:13:36,486 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1950390027, now seen corresponding path program 1 times [2020-11-28 03:13:36,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:36,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772509456] [2020-11-28 03:13:36,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-28 03:13:36,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772509456] [2020-11-28 03:13:36,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:36,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:13:36,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383786352] [2020-11-28 03:13:36,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:13:36,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:36,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:13:36,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:13:36,572 INFO L87 Difference]: Start difference. First operand 920 states and 1104 transitions. Second operand 4 states. [2020-11-28 03:13:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:36,718 INFO L93 Difference]: Finished difference Result 1775 states and 2123 transitions. [2020-11-28 03:13:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:13:36,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2020-11-28 03:13:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:36,721 INFO L225 Difference]: With dead ends: 1775 [2020-11-28 03:13:36,722 INFO L226 Difference]: Without dead ends: 893 [2020-11-28 03:13:36,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2020-11-28 03:13:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 872. [2020-11-28 03:13:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2020-11-28 03:13:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1033 transitions. [2020-11-28 03:13:36,816 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1033 transitions. Word has length 104 [2020-11-28 03:13:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:36,816 INFO L481 AbstractCegarLoop]: Abstraction has 872 states and 1033 transitions. [2020-11-28 03:13:36,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:13:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1033 transitions. [2020-11-28 03:13:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-28 03:13:36,819 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:36,820 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:36,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:13:36,820 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2146905671, now seen corresponding path program 1 times [2020-11-28 03:13:36,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:36,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404530406] [2020-11-28 03:13:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-28 03:13:36,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404530406] [2020-11-28 03:13:36,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:36,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:13:36,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28082720] [2020-11-28 03:13:36,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:13:36,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:36,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:13:36,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:13:36,908 INFO L87 Difference]: Start difference. First operand 872 states and 1033 transitions. Second operand 5 states. [2020-11-28 03:13:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:37,107 INFO L93 Difference]: Finished difference Result 2004 states and 2354 transitions. [2020-11-28 03:13:37,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:13:37,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2020-11-28 03:13:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:37,111 INFO L225 Difference]: With dead ends: 2004 [2020-11-28 03:13:37,111 INFO L226 Difference]: Without dead ends: 861 [2020-11-28 03:13:37,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:13:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-11-28 03:13:37,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 571. [2020-11-28 03:13:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2020-11-28 03:13:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 658 transitions. [2020-11-28 03:13:37,177 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 658 transitions. Word has length 105 [2020-11-28 03:13:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:37,177 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 658 transitions. [2020-11-28 03:13:37,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:13:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 658 transitions. [2020-11-28 03:13:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-11-28 03:13:37,180 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:37,181 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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] [2020-11-28 03:13:37,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:13:37,182 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:37,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:37,182 INFO L82 PathProgramCache]: Analyzing trace with hash 418386111, now seen corresponding path program 1 times [2020-11-28 03:13:37,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:37,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982278737] [2020-11-28 03:13:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-11-28 03:13:37,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982278737] [2020-11-28 03:13:37,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:37,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:37,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976188387] [2020-11-28 03:13:37,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:37,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:37,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:37,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:37,261 INFO L87 Difference]: Start difference. First operand 571 states and 658 transitions. Second operand 3 states. [2020-11-28 03:13:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:37,336 INFO L93 Difference]: Finished difference Result 743 states and 849 transitions. [2020-11-28 03:13:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:37,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-11-28 03:13:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:37,338 INFO L225 Difference]: With dead ends: 743 [2020-11-28 03:13:37,338 INFO L226 Difference]: Without dead ends: 290 [2020-11-28 03:13:37,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-28 03:13:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-11-28 03:13:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-11-28 03:13:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 314 transitions. [2020-11-28 03:13:37,368 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 314 transitions. Word has length 158 [2020-11-28 03:13:37,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:37,369 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 314 transitions. [2020-11-28 03:13:37,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 314 transitions. [2020-11-28 03:13:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-28 03:13:37,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:37,372 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:13:37,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:13:37,372 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1214361389, now seen corresponding path program 1 times [2020-11-28 03:13:37,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:37,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059954354] [2020-11-28 03:13:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-28 03:13:37,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059954354] [2020-11-28 03:13:37,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:13:37,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:13:37,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357191542] [2020-11-28 03:13:37,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:13:37,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:37,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:13:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:37,437 INFO L87 Difference]: Start difference. First operand 290 states and 314 transitions. Second operand 3 states. [2020-11-28 03:13:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:37,480 INFO L93 Difference]: Finished difference Result 487 states and 529 transitions. [2020-11-28 03:13:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:13:37,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-11-28 03:13:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:37,481 INFO L225 Difference]: With dead ends: 487 [2020-11-28 03:13:37,481 INFO L226 Difference]: Without dead ends: 288 [2020-11-28 03:13:37,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:13:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-11-28 03:13:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2020-11-28 03:13:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-11-28 03:13:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 307 transitions. [2020-11-28 03:13:37,509 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 307 transitions. Word has length 159 [2020-11-28 03:13:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:37,510 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 307 transitions. [2020-11-28 03:13:37,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:13:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 307 transitions. [2020-11-28 03:13:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-11-28 03:13:37,512 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:13:37,512 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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-11-28 03:13:37,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 03:13:37,513 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:13:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:13:37,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1149090725, now seen corresponding path program 1 times [2020-11-28 03:13:37,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:13:37,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547873299] [2020-11-28 03:13:37,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:13:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 46 proven. 59 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-28 03:13:37,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547873299] [2020-11-28 03:13:37,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71215233] [2020-11-28 03:13:37,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/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-11-28 03:13:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:13:37,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-28 03:13:37,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:13:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-28 03:13:38,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:13:38,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2020-11-28 03:13:38,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452114513] [2020-11-28 03:13:38,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 03:13:38,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:13:38,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 03:13:38,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:13:38,028 INFO L87 Difference]: Start difference. First operand 288 states and 307 transitions. Second operand 9 states. [2020-11-28 03:13:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:13:38,142 INFO L93 Difference]: Finished difference Result 539 states and 577 transitions. [2020-11-28 03:13:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 03:13:38,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2020-11-28 03:13:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:13:38,143 INFO L225 Difference]: With dead ends: 539 [2020-11-28 03:13:38,143 INFO L226 Difference]: Without dead ends: 0 [2020-11-28 03:13:38,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:13:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-28 03:13:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-28 03:13:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-28 03:13:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-28 03:13:38,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2020-11-28 03:13:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:13:38,146 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:13:38,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 03:13:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-28 03:13:38,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-28 03:13:38,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:13:38,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-28 03:13:38,779 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 138 [2020-11-28 03:13:38,893 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2020-11-28 03:13:39,131 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 127 [2020-11-28 03:13:39,872 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 135 [2020-11-28 03:13:40,061 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2020-11-28 03:13:40,733 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 136 [2020-11-28 03:13:42,449 WARN L193 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2020-11-28 03:13:42,956 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2020-11-28 03:13:43,376 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2020-11-28 03:13:44,881 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2020-11-28 03:13:45,443 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-11-28 03:13:45,988 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-11-28 03:13:46,563 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-11-28 03:13:47,174 WARN L193 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2020-11-28 03:13:47,739 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2020-11-28 03:13:48,165 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-11-28 03:13:48,554 WARN L193 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2020-11-28 03:13:49,618 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2020-11-28 03:13:50,175 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-11-28 03:13:50,825 WARN L193 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2020-11-28 03:13:51,076 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 39 [2020-11-28 03:13:51,609 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2020-11-28 03:13:52,096 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2020-11-28 03:13:52,504 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2020-11-28 03:13:53,039 WARN L193 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2020-11-28 03:13:53,244 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-11-28 03:13:53,732 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2020-11-28 03:13:54,179 WARN L193 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-11-28 03:13:55,276 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2020-11-28 03:13:55,280 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-28 03:13:55,280 INFO L274 CegarLoopResult]: For program point L267-1(lines 266 279) no Hoare annotation was computed. [2020-11-28 03:13:55,280 INFO L270 CegarLoopResult]: At program point L234-1(lines 267 271) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-11-28 03:13:55,280 INFO L274 CegarLoopResult]: For program point L267-2(lines 267 271) no Hoare annotation was computed. [2020-11-28 03:13:55,281 INFO L274 CegarLoopResult]: For program point L267-4(lines 266 279) no Hoare annotation was computed. [2020-11-28 03:13:55,281 INFO L270 CegarLoopResult]: At program point L69(lines 53 71) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ~p_num_write~0 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-11-28 03:13:55,281 INFO L270 CegarLoopResult]: At program point L69-1(lines 53 71) the Hoare annotation is: (let ((.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~q_read_ev~0 1)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse8 (= ~q_free~0 1)) (.cse11 (= ~c_dr_pc~0 1)) (.cse14 (= ~p_dw_pc~0 1)) (.cse16 (= ~q_read_ev~0 2)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse7 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse10 (= ~p_dw_i~0 1)) (.cse15 (= ~q_free~0 0)) (.cse1 (not (= ~c_dr_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (not (= ~q_write_ev~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse11 .cse1 .cse13 .cse2 .cse14 .cse4 .cse9) (and .cse4 (or (and .cse15 .cse16 .cse1 .cse3 .cse2 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse16 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (and .cse3 .cse5 .cse8 .cse10 .cse12 .cse11 .cse0 .cse1 .cse13 .cse2 .cse14 .cse4 .cse9) (let ((.cse17 (+ ~c_num_read~0 1))) (and (or (and .cse15 .cse1 .cse16 .cse3 .cse2 .cse5 .cse6 .cse7 .cse10 .cse11) (and .cse1 .cse16 .cse3 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11)) (<= .cse17 ~p_num_write~0) (<= ~p_num_write~0 .cse17) .cse14 .cse4)) (and .cse16 .cse3 .cse5 .cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse7 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) .cse10 (= ~c_num_read~0 0) .cse15 .cse1 .cse2 .cse4 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)))) [2020-11-28 03:13:55,281 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-28 03:13:55,282 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-11-28 03:13:55,282 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-28 03:13:55,282 INFO L274 CegarLoopResult]: For program point L251(lines 251 256) no Hoare annotation was computed. [2020-11-28 03:13:55,282 INFO L274 CegarLoopResult]: For program point L251-1(lines 251 256) no Hoare annotation was computed. [2020-11-28 03:13:55,282 INFO L277 CegarLoopResult]: At program point L466(lines 457 468) the Hoare annotation is: true [2020-11-28 03:13:55,282 INFO L274 CegarLoopResult]: For program point L285-1(lines 284 297) no Hoare annotation was computed. [2020-11-28 03:13:55,282 INFO L274 CegarLoopResult]: For program point L285-3(lines 284 297) no Hoare annotation was computed. [2020-11-28 03:13:55,282 INFO L274 CegarLoopResult]: For program point L120(lines 120 128) no Hoare annotation was computed. [2020-11-28 03:13:55,282 INFO L270 CegarLoopResult]: At program point L87(lines 75 89) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-11-28 03:13:55,282 INFO L270 CegarLoopResult]: At program point L87-1(lines 75 89) the Hoare annotation is: (let ((.cse16 (= ~p_dw_st~0 0))) (let ((.cse15 (= ~q_read_ev~0 1)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse11 (not (= ~q_write_ev~0 0))) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse8 (= ~q_free~0 0)) (.cse0 (= ~q_read_ev~0 2)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not .cse16)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse6 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse12 (= ~q_free~0 1)) (.cse19 (not (= ~q_write_ev~0 1))) (.cse7 (= ~p_dw_i~0 1)) (.cse14 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 0) .cse7 (= ~c_num_read~0 0) .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)) (and .cse5 .cse12 .cse13 .cse7 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10 .cse18 .cse11 .cse19) (let ((.cse20 (+ ~c_num_read~0 1))) (and (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 .cse20) .cse18 .cse11 (or (and .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse6 .cse12 .cse7 .cse14) (and .cse8 .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse6 .cse7 .cse14)))) (and .cse15 .cse9 .cse10 .cse2 .cse11 .cse3 .cse5 .cse12 .cse19 .cse7 .cse14) (and .cse2 .cse3 .cse5 .cse12 .cse13 .cse7 .cse14 .cse9 .cse17 .cse10 .cse18 .cse11 .cse19) (and .cse11 .cse5 (or (and .cse8 .cse9 .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse6 .cse19 .cse7 .cse14) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse4 .cse6 .cse12 .cse19 .cse7 .cse14)))))) [2020-11-28 03:13:55,283 INFO L277 CegarLoopResult]: At program point L434(lines 397 439) the Hoare annotation is: true [2020-11-28 03:13:55,283 INFO L270 CegarLoopResult]: At program point L88(lines 72 90) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~p_num_write~0 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-11-28 03:13:55,283 INFO L270 CegarLoopResult]: At program point L88-1(lines 72 90) the Hoare annotation is: (let ((.cse20 (= ~p_dw_st~0 0))) (let ((.cse2 (= ~q_free~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse16 (= ~q_read_ev~0 1)) (.cse6 (not .cse20)) (.cse8 (= ~q_req_up~0 0)) (.cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse14 (= ~q_free~0 1)) (.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~p_dw_pc~0 1)) (.cse0 (not (= ~q_write_ev~0 0))) (.cse11 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse4 .cse3 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13)) .cse15) (and .cse4 .cse5 .cse6 .cse8 .cse9 .cse1 .cse10 .cse15 (= ~c_dr_pc~0 0) .cse12 (= ~c_num_read~0 0) .cse2 .cse3 .cse7 .cse0 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)) (and .cse16 .cse3 .cse7 .cse6 .cse0 .cse8 .cse1 .cse15 .cse14 .cse11 .cse12 .cse13) (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) (<= ~p_num_write~0 .cse17) .cse18 .cse0 (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13)))) (and .cse1 .cse15 .cse14 .cse19 .cse12 .cse13 .cse16 .cse3 .cse20 .cse21 .cse7 .cse18 .cse0 .cse11) (and .cse6 .cse8 .cse1 .cse15 .cse14 .cse19 .cse12 .cse13 .cse3 .cse21 .cse7 .cse18 .cse0 .cse11)))) [2020-11-28 03:13:55,283 INFO L274 CegarLoopResult]: For program point L336(lines 336 340) no Hoare annotation was computed. [2020-11-28 03:13:55,283 INFO L274 CegarLoopResult]: For program point L336-1(lines 331 371) no Hoare annotation was computed. [2020-11-28 03:13:55,283 INFO L274 CegarLoopResult]: For program point L386(lines 386 391) no Hoare annotation was computed. [2020-11-28 03:13:55,283 INFO L274 CegarLoopResult]: For program point L123(lines 123 127) no Hoare annotation was computed. [2020-11-28 03:13:55,283 INFO L274 CegarLoopResult]: For program point L57(lines 57 66) no Hoare annotation was computed. [2020-11-28 03:13:55,283 INFO L274 CegarLoopResult]: For program point L57-2(lines 57 66) no Hoare annotation was computed. [2020-11-28 03:13:55,283 INFO L274 CegarLoopResult]: For program point L57-3(lines 57 66) no Hoare annotation was computed. [2020-11-28 03:13:55,284 INFO L274 CegarLoopResult]: For program point L57-5(lines 57 66) no Hoare annotation was computed. [2020-11-28 03:13:55,284 INFO L270 CegarLoopResult]: At program point L272-1(lines 263 280) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-11-28 03:13:55,284 INFO L274 CegarLoopResult]: For program point L173(lines 172 203) no Hoare annotation was computed. [2020-11-28 03:13:55,284 INFO L270 CegarLoopResult]: At program point L272-3(lines 263 280) the Hoare annotation is: (let ((.cse7 (not (= ~q_write_ev~0 1))) (.cse6 (= ~q_free~0 1)) (.cse11 (= ~q_free~0 0)) (.cse0 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_read_ev~0 2)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~c_dr_pc~0 1)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (not (= ~q_write_ev~0 0)))) (or (and .cse0 (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_num_read~0 ~p_num_write~0) .cse9) (and .cse10 .cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) .cse8 (= ~c_num_read~0 0) .cse11 .cse0 .cse1 .cse4 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)) (and (or (and .cse11 .cse0 .cse10 .cse2 .cse1 .cse5 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse4) (let ((.cse12 (+ ~c_num_read~0 1))) (and (<= .cse12 ~p_num_write~0) (or (and .cse0 .cse10 .cse1 .cse2 .cse5 .cse6 .cse8 .cse9) (and .cse11 .cse0 .cse10 .cse2 .cse1 .cse5 .cse8 .cse9)) (<= ~p_num_write~0 .cse12) .cse3 .cse4)))) [2020-11-28 03:13:55,285 INFO L270 CegarLoopResult]: At program point L454(lines 440 456) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-11-28 03:13:55,285 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-28 03:13:55,285 INFO L274 CegarLoopResult]: For program point L190(lines 190 202) no Hoare annotation was computed. [2020-11-28 03:13:55,285 INFO L274 CegarLoopResult]: For program point L58(lines 58 63) no Hoare annotation was computed. [2020-11-28 03:13:55,285 INFO L274 CegarLoopResult]: For program point L58-1(lines 58 63) no Hoare annotation was computed. [2020-11-28 03:13:55,285 INFO L270 CegarLoopResult]: At program point L372(lines 324 377) the Hoare annotation is: (let ((.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse16 (= ~q_free~0 1)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_req_up~0 1)) (.cse0 (= ~q_read_ev~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse19 (= ~c_dr_pc~0 0)) (.cse2 (= ~p_dw_i~0 1)) (.cse20 (= ~c_num_read~0 0)) (.cse4 (= ~q_free~0 0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not (= ~q_write_ev~0 0))) (.cse21 (<= ~p_num_write~0 1)) (.cse22 (<= 1 ~p_num_write~0)) (.cse11 (not (= ~q_write_ev~0 1)))) (or (let ((.cse5 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 ~p_num_write~0) .cse6 .cse7 (<= ~p_num_write~0 .cse5) .cse8 .cse9 .cse10 .cse11)) (and .cse1 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse2 .cse3 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11) (and (or (and .cse4 .cse7 .cse0 .cse1 .cse8 .cse13 .cse11 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse1 .cse13 .cse16 .cse11 .cse2 .cse3)) .cse10) (and .cse6 .cse7 .cse18 .cse8 .cse1 .cse9 .cse10 .cse16 .cse11 .cse2 .cse17 .cse3) (and .cse0 .cse1 .cse12 .cse14 .cse15 .cse19 .cse2 .cse20 .cse4 .cse6 .cse7 .cse8 .cse21 .cse22 (= ~q_write_ev~0 ~q_read_ev~0)) (and .cse0 .cse1 .cse12 .cse13 .cse14 .cse15 .cse19 .cse2 .cse20 .cse4 .cse7 .cse8 .cse10 .cse21 .cse22 .cse11))) [2020-11-28 03:13:55,286 INFO L274 CegarLoopResult]: For program point L174-1(lines 174 184) no Hoare annotation was computed. [2020-11-28 03:13:55,286 INFO L270 CegarLoopResult]: At program point L356(lines 331 371) the Hoare annotation is: (let ((.cse22 (= ~p_dw_st~0 0)) (.cse31 (+ ~c_num_read~0 1))) (let ((.cse5 (<= .cse31 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 .cse31)) (.cse19 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_req_up~0 1)) (.cse1 (not .cse22)) (.cse24 (= ~c_dr_pc~0 0)) (.cse4 (= ~q_free~0 0)) (.cse11 (not (= ~q_write_ev~0 0))) (.cse29 (<= ~p_num_write~0 1)) (.cse30 (<= 1 ~p_num_write~0)) (.cse12 (not (= ~q_write_ev~0 1))) (.cse20 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse0 (= ~q_read_ev~0 2)) (.cse21 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= ~q_req_up~0 0)) (.cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= ~p_num_write~0 0)) (.cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse17 (= ~q_free~0 1)) (.cse2 (= ~p_dw_i~0 1)) (.cse25 (= ~c_num_read~0 0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse26 (= ~p_dw_pc~0 0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (= ~q_write_ev~0 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse2 .cse3 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12) (and .cse5 (or (and .cse20 .cse0 .cse9 .cse1 .cse21 .cse14 .cse17 .cse12 .cse2 .cse3) (and .cse4 .cse20 .cse0 .cse1 .cse9 .cse21 .cse14 .cse12 .cse2 .cse3)) .cse8 .cse10 .cse11) (and .cse20 .cse0 .cse21 .cse17 .cse2 .cse18 .cse3 .cse7 .cse19 .cse22 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse23 .cse16 .cse24 .cse17 .cse2 .cse25 .cse26 .cse22 .cse9 .cse27 .cse28) (and (or (and .cse4 .cse7 .cse0 .cse1 .cse9 .cse14 .cse12 .cse2 .cse3) (and .cse7 .cse0 .cse9 .cse1 .cse14 .cse17 .cse12 .cse2 .cse3)) .cse11) (and .cse6 .cse7 .cse19 .cse9 .cse1 .cse10 .cse11 .cse17 .cse12 .cse2 .cse18 .cse3) (and .cse20 .cse0 .cse1 .cse13 .cse21 .cse15 .cse16 .cse24 .cse2 .cse25 .cse4 .cse6 .cse9 .cse10 .cse29 .cse30 .cse28) (and .cse0 .cse1 .cse13 .cse15 .cse16 .cse24 .cse2 .cse25 .cse4 .cse6 .cse7 .cse9 .cse29 .cse30 .cse28) (and .cse0 .cse1 .cse13 .cse14 .cse15 .cse16 .cse24 .cse2 .cse25 .cse4 .cse7 .cse9 .cse11 .cse29 .cse30 .cse12) (and .cse20 .cse0 .cse21 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse2 .cse25 .cse3 .cse26 .cse7 .cse9 .cse27 .cse28 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))))) [2020-11-28 03:13:55,286 INFO L274 CegarLoopResult]: For program point L191(lines 191 197) no Hoare annotation was computed. [2020-11-28 03:13:55,287 INFO L270 CegarLoopResult]: At program point L290-3(lines 281 298) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0))) (let ((.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse18 (= ~q_free~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse0 (= ~q_read_ev~0 2)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (not .cse10)) (.cse16 (= ~q_req_up~0 0)) (.cse4 (= ~q_free~0 1)) (.cse14 (not (= ~q_write_ev~0 1))) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (= ~c_dr_pc~0 1)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse13 (not (= ~q_write_ev~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) (or (and .cse18 .cse0 .cse15 .cse11 .cse16 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse15 .cse16 .cse4 .cse14 .cse6 .cse7)) (<= ~p_num_write~0 .cse17) .cse12 .cse13)) (and .cse0 .cse15 .cse1 .cse16 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse6 (= ~c_num_read~0 0) .cse18 .cse8 .cse11 .cse13 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse14) (and (or (and .cse18 .cse8 .cse0 .cse15 .cse11 .cse16 .cse14 .cse6 .cse7) (and .cse8 .cse0 .cse11 .cse15 .cse16 .cse4 .cse14 .cse6 .cse7)) .cse1 .cse13)))) [2020-11-28 03:13:55,287 INFO L274 CegarLoopResult]: For program point L307(lines 307 311) no Hoare annotation was computed. [2020-11-28 03:13:55,287 INFO L274 CegarLoopResult]: For program point L307-2(lines 307 311) no Hoare annotation was computed. [2020-11-28 03:13:55,287 INFO L274 CegarLoopResult]: For program point L307-3(lines 307 311) no Hoare annotation was computed. [2020-11-28 03:13:55,287 INFO L274 CegarLoopResult]: For program point L307-5(lines 307 311) no Hoare annotation was computed. [2020-11-28 03:13:55,288 INFO L274 CegarLoopResult]: For program point L76(lines 76 85) no Hoare annotation was computed. [2020-11-28 03:13:55,288 INFO L274 CegarLoopResult]: For program point L76-2(lines 76 85) no Hoare annotation was computed. [2020-11-28 03:13:55,288 INFO L274 CegarLoopResult]: For program point L76-3(lines 76 85) no Hoare annotation was computed. [2020-11-28 03:13:55,288 INFO L274 CegarLoopResult]: For program point L76-5(lines 76 85) no Hoare annotation was computed. [2020-11-28 03:13:55,288 INFO L274 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2020-11-28 03:13:55,288 INFO L274 CegarLoopResult]: For program point L27-2(lines 26 41) no Hoare annotation was computed. [2020-11-28 03:13:55,288 INFO L274 CegarLoopResult]: For program point L27-3(lines 27 31) no Hoare annotation was computed. [2020-11-28 03:13:55,289 INFO L274 CegarLoopResult]: For program point L27-5(lines 26 41) no Hoare annotation was computed. [2020-11-28 03:13:55,289 INFO L270 CegarLoopResult]: At program point L341(lines 331 371) the Hoare annotation is: (let ((.cse30 (= ~p_dw_st~0 0)) (.cse32 (+ ~c_num_read~0 1))) (let ((.cse9 (= ~q_req_up~0 1)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (<= .cse32 ~p_num_write~0)) (.cse24 (<= ~p_num_write~0 .cse32)) (.cse20 (= ~p_dw_pc~0 1)) (.cse25 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse26 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse28 (= ~p_num_write~0 0)) (.cse16 (= ~q_free~0 1)) (.cse18 (= ~c_dr_pc~0 1)) (.cse29 (= ~p_dw_pc~0 0)) (.cse31 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~q_read_ev~0 2)) (.cse1 (not .cse30)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse27 (= ~q_req_up~0 0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (= ~q_free~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (not (= ~q_write_ev~0 0))) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (<= 1 ~p_num_write~0)) (.cse22 (not (= ~q_write_ev~0 1))) (.cse14 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse16 .cse6 .cse17 .cse18 .cse9 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse14) (and .cse0 .cse1 .cse6 .cse18 .cse8 .cse23 .cse9 .cse10 .cse24 .cse11 .cse20 .cse21 .cse22 .cse14) (and .cse25 .cse0 .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse20 .cse12 .cse13 .cse15 .cse14) (and .cse25 .cse0 .cse26 .cse2 .cse27 .cse3 .cse28 .cse4 .cse5 .cse16 .cse6 .cse7 .cse29 .cse30 .cse11 .cse31 .cse15 .cse14) (and (or (and .cse8 .cse10 .cse0 .cse1 .cse11 .cse27 .cse22 .cse6 .cse14 .cse18) (and .cse10 .cse0 .cse11 .cse1 .cse27 .cse16 .cse22 .cse6 .cse14 .cse18)) .cse21) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse16 .cse17 .cse6 .cse18 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse14) (and .cse25 .cse0 .cse26 .cse16 .cse6 .cse17 .cse18 .cse10 .cse19 .cse30 .cse11 .cse20 .cse21 .cse22 .cse14) (and .cse23 .cse24 .cse20 .cse21 (or (and .cse25 .cse0 .cse11 .cse1 .cse26 .cse27 .cse16 .cse22 .cse6 .cse14 .cse18) (and .cse8 .cse25 .cse0 .cse1 .cse11 .cse26 .cse27 .cse22 .cse6 .cse14 .cse18))) (and .cse25 .cse0 .cse26 .cse2 .cse27 .cse3 .cse28 .cse4 .cse16 .cse6 .cse7 .cse18 .cse29 .cse10 .cse11 .cse31 .cse15 .cse14) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse21 .cse12 .cse13 .cse22 .cse14)))) [2020-11-28 03:13:55,289 INFO L274 CegarLoopResult]: For program point L77(lines 77 82) no Hoare annotation was computed. [2020-11-28 03:13:55,290 INFO L274 CegarLoopResult]: For program point L77-1(lines 77 82) no Hoare annotation was computed. [2020-11-28 03:13:55,290 INFO L270 CegarLoopResult]: At program point L259(lines 246 261) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 0)) (.cse30 (+ ~c_num_read~0 1))) (let ((.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (<= ~c_num_read~0 ~p_num_write~0)) (.cse19 (= ~q_req_up~0 1)) (.cse28 (<= .cse30 ~p_num_write~0)) (.cse29 (<= ~p_num_write~0 .cse30)) (.cse20 (= ~p_dw_pc~0 1)) (.cse10 (= ~c_dr_pc~0 1)) (.cse16 (not .cse27)) (.cse18 (= ~q_free~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse25 (not (= ~q_write_ev~0 0))) (.cse21 (<= ~p_num_write~0 1)) (.cse22 (<= 1 ~p_num_write~0)) (.cse26 (not (= ~q_write_ev~0 1))) (.cse0 (= ~q_read_ev~0 2)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse5 (= ~p_num_write~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~c_num_read~0 0)) (.cse11 (= ~p_dw_pc~0 0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~q_write_ev~0 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (and .cse0 .cse16 .cse2 .cse1 .cse4 .cse6 .cse17 .cse8 .cse9 .cse18 .cse19 .cse13 .cse20 .cse21 .cse22 .cse15) (and .cse16 .cse2 .cse3 .cse4 .cse6 .cse7 .cse23 .cse8 .cse10 .cse12 .cse24 .cse13 .cse20 .cse25 .cse26) (and .cse0 .cse1 .cse7 .cse8 .cse23 .cse10 .cse12 .cse27 .cse24 .cse13 .cse20 .cse25 .cse26) (and .cse0 .cse16 .cse8 .cse10 .cse18 .cse19 .cse28 .cse12 .cse29 .cse13 .cse20 .cse25 .cse26) (and (or (and .cse18 .cse12 .cse0 .cse16 .cse13 .cse3 .cse26 .cse8 .cse10) (and .cse12 .cse0 .cse13 .cse16 .cse3 .cse7 .cse26 .cse8 .cse10)) .cse25) (and .cse19 .cse12 .cse24 .cse13 .cse16 .cse20 .cse25 .cse7 .cse26 .cse8 .cse23 .cse10) (and .cse0 .cse16 .cse2 .cse4 .cse6 .cse17 .cse8 .cse9 .cse18 .cse19 .cse12 .cse13 .cse21 .cse22 .cse15) (and .cse28 .cse29 .cse20 .cse25 (or (and .cse18 .cse0 .cse16 .cse13 .cse1 .cse3 .cse26 .cse8 .cse10) (and .cse0 .cse13 .cse16 .cse1 .cse3 .cse7 .cse26 .cse8 .cse10))) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse6 .cse17 .cse8 .cse9 .cse18 .cse12 .cse13 .cse25 .cse21 .cse22 .cse26) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse6 .cse5 .cse17 .cse7 .cse8 .cse9 .cse11 .cse27 .cse13 .cse14 .cse15)))) [2020-11-28 03:13:55,291 INFO L270 CegarLoopResult]: At program point L259-1(lines 246 261) the Hoare annotation is: (let ((.cse11 (= ~p_dw_st~0 0))) (let ((.cse6 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (= ~p_dw_pc~0 1)) (.cse2 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse5 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 1)) (.cse0 (= ~q_read_ev~0 2)) (.cse16 (not .cse11)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse17 (= ~q_req_up~0 0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse7 (= ~p_dw_i~0 1)) (.cse18 (= ~q_free~0 0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (not (= ~q_write_ev~0 0))) (.cse15 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and (or (and .cse18 .cse9 .cse0 .cse16 .cse12 .cse17 .cse15 .cse7 .cse8) (and .cse9 .cse0 .cse12 .cse16 .cse17 .cse5 .cse15 .cse7 .cse8)) .cse14) (let ((.cse19 (+ ~c_num_read~0 1))) (and (<= .cse19 ~p_num_write~0) (<= ~p_num_write~0 .cse19) .cse13 .cse14 (or (and .cse18 .cse0 .cse16 .cse12 .cse2 .cse17 .cse15 .cse7 .cse8) (and .cse0 .cse12 .cse16 .cse2 .cse17 .cse5 .cse15 .cse7 .cse8)))) (and .cse0 .cse16 .cse1 .cse17 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse7 (= ~c_num_read~0 0) .cse18 .cse9 .cse12 .cse14 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse15)))) [2020-11-28 03:13:55,291 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-28 03:13:55,291 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-11-28 03:13:55,291 INFO L274 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-11-28 03:13:55,292 INFO L270 CegarLoopResult]: At program point L260(lines 243 262) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0)) (.cse31 (+ ~c_num_read~0 1))) (let ((.cse15 (<= .cse31 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 .cse31)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse6 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (= ~q_req_up~0 1)) (.cse0 (not .cse21)) (.cse24 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse13 (not (= ~q_write_ev~0 0))) (.cse29 (<= ~p_num_write~0 1)) (.cse30 (<= 1 ~p_num_write~0)) (.cse14 (not (= ~q_write_ev~0 1))) (.cse16 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse17 (= ~q_read_ev~0 2)) (.cse18 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse2 (= ~q_req_up~0 0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= ~p_num_write~0 0)) (.cse4 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse5 (= ~q_free~0 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse25 (= ~c_num_read~0 0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse26 (= ~p_dw_pc~0 0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (= ~q_write_ev~0 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 (or (and .cse16 .cse17 .cse11 .cse0 .cse18 .cse2 .cse5 .cse14 .cse7 .cse8) (and .cse19 .cse16 .cse17 .cse0 .cse11 .cse18 .cse2 .cse14 .cse7 .cse8)) .cse20 .cse12 .cse13) (and .cse16 .cse17 .cse18 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14) (and .cse17 .cse0 .cse7 .cse8 .cse19 .cse22 .cse15 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse17 .cse1 .cse18 .cse2 .cse3 .cse4 .cse23 .cse24 .cse5 .cse7 .cse25 .cse26 .cse21 .cse11 .cse27 .cse28) (and (or (and .cse19 .cse9 .cse17 .cse0 .cse11 .cse2 .cse14 .cse7 .cse8) (and .cse9 .cse17 .cse11 .cse0 .cse2 .cse5 .cse14 .cse7 .cse8)) .cse13) (and .cse16 .cse17 .cse0 .cse1 .cse18 .cse3 .cse4 .cse24 .cse7 .cse25 .cse19 .cse22 .cse11 .cse12 .cse29 .cse30 .cse28) (and .cse22 .cse9 .cse10 .cse11 .cse0 .cse12 .cse13 .cse5 .cse14 .cse7 .cse6 .cse8) (and .cse17 .cse0 .cse1 .cse3 .cse4 .cse24 .cse7 .cse25 .cse19 .cse22 .cse9 .cse11 .cse29 .cse30 .cse28) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse7 .cse25 .cse19 .cse9 .cse11 .cse13 .cse29 .cse30 .cse14) (and .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse7 .cse25 .cse8 .cse26 .cse9 .cse11 .cse27 .cse28 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))))) [2020-11-28 03:13:55,292 INFO L270 CegarLoopResult]: At program point L260-1(lines 243 262) the Hoare annotation is: (let ((.cse11 (= ~p_dw_st~0 0))) (let ((.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse3 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse14 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 1)) (.cse1 (= ~q_read_ev~0 2)) (.cse17 (not .cse11)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse18 (= ~q_req_up~0 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse8 (= ~p_dw_i~0 1)) (.cse20 (= ~q_free~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (not (= ~q_write_ev~0 0))) (.cse16 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse19 (+ ~c_num_read~0 1))) (and (<= .cse19 ~p_num_write~0) (or (and .cse0 .cse1 .cse13 .cse17 .cse3 .cse18 .cse6 .cse16 .cse8 .cse9) (and .cse20 .cse0 .cse1 .cse17 .cse13 .cse3 .cse18 .cse16 .cse8 .cse9)) (<= ~p_num_write~0 .cse19) .cse14 .cse15)) (and (or (and .cse20 .cse10 .cse1 .cse17 .cse13 .cse18 .cse16 .cse8 .cse9) (and .cse10 .cse1 .cse13 .cse17 .cse18 .cse6 .cse16 .cse8 .cse9)) .cse15) (and .cse1 .cse17 .cse2 .cse18 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse8 (= ~c_num_read~0 0) .cse20 .cse10 .cse13 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse16)))) [2020-11-28 03:13:55,292 INFO L274 CegarLoopResult]: For program point L161(lines 161 169) no Hoare annotation was computed. [2020-11-28 03:13:55,293 INFO L270 CegarLoopResult]: At program point L13-1(lines 160 208) the Hoare annotation is: (let ((.cse16 (= ~p_dw_st~0 0))) (let ((.cse1 (not .cse16)) (.cse7 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 0))) (.cse9 (not (= ~q_write_ev~0 1))) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse11 (= ~q_read_ev~0 2)) (.cse2 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse13 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse14 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~p_dw_i~0 1)) (.cse15 (= ~c_num_read~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~c_num_read~0 ~p_num_write~0) (= ~q_req_up~0 1) .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse4 .cse15 (= ~q_free~0 0) .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse12 (= ~q_req_up~0 0) .cse13 (= ~p_num_write~0 0) .cse14 .cse3 .cse4 .cse15 (= ~p_dw_pc~0 0) .cse5 .cse16 .cse6 (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse10)))) [2020-11-28 03:13:55,293 INFO L270 CegarLoopResult]: At program point L393(lines 382 395) the Hoare annotation is: (let ((.cse11 (= ~p_dw_st~0 0))) (let ((.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse3 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse14 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 1)) (.cse1 (= ~q_read_ev~0 2)) (.cse17 (not .cse11)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse18 (= ~q_req_up~0 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse8 (= ~p_dw_i~0 1)) (.cse20 (= ~q_free~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (not (= ~q_write_ev~0 0))) (.cse16 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse19 (+ ~c_num_read~0 1))) (and (<= .cse19 ~p_num_write~0) (or (and .cse0 .cse1 .cse13 .cse17 .cse3 .cse18 .cse6 .cse16 .cse8 .cse9) (and .cse20 .cse0 .cse1 .cse17 .cse13 .cse3 .cse18 .cse16 .cse8 .cse9)) (<= ~p_num_write~0 .cse19) .cse14 .cse15)) (and (or (and .cse20 .cse10 .cse1 .cse17 .cse13 .cse18 .cse16 .cse8 .cse9) (and .cse10 .cse1 .cse13 .cse17 .cse18 .cse6 .cse16 .cse8 .cse9)) .cse15) (and .cse1 .cse17 .cse2 .cse18 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse8 (= ~c_num_read~0 0) .cse20 .cse10 .cse13 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse16)))) [2020-11-28 03:13:55,293 INFO L274 CegarLoopResult]: For program point L360(lines 360 367) no Hoare annotation was computed. [2020-11-28 03:13:55,294 INFO L270 CegarLoopResult]: At program point L394(lines 378 396) the Hoare annotation is: (let ((.cse11 (= ~p_dw_st~0 0))) (let ((.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse3 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse14 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 1)) (.cse1 (= ~q_read_ev~0 2)) (.cse17 (not .cse11)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse18 (= ~q_req_up~0 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse8 (= ~p_dw_i~0 1)) (.cse20 (= ~q_free~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (not (= ~q_write_ev~0 0))) (.cse16 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse19 (+ ~c_num_read~0 1))) (and (<= .cse19 ~p_num_write~0) (or (and .cse0 .cse1 .cse13 .cse17 .cse3 .cse18 .cse6 .cse16 .cse8 .cse9) (and .cse20 .cse0 .cse1 .cse17 .cse13 .cse3 .cse18 .cse16 .cse8 .cse9)) (<= ~p_num_write~0 .cse19) .cse14 .cse15)) (and (or (and .cse20 .cse10 .cse1 .cse17 .cse13 .cse18 .cse16 .cse8 .cse9) (and .cse10 .cse1 .cse13 .cse17 .cse18 .cse6 .cse16 .cse8 .cse9)) .cse15) (and .cse1 .cse17 .cse2 .cse18 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse8 (= ~c_num_read~0 0) .cse20 .cse10 .cse13 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse16)))) [2020-11-28 03:13:55,294 INFO L274 CegarLoopResult]: For program point L229-1(lines 228 241) no Hoare annotation was computed. [2020-11-28 03:13:55,294 INFO L270 CegarLoopResult]: At program point L411-1(lines 281 433) the Hoare annotation is: (let ((.cse11 (= ~p_dw_st~0 0))) (let ((.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse3 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse14 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 1)) (.cse1 (= ~q_read_ev~0 2)) (.cse17 (not .cse11)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse18 (= ~q_req_up~0 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse21 (= ~c_dr_pc~0 0)) (.cse8 (= ~p_dw_i~0 1)) (.cse22 (= ~c_num_read~0 0)) (.cse20 (= ~q_free~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (not (= ~q_write_ev~0 0))) (.cse16 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse19 (+ ~c_num_read~0 1))) (and (<= .cse19 ~p_num_write~0) (or (and .cse0 .cse1 .cse13 .cse17 .cse3 .cse18 .cse6 .cse16 .cse8 .cse9) (and .cse20 .cse0 .cse1 .cse17 .cse13 .cse3 .cse18 .cse16 .cse8 .cse9)) (<= ~p_num_write~0 .cse19) .cse14 .cse15)) (and .cse1 .cse2 .cse18 .cse4 (= ~p_num_write~0 0) .cse5 .cse21 .cse6 .cse8 .cse22 (= ~p_dw_pc~0 0) .cse11 .cse13 (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) (and (or (and .cse20 .cse10 .cse1 .cse17 .cse13 .cse18 .cse16 .cse8 .cse9) (and .cse10 .cse1 .cse13 .cse17 .cse18 .cse6 .cse16 .cse8 .cse9)) .cse15) (and .cse1 .cse17 .cse2 .cse18 .cse4 .cse5 .cse21 .cse8 .cse22 .cse20 .cse10 .cse13 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse16)))) [2020-11-28 03:13:55,295 INFO L274 CegarLoopResult]: For program point L345(lines 345 352) no Hoare annotation was computed. [2020-11-28 03:13:55,295 INFO L274 CegarLoopResult]: For program point L428(lines 428 432) no Hoare annotation was computed. [2020-11-28 03:13:55,295 INFO L274 CegarLoopResult]: For program point L164(lines 164 168) no Hoare annotation was computed. [2020-11-28 03:13:55,295 INFO L270 CegarLoopResult]: At program point L131-1(lines 119 154) the Hoare annotation is: (let ((.cse8 (= ~q_req_up~0 1)) (.cse19 (<= ~p_num_write~0 1)) (.cse20 (<= 1 ~p_num_write~0)) (.cse6 (= ~q_free~0 0)) (.cse11 (not (= ~q_write_ev~0 0))) (.cse12 (not (= ~q_write_ev~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse1 (= ~q_read_ev~0 2)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse22 (= ~q_req_up~0 0)) (.cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= ~p_num_write~0 0)) (.cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse24 (= ~q_free~0 1)) (.cse4 (= ~p_dw_i~0 1)) (.cse18 (= ~c_num_read~0 0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) (or (let ((.cse7 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse7 ~p_num_write~0) .cse8 .cse9 (<= ~p_num_write~0 .cse7) .cse10 (= ~p_dw_pc~0 1) .cse11 .cse12 .cse13)) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse17 .cse4 .cse18 .cse6 .cse8 .cse10 .cse19 .cse20 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse19 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse22 .cse15 .cse23 .cse16 .cse17 .cse24 .cse4 .cse18 .cse10 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse22 .cse15 .cse23 .cse16 .cse24 .cse4 .cse18 .cse5 .cse9 .cse10 .cse21 .cse13))) [2020-11-28 03:13:55,295 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-28 03:13:55,296 INFO L274 CegarLoopResult]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2020-11-28 03:13:55,296 INFO L274 CegarLoopResult]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2020-11-28 03:13:55,296 INFO L274 CegarLoopResult]: For program point L412(line 412) no Hoare annotation was computed. [2020-11-28 03:13:55,296 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-28 03:13:55,296 INFO L274 CegarLoopResult]: For program point L247(lines 247 257) no Hoare annotation was computed. [2020-11-28 03:13:55,296 INFO L274 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-11-28 03:13:55,297 INFO L274 CegarLoopResult]: For program point L247-1(lines 247 257) no Hoare annotation was computed. [2020-11-28 03:13:55,297 INFO L270 CegarLoopResult]: At program point L214-1(lines 229 233) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-11-28 03:13:55,297 INFO L274 CegarLoopResult]: For program point L214-2(lines 214 220) no Hoare annotation was computed. [2020-11-28 03:13:55,297 INFO L270 CegarLoopResult]: At program point L214-3(lines 210 224) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse0 (= ~q_read_ev~0 2)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~q_req_up~0 0)) (.cse10 (= ~q_free~0 1)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse3 (= ~p_dw_i~0 1)) (.cse11 (= ~c_dr_pc~0 1))) (let ((.cse9 (not (= ~q_write_ev~0 0))) (.cse12 (or (and .cse4 .cse5 .cse0 .cse1 .cse6 .cse2 .cse7 .cse3 .cse11) (and .cse5 .cse0 .cse6 .cse1 .cse2 .cse10 .cse7 .cse3 .cse11))) (.cse8 (= ~p_dw_pc~0 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) .cse3 (= ~c_num_read~0 0) .cse4 .cse5 .cse6 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse7) (and .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse1 .cse8 .cse9 .cse2 .cse10 .cse7 .cse3 (<= ~c_num_read~0 ~p_num_write~0) .cse11) (and .cse12 .cse9) (let ((.cse13 (+ ~c_num_read~0 1))) (and (<= .cse13 ~p_num_write~0) (<= ~p_num_write~0 .cse13) .cse12 .cse8))))) [2020-11-28 03:13:55,298 INFO L270 CegarLoopResult]: At program point L165(lines 160 208) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) (not (= ~p_dw_st~0 0)) (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0)) (= ~p_dw_i~0 1) (= ~c_dr_pc~0 1) (<= .cse0 ~p_num_write~0) (not (= ~c_dr_st~0 0)) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= ~p_dw_pc~0 1) (not (= ~q_write_ev~0 0)) (not (= ~q_write_ev~0 1)) (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) [2020-11-28 03:13:55,298 INFO L274 CegarLoopResult]: For program point L132(lines 131 149) no Hoare annotation was computed. [2020-11-28 03:13:55,298 INFO L270 CegarLoopResult]: At program point L133(lines 119 154) the Hoare annotation is: (let ((.cse5 (= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse8 (not (= ~q_write_ev~0 1))) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse1 (= ~q_read_ev~0 2)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse15 (= ~c_num_read~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 (= ~p_dw_pc~0 1) (not (= ~q_write_ev~0 0)) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~c_dr_pc~0 0) .cse4 .cse15 .cse7 .cse16 .cse9))) [2020-11-28 03:13:55,298 INFO L274 CegarLoopResult]: For program point L315(lines 315 319) no Hoare annotation was computed. [2020-11-28 03:13:55,299 INFO L270 CegarLoopResult]: At program point L315-2(lines 285 289) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~p_num_write~0 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-11-28 03:13:55,299 INFO L274 CegarLoopResult]: For program point L315-3(lines 315 319) no Hoare annotation was computed. [2020-11-28 03:13:55,299 INFO L270 CegarLoopResult]: At program point L315-5(lines 285 289) the Hoare annotation is: (let ((.cse22 (= ~p_dw_st~0 0))) (let ((.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse0 (not .cse22)) (.cse2 (= ~q_req_up~0 0)) (.cse18 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse19 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse20 (= ~q_free~0 0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (<= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (= ~c_dr_pc~0 1)) (.cse21 (= ~q_read_ev~0 1)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse13 (not (= ~q_write_ev~0 0))) (.cse14 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ ~c_num_read~0 1))) (and (<= .cse15 ~p_num_write~0) (<= ~p_num_write~0 .cse15) .cse12 .cse13 (or (and .cse16 .cse17 .cse0 .cse11 .cse2 .cse18 .cse19 .cse5 .cse7 .cse8) (and .cse20 .cse16 .cse17 .cse0 .cse11 .cse2 .cse18 .cse19 .cse7 .cse8)))) (and .cse1 .cse13 (or (and .cse9 .cse16 .cse17 .cse0 .cse11 .cse2 .cse18 .cse19 .cse5 .cse7 .cse8) (and .cse20 .cse9 .cse16 .cse17 .cse0 .cse11 .cse2 .cse18 .cse19 .cse7 .cse8))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse21 .cse9 .cse11 .cse13 .cse14) (and .cse16 .cse17 .cse0 .cse1 .cse2 .cse18 .cse3 .cse19 .cse4 (= ~c_dr_pc~0 0) .cse7 (= ~c_num_read~0 0) .cse20 .cse9 .cse11 .cse13 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2020-11-28 03:13:55,299 INFO L274 CegarLoopResult]: For program point L332(line 332) no Hoare annotation was computed. [2020-11-28 03:13:55,300 INFO L270 CegarLoopResult]: At program point L68(lines 56 70) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-11-28 03:13:55,300 INFO L270 CegarLoopResult]: At program point L68-1(lines 56 70) the Hoare annotation is: (let ((.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse16 (= ~q_free~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse13 (= ~q_read_ev~0 1)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (not (= ~q_write_ev~0 0))) (.cse1 (= ~q_req_up~0 0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse3 (= ~q_free~0 1)) (.cse12 (not (= ~q_write_ev~0 1))) (.cse4 (= ~p_dw_i~0 1)) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (+ ~c_num_read~0 1))) (and (<= .cse14 ~p_num_write~0) (<= ~p_num_write~0 .cse14) (or (and .cse7 .cse15 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse16 .cse7 .cse15 .cse0 .cse9 .cse1 .cse2 .cse4 .cse6)) .cse10 .cse11)) (and .cse15 .cse0 .cse1 .cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) .cse4 (= ~c_num_read~0 0) .cse16 .cse7 .cse9 .cse11 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)) (and (or (and .cse16 .cse7 .cse15 .cse0 .cse9 .cse1 .cse2 .cse12 .cse4 .cse6) (and .cse15 .cse7 .cse9 .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse6)) .cse11) (and .cse13 .cse7 .cse0 .cse9 .cse11 .cse1 .cse2 .cse3 .cse12 .cse4 .cse6))) [2020-11-28 03:13:55,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:13:55 BoogieIcfgContainer [2020-11-28 03:13:55,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:13:55,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:13:55,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:13:55,452 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:13:55,452 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:28" (3/4) ... [2020-11-28 03:13:55,456 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-28 03:13:55,482 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-11-28 03:13:55,483 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-28 03:13:55,484 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-28 03:13:55,485 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-28 03:13:55,519 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((q_read_ev == 2 && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev [2020-11-28 03:13:55,519 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((q_read_ev == 2 && tmp == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev [2020-11-28 03:13:55,520 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((q_read_ev == 2 && tmp == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev [2020-11-28 03:13:55,521 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((q_read_ev == 2 && tmp == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev [2020-11-28 03:13:55,521 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 03:13:55,521 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || (((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-11-28 03:13:55,522 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 03:13:55,522 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || (((((((((((!(c_dr_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_dw_pc == 1) [2020-11-28 03:13:55,523 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(c_dr_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || ((((c_num_read + 1 <= p_num_write && ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || (((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) [2020-11-28 03:13:55,524 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((q_read_ev == 2 && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((q_read_ev == 2 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && tmp___0 == 0) && !(__retres1 == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) [2020-11-28 03:13:55,525 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || (((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-11-28 03:13:55,526 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(tmp___1 == 0)) && q_write_ev == q_read_ev) || ((((((((((((!(p_dw_st == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || (((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1) || ((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && !(tmp___1 == 0)) [2020-11-28 03:13:55,526 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && p_dw_i == 1) && c_dr_pc == 1))) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || (((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_read_ev == 2 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || ((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) [2020-11-28 03:13:55,526 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (!(q_write_ev == 0) && (((((((((((q_free == 0 && q_read_ev == 2) && !(c_dr_st == 0)) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((q_read_ev == 2 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)))) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) [2020-11-28 03:13:55,527 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-11-28 03:13:55,528 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-11-28 03:13:55,528 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\result == 0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-11-28 03:13:55,528 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\result == 0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_dr_pc == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0) [2020-11-28 03:13:55,529 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) || ((((((((((((__retres1 == 0 && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((((!(c_dr_st == 0) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1)))) || ((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((!(q_write_ev == 0) && __retres1 == 0) && ((((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((((q_read_ev == 2 && !(c_dr_st == 0)) && tmp == 0) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) [2020-11-28 03:13:55,529 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(q_write_ev == 0) && __retres1 == 0) && ((((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((((q_read_ev == 2 && !(c_dr_st == 0)) && tmp == 0) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && \result == 0) || ((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || (((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((((!(c_dr_st == 0) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1)))) || (((((((((((((__retres1 == 0 && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) [2020-11-28 03:13:55,529 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && ((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1)))) || ((tmp___0 == 0 && !(q_write_ev == 0)) && (((((((((((!(c_dr_st == 0) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1)))) || ((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || ((((((((((((((tmp___0 == 0 && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) [2020-11-28 03:13:55,530 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((q_read_ev == 2 && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((q_read_ev == 2 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && tmp___0 == 0) && !(q_write_ev == 0)) [2020-11-28 03:13:55,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_read_ev == 2 && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((q_read_ev == 2 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 03:13:55,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 03:13:55,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 03:13:55,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 03:13:55,614 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_35baee31-db2b-4515-81cd-7d80ac354363/bin/uautomizer/witness.graphml [2020-11-28 03:13:55,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:13:55,615 INFO L168 Benchmark]: Toolchain (without parser) took 28462.83 ms. Allocated memory was 96.5 MB in the beginning and 637.5 MB in the end (delta: 541.1 MB). Free memory was 62.6 MB in the beginning and 389.5 MB in the end (delta: -327.0 MB). Peak memory consumption was 212.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:55,616 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 96.5 MB. Free memory was 76.0 MB in the beginning and 76.0 MB in the end (delta: 27.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:13:55,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.51 ms. Allocated memory is still 96.5 MB. Free memory was 62.4 MB in the beginning and 70.5 MB in the end (delta: -8.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:55,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.24 ms. Allocated memory is still 96.5 MB. Free memory was 70.5 MB in the beginning and 68.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:55,617 INFO L168 Benchmark]: Boogie Preprocessor took 71.64 ms. Allocated memory is still 96.5 MB. Free memory was 68.4 MB in the beginning and 66.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:55,618 INFO L168 Benchmark]: RCFGBuilder took 834.72 ms. Allocated memory is still 96.5 MB. Free memory was 66.3 MB in the beginning and 36.6 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:55,618 INFO L168 Benchmark]: TraceAbstraction took 26873.30 ms. Allocated memory was 96.5 MB in the beginning and 637.5 MB in the end (delta: 541.1 MB). Free memory was 73.8 MB in the beginning and 396.9 MB in the end (delta: -323.1 MB). Peak memory consumption was 402.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:55,619 INFO L168 Benchmark]: Witness Printer took 162.87 ms. Allocated memory is still 637.5 MB. Free memory was 396.9 MB in the beginning and 389.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:13:55,623 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 96.5 MB. Free memory was 76.0 MB in the beginning and 76.0 MB in the end (delta: 27.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 412.51 ms. Allocated memory is still 96.5 MB. Free memory was 62.4 MB in the beginning and 70.5 MB in the end (delta: -8.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.24 ms. Allocated memory is still 96.5 MB. Free memory was 70.5 MB in the beginning and 68.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.64 ms. Allocated memory is still 96.5 MB. Free memory was 68.4 MB in the beginning and 66.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 834.72 ms. Allocated memory is still 96.5 MB. Free memory was 66.3 MB in the beginning and 36.6 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26873.30 ms. Allocated memory was 96.5 MB in the beginning and 637.5 MB in the end (delta: 541.1 MB). Free memory was 73.8 MB in the beginning and 396.9 MB in the end (delta: -323.1 MB). Peak memory consumption was 402.0 MB. Max. memory is 16.1 GB. * Witness Printer took 162.87 ms. Allocated memory is still 637.5 MB. Free memory was 396.9 MB in the beginning and 389.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && q_req_up == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && q_write_ev == q_read_ev - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || (((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((q_read_ev == 2 && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || (((((((((((!(c_dr_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_dw_pc == 1) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(tmp___1 == 0)) && q_write_ev == q_read_ev) || ((((((((((((!(p_dw_st == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || (((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1) || ((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && !(tmp___1 == 0)) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && q_req_up == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && q_write_ev == q_read_ev - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((q_read_ev == 2 && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((q_read_ev == 2 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && tmp___0 == 0) && !(q_write_ev == 0)) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (((((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) || ((((((((((((__retres1 == 0 && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((((!(c_dr_st == 0) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1)))) || ((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((!(q_write_ev == 0) && __retres1 == 0) && ((((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((((q_read_ev == 2 && !(c_dr_st == 0)) && tmp == 0) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((((((((((((q_read_ev == 2 && tmp == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_read_ev == 2 && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((q_read_ev == 2 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((((((((((!(c_dr_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || ((((c_num_read + 1 <= p_num_write && ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || (((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((q_read_ev == 2 && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((q_read_ev == 2 && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && tmp___0 == 0) && !(__retres1 == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (((((((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (!(q_write_ev == 0) && (((((((((((q_free == 0 && q_read_ev == 2) && !(c_dr_st == 0)) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((q_read_ev == 2 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)))) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((q_read_ev == 2 && tmp == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((!(\result == 0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_dr_pc == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && ((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1)))) || ((tmp___0 == 0 && !(q_write_ev == 0)) && (((((((((((!(c_dr_st == 0) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1)))) || ((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || ((((((((((((((tmp___0 == 0 && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && q_req_up == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && q_write_ev == q_read_ev - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((((((((!(\result == 0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((!(q_write_ev == 0) && __retres1 == 0) && ((((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((((q_read_ev == 2 && !(c_dr_st == 0)) && tmp == 0) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && \result == 0) || ((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || (((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0)) && (((((((((((!(c_dr_st == 0) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && tmp == 0) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1)))) || (((((((((((((__retres1 == 0 && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && q_req_up == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && q_write_ev == q_read_ev - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((q_read_ev == 2 && tmp == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && p_dw_i == 1) && c_dr_pc == 1))) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || (((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && __retres1 == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_read_ev == 2 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || ((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((((((q_read_ev == 2 && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((c_num_read + 1 <= p_num_write && ((((((((((!(\result == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && !(q_write_ev == 0))) || (((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((!(c_dr_st == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && !(q_write_ev == 0))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.7s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3170 SDtfs, 3779 SDslu, 5037 SDs, 0 SdLazy, 467 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4335occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 2562 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 405 NumberOfFragments, 8055 HoareAnnotationTreeSize, 33 FomulaSimplifications, 402440 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 33 FomulaSimplificationsInter, 48929 FormulaSimplificationTreeSizeReductionInter, 14.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1819 NumberOfCodeBlocks, 1819 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1796 ConstructedInterpolants, 0 QuantifiedInterpolants, 560682 SizeOfPredicates, 4 NumberOfNonLiveVariables, 680 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 535/705 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...