./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.1.25-9a8b2e8 [2020-10-20 01:50:11,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:50:11,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:50:11,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:50:11,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:50:11,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:50:11,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:50:11,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:50:11,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:50:11,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:50:11,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:50:11,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:50:11,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:50:11,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:50:11,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:50:11,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:50:11,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:50:11,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:50:11,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:50:11,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:50:11,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:50:11,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:50:11,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:50:11,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:50:11,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:50:11,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:50:11,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:50:11,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:50:11,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:50:11,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:50:11,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:50:11,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:50:11,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:50:11,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:50:11,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:50:11,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:50:11,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:50:11,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:50:11,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:50:11,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:50:11,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:50:11,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:50:11,893 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:50:11,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:50:11,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:50:11,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:50:11,896 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:50:11,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:50:11,897 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:50:11,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:50:11,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:50:11,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:50:11,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:50:11,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:50:11,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:50:11,900 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:50:11,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:50:11,900 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:50:11,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:50:11,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:50:11,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:50:11,901 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:50:11,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:50:11,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:50:11,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:50:11,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:50:11,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:50:11,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:50:11,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:50:11,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:50:11,903 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:50:11,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-10-20 01:50:12,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:50:12,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:50:12,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:50:12,158 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:50:12,158 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:50:12,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2020-10-20 01:50:12,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f86d61a4/efd103d173e74c1999a413185d4f62a2/FLAGcb64236d7 [2020-10-20 01:50:12,791 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:50:12,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2020-10-20 01:50:12,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f86d61a4/efd103d173e74c1999a413185d4f62a2/FLAGcb64236d7 [2020-10-20 01:50:13,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f86d61a4/efd103d173e74c1999a413185d4f62a2 [2020-10-20 01:50:13,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:50:13,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:50:13,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:50:13,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:50:13,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:50:13,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7145bb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13, skipping insertion in model container [2020-10-20 01:50:13,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:50:13,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:50:13,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:50:13,469 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:50:13,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:50:13,535 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:50:13,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13 WrapperNode [2020-10-20 01:50:13,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:50:13,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:50:13,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:50:13,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:50:13,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:50:13,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:50:13,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:50:13,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:50:13,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... [2020-10-20 01:50:13,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:50:13,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:50:13,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:50:13,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:50:13,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:50:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:50:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:50:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:50:13,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:50:14,167 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:50:14,168 INFO L298 CfgBuilder]: Removed 62 assume(true) statements. [2020-10-20 01:50:14,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:14 BoogieIcfgContainer [2020-10-20 01:50:14,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:50:14,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:50:14,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:50:14,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:50:14,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:50:13" (1/3) ... [2020-10-20 01:50:14,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112aee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:50:14, skipping insertion in model container [2020-10-20 01:50:14,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:13" (2/3) ... [2020-10-20 01:50:14,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112aee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:50:14, skipping insertion in model container [2020-10-20 01:50:14,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:14" (3/3) ... [2020-10-20 01:50:14,180 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2020-10-20 01:50:14,196 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:50:14,207 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 01:50:14,231 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-20 01:50:14,258 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:50:14,259 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:50:14,259 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:50:14,259 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:50:14,260 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:50:14,260 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:50:14,260 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:50:14,260 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:50:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2020-10-20 01:50:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:14,289 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:14,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:50:14,291 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:14,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1850595735, now seen corresponding path program 1 times [2020-10-20 01:50:14,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:14,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117279913] [2020-10-20 01:50:14,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:14,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117279913] [2020-10-20 01:50:14,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:14,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:14,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569119181] [2020-10-20 01:50:14,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:14,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:14,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:14,555 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2020-10-20 01:50:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:14,679 INFO L93 Difference]: Finished difference Result 268 states and 421 transitions. [2020-10-20 01:50:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:14,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-10-20 01:50:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:14,695 INFO L225 Difference]: With dead ends: 268 [2020-10-20 01:50:14,695 INFO L226 Difference]: Without dead ends: 174 [2020-10-20 01:50:14,699 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-10-20 01:50:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-20 01:50:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2020-10-20 01:50:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-20 01:50:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2020-10-20 01:50:14,774 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 39 [2020-10-20 01:50:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:14,775 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2020-10-20 01:50:14,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2020-10-20 01:50:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:14,778 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:14,778 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-10-20 01:50:14,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:50:14,779 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash 32121210, now seen corresponding path program 1 times [2020-10-20 01:50:14,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:14,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812956301] [2020-10-20 01:50:14,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:14,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812956301] [2020-10-20 01:50:14,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:14,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:14,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119042188] [2020-10-20 01:50:14,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:14,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:14,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:14,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:14,890 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand 5 states. [2020-10-20 01:50:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:15,028 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2020-10-20 01:50:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:15,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-10-20 01:50:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,033 INFO L225 Difference]: With dead ends: 540 [2020-10-20 01:50:15,033 INFO L226 Difference]: Without dead ends: 400 [2020-10-20 01:50:15,035 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-10-20 01:50:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-10-20 01:50:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 176. [2020-10-20 01:50:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-20 01:50:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2020-10-20 01:50:15,067 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 39 [2020-10-20 01:50:15,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:15,068 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2020-10-20 01:50:15,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2020-10-20 01:50:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:15,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:15,071 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-10-20 01:50:15,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:50:15,071 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:15,072 INFO L82 PathProgramCache]: Analyzing trace with hash 94160824, now seen corresponding path program 1 times [2020-10-20 01:50:15,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:15,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197253977] [2020-10-20 01:50:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:15,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197253977] [2020-10-20 01:50:15,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:15,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:15,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460568144] [2020-10-20 01:50:15,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:15,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:15,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:15,134 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand 4 states. [2020-10-20 01:50:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:15,319 INFO L93 Difference]: Finished difference Result 466 states and 666 transitions. [2020-10-20 01:50:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:15,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-10-20 01:50:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,324 INFO L225 Difference]: With dead ends: 466 [2020-10-20 01:50:15,324 INFO L226 Difference]: Without dead ends: 331 [2020-10-20 01:50:15,325 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-10-20 01:50:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-10-20 01:50:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 246. [2020-10-20 01:50:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-10-20 01:50:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 343 transitions. [2020-10-20 01:50:15,354 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 343 transitions. Word has length 39 [2020-10-20 01:50:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:15,354 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 343 transitions. [2020-10-20 01:50:15,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 343 transitions. [2020-10-20 01:50:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:15,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:15,358 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-10-20 01:50:15,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:50:15,358 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1899983882, now seen corresponding path program 1 times [2020-10-20 01:50:15,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:15,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720345691] [2020-10-20 01:50:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:15,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720345691] [2020-10-20 01:50:15,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:15,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:15,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902789091] [2020-10-20 01:50:15,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:15,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:15,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:15,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:15,423 INFO L87 Difference]: Start difference. First operand 246 states and 343 transitions. Second operand 3 states. [2020-10-20 01:50:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:15,504 INFO L93 Difference]: Finished difference Result 626 states and 868 transitions. [2020-10-20 01:50:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:15,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-10-20 01:50:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,508 INFO L225 Difference]: With dead ends: 626 [2020-10-20 01:50:15,508 INFO L226 Difference]: Without dead ends: 466 [2020-10-20 01:50:15,510 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-10-20 01:50:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-10-20 01:50:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2020-10-20 01:50:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2020-10-20 01:50:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 635 transitions. [2020-10-20 01:50:15,542 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 635 transitions. Word has length 39 [2020-10-20 01:50:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:15,543 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 635 transitions. [2020-10-20 01:50:15,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 635 transitions. [2020-10-20 01:50:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-20 01:50:15,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:15,547 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-10-20 01:50:15,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:50:15,548 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash -909810677, now seen corresponding path program 1 times [2020-10-20 01:50:15,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:15,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345472429] [2020-10-20 01:50:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:15,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345472429] [2020-10-20 01:50:15,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:15,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:15,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699899864] [2020-10-20 01:50:15,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:15,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:15,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:15,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:15,624 INFO L87 Difference]: Start difference. First operand 462 states and 635 transitions. Second operand 3 states. [2020-10-20 01:50:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:15,699 INFO L93 Difference]: Finished difference Result 1090 states and 1499 transitions. [2020-10-20 01:50:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:15,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-10-20 01:50:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,704 INFO L225 Difference]: With dead ends: 1090 [2020-10-20 01:50:15,705 INFO L226 Difference]: Without dead ends: 738 [2020-10-20 01:50:15,706 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-10-20 01:50:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-10-20 01:50:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 714. [2020-10-20 01:50:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2020-10-20 01:50:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 959 transitions. [2020-10-20 01:50:15,756 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 959 transitions. Word has length 40 [2020-10-20 01:50:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:15,756 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 959 transitions. [2020-10-20 01:50:15,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 959 transitions. [2020-10-20 01:50:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-20 01:50:15,759 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:15,759 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-10-20 01:50:15,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:50:15,759 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:15,760 INFO L82 PathProgramCache]: Analyzing trace with hash -956850666, now seen corresponding path program 1 times [2020-10-20 01:50:15,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:15,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873499619] [2020-10-20 01:50:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:15,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873499619] [2020-10-20 01:50:15,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:15,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:15,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156408375] [2020-10-20 01:50:15,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:15,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:15,816 INFO L87 Difference]: Start difference. First operand 714 states and 959 transitions. Second operand 3 states. [2020-10-20 01:50:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:15,930 INFO L93 Difference]: Finished difference Result 1966 states and 2646 transitions. [2020-10-20 01:50:15,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:15,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-10-20 01:50:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,937 INFO L225 Difference]: With dead ends: 1966 [2020-10-20 01:50:15,938 INFO L226 Difference]: Without dead ends: 1257 [2020-10-20 01:50:15,940 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-10-20 01:50:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2020-10-20 01:50:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1237. [2020-10-20 01:50:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2020-10-20 01:50:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1648 transitions. [2020-10-20 01:50:16,024 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1648 transitions. Word has length 40 [2020-10-20 01:50:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:16,029 INFO L481 AbstractCegarLoop]: Abstraction has 1237 states and 1648 transitions. [2020-10-20 01:50:16,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1648 transitions. [2020-10-20 01:50:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-20 01:50:16,032 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:16,033 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-10-20 01:50:16,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:50:16,034 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1951308042, now seen corresponding path program 1 times [2020-10-20 01:50:16,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:16,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760609986] [2020-10-20 01:50:16,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:16,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760609986] [2020-10-20 01:50:16,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:16,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:16,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208017752] [2020-10-20 01:50:16,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:16,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:16,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:16,119 INFO L87 Difference]: Start difference. First operand 1237 states and 1648 transitions. Second operand 3 states. [2020-10-20 01:50:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:16,266 INFO L93 Difference]: Finished difference Result 2929 states and 3880 transitions. [2020-10-20 01:50:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:16,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-10-20 01:50:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:16,276 INFO L225 Difference]: With dead ends: 2929 [2020-10-20 01:50:16,277 INFO L226 Difference]: Without dead ends: 1729 [2020-10-20 01:50:16,279 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-10-20 01:50:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2020-10-20 01:50:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1705. [2020-10-20 01:50:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2020-10-20 01:50:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2236 transitions. [2020-10-20 01:50:16,383 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2236 transitions. Word has length 45 [2020-10-20 01:50:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:16,384 INFO L481 AbstractCegarLoop]: Abstraction has 1705 states and 2236 transitions. [2020-10-20 01:50:16,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2236 transitions. [2020-10-20 01:50:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-20 01:50:16,386 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:16,386 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-10-20 01:50:16,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:50:16,386 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:16,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1660744042, now seen corresponding path program 1 times [2020-10-20 01:50:16,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:16,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791747300] [2020-10-20 01:50:16,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:16,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791747300] [2020-10-20 01:50:16,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:16,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:16,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136265037] [2020-10-20 01:50:16,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:16,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:16,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:16,431 INFO L87 Difference]: Start difference. First operand 1705 states and 2236 transitions. Second operand 4 states. [2020-10-20 01:50:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:16,574 INFO L93 Difference]: Finished difference Result 1993 states and 2618 transitions. [2020-10-20 01:50:16,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:16,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-10-20 01:50:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:16,586 INFO L225 Difference]: With dead ends: 1993 [2020-10-20 01:50:16,587 INFO L226 Difference]: Without dead ends: 1991 [2020-10-20 01:50:16,588 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-10-20 01:50:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2020-10-20 01:50:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1703. [2020-10-20 01:50:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2020-10-20 01:50:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2227 transitions. [2020-10-20 01:50:16,715 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2227 transitions. Word has length 46 [2020-10-20 01:50:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:16,716 INFO L481 AbstractCegarLoop]: Abstraction has 1703 states and 2227 transitions. [2020-10-20 01:50:16,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2227 transitions. [2020-10-20 01:50:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-20 01:50:16,718 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:16,718 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-10-20 01:50:16,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:50:16,719 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash -56555803, now seen corresponding path program 1 times [2020-10-20 01:50:16,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:16,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986556624] [2020-10-20 01:50:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:16,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986556624] [2020-10-20 01:50:16,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585758410] [2020-10-20 01:50:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:50:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:16,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 01:50:16,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:50:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:16,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:50:16,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 01:50:16,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803348188] [2020-10-20 01:50:17,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:50:17,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:17,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:50:17,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:50:17,001 INFO L87 Difference]: Start difference. First operand 1703 states and 2227 transitions. Second operand 6 states. [2020-10-20 01:50:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:17,267 INFO L93 Difference]: Finished difference Result 3615 states and 4764 transitions. [2020-10-20 01:50:17,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:17,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2020-10-20 01:50:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:17,286 INFO L225 Difference]: With dead ends: 3615 [2020-10-20 01:50:17,287 INFO L226 Difference]: Without dead ends: 3613 [2020-10-20 01:50:17,288 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-10-20 01:50:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2020-10-20 01:50:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3021. [2020-10-20 01:50:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3021 states. [2020-10-20 01:50:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 3971 transitions. [2020-10-20 01:50:17,497 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 3971 transitions. Word has length 47 [2020-10-20 01:50:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:17,498 INFO L481 AbstractCegarLoop]: Abstraction has 3021 states and 3971 transitions. [2020-10-20 01:50:17,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:50:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3971 transitions. [2020-10-20 01:50:17,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 01:50:17,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:17,500 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-10-20 01:50:17,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-10-20 01:50:17,715 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:17,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:17,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2073247729, now seen corresponding path program 2 times [2020-10-20 01:50:17,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:17,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693513925] [2020-10-20 01:50:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:17,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693513925] [2020-10-20 01:50:17,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:17,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:17,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560055319] [2020-10-20 01:50:17,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:17,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:17,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:17,755 INFO L87 Difference]: Start difference. First operand 3021 states and 3971 transitions. Second operand 3 states. [2020-10-20 01:50:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:17,996 INFO L93 Difference]: Finished difference Result 4413 states and 5844 transitions. [2020-10-20 01:50:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:17,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-20 01:50:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:18,008 INFO L225 Difference]: With dead ends: 4413 [2020-10-20 01:50:18,009 INFO L226 Difference]: Without dead ends: 2271 [2020-10-20 01:50:18,012 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-10-20 01:50:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2020-10-20 01:50:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2261. [2020-10-20 01:50:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2020-10-20 01:50:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2929 transitions. [2020-10-20 01:50:18,175 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2929 transitions. Word has length 50 [2020-10-20 01:50:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:18,175 INFO L481 AbstractCegarLoop]: Abstraction has 2261 states and 2929 transitions. [2020-10-20 01:50:18,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2929 transitions. [2020-10-20 01:50:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-20 01:50:18,178 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:18,178 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-10-20 01:50:18,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:50:18,179 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:18,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1744624096, now seen corresponding path program 1 times [2020-10-20 01:50:18,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:18,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303176389] [2020-10-20 01:50:18,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:18,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-10-20 01:50:18,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303176389] [2020-10-20 01:50:18,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:18,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:18,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919773810] [2020-10-20 01:50:18,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:18,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:18,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:18,227 INFO L87 Difference]: Start difference. First operand 2261 states and 2929 transitions. Second operand 4 states. [2020-10-20 01:50:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:18,584 INFO L93 Difference]: Finished difference Result 6497 states and 8385 transitions. [2020-10-20 01:50:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:18,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-10-20 01:50:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:18,605 INFO L225 Difference]: With dead ends: 6497 [2020-10-20 01:50:18,606 INFO L226 Difference]: Without dead ends: 4369 [2020-10-20 01:50:18,609 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-10-20 01:50:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2020-10-20 01:50:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 4335. [2020-10-20 01:50:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4335 states. [2020-10-20 01:50:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 5521 transitions. [2020-10-20 01:50:18,871 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 5521 transitions. Word has length 54 [2020-10-20 01:50:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:18,871 INFO L481 AbstractCegarLoop]: Abstraction has 4335 states and 5521 transitions. [2020-10-20 01:50:18,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 5521 transitions. [2020-10-20 01:50:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-20 01:50:18,875 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:18,876 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-10-20 01:50:18,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:50:18,876 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:18,877 INFO L82 PathProgramCache]: Analyzing trace with hash 550871454, now seen corresponding path program 1 times [2020-10-20 01:50:18,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:18,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931843064] [2020-10-20 01:50:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:50:18,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931843064] [2020-10-20 01:50:18,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:18,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:18,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886845975] [2020-10-20 01:50:18,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:18,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:18,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:18,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:18,916 INFO L87 Difference]: Start difference. First operand 4335 states and 5521 transitions. Second operand 4 states. [2020-10-20 01:50:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:19,415 INFO L93 Difference]: Finished difference Result 7753 states and 9875 transitions. [2020-10-20 01:50:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:19,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-10-20 01:50:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:19,443 INFO L225 Difference]: With dead ends: 7753 [2020-10-20 01:50:19,444 INFO L226 Difference]: Without dead ends: 4373 [2020-10-20 01:50:19,451 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-10-20 01:50:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2020-10-20 01:50:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4099. [2020-10-20 01:50:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4099 states. [2020-10-20 01:50:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 5131 transitions. [2020-10-20 01:50:19,777 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 5131 transitions. Word has length 62 [2020-10-20 01:50:19,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:19,777 INFO L481 AbstractCegarLoop]: Abstraction has 4099 states and 5131 transitions. [2020-10-20 01:50:19,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 5131 transitions. [2020-10-20 01:50:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-20 01:50:19,785 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:19,785 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-10-20 01:50:19,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:50:19,786 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash -897301022, now seen corresponding path program 1 times [2020-10-20 01:50:19,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:19,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513617687] [2020-10-20 01:50:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 01:50:19,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513617687] [2020-10-20 01:50:19,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:19,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:50:19,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951967722] [2020-10-20 01:50:19,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:50:19,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:19,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:50:19,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:50:19,860 INFO L87 Difference]: Start difference. First operand 4099 states and 5131 transitions. Second operand 6 states. [2020-10-20 01:50:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:20,432 INFO L93 Difference]: Finished difference Result 6541 states and 8149 transitions. [2020-10-20 01:50:20,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 01:50:20,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2020-10-20 01:50:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:20,444 INFO L225 Difference]: With dead ends: 6541 [2020-10-20 01:50:20,445 INFO L226 Difference]: Without dead ends: 2561 [2020-10-20 01:50:20,450 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-10-20 01:50:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2020-10-20 01:50:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2056. [2020-10-20 01:50:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2020-10-20 01:50:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2538 transitions. [2020-10-20 01:50:20,607 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2538 transitions. Word has length 89 [2020-10-20 01:50:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:20,607 INFO L481 AbstractCegarLoop]: Abstraction has 2056 states and 2538 transitions. [2020-10-20 01:50:20,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:50:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2538 transitions. [2020-10-20 01:50:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-20 01:50:20,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:20,611 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-10-20 01:50:20,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:50:20,611 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:20,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1187170510, now seen corresponding path program 1 times [2020-10-20 01:50:20,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:20,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659186743] [2020-10-20 01:50:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-20 01:50:20,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659186743] [2020-10-20 01:50:20,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:20,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:20,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503715910] [2020-10-20 01:50:20,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:20,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:20,639 INFO L87 Difference]: Start difference. First operand 2056 states and 2538 transitions. Second operand 3 states. [2020-10-20 01:50:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:20,735 INFO L93 Difference]: Finished difference Result 2058 states and 2539 transitions. [2020-10-20 01:50:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:20,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-10-20 01:50:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:20,743 INFO L225 Difference]: With dead ends: 2058 [2020-10-20 01:50:20,744 INFO L226 Difference]: Without dead ends: 1569 [2020-10-20 01:50:20,745 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-10-20 01:50:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2020-10-20 01:50:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2020-10-20 01:50:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-10-20 01:50:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1947 transitions. [2020-10-20 01:50:20,866 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1947 transitions. Word has length 91 [2020-10-20 01:50:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:20,866 INFO L481 AbstractCegarLoop]: Abstraction has 1569 states and 1947 transitions. [2020-10-20 01:50:20,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1947 transitions. [2020-10-20 01:50:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-20 01:50:20,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:20,869 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-10-20 01:50:20,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:50:20,870 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:20,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:20,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1665450509, now seen corresponding path program 1 times [2020-10-20 01:50:20,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:20,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443760504] [2020-10-20 01:50:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:50:20,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443760504] [2020-10-20 01:50:20,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:20,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:20,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089001276] [2020-10-20 01:50:20,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:20,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:20,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:20,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:20,907 INFO L87 Difference]: Start difference. First operand 1569 states and 1947 transitions. Second operand 3 states. [2020-10-20 01:50:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:20,986 INFO L93 Difference]: Finished difference Result 2545 states and 3158 transitions. [2020-10-20 01:50:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:20,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-10-20 01:50:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:20,992 INFO L225 Difference]: With dead ends: 2545 [2020-10-20 01:50:20,992 INFO L226 Difference]: Without dead ends: 1095 [2020-10-20 01:50:20,995 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-10-20 01:50:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-10-20 01:50:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1026. [2020-10-20 01:50:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2020-10-20 01:50:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1255 transitions. [2020-10-20 01:50:21,076 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1255 transitions. Word has length 102 [2020-10-20 01:50:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:21,077 INFO L481 AbstractCegarLoop]: Abstraction has 1026 states and 1255 transitions. [2020-10-20 01:50:21,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1255 transitions. [2020-10-20 01:50:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-10-20 01:50:21,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:21,079 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-10-20 01:50:21,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:50:21,080 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:21,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash 60413158, now seen corresponding path program 1 times [2020-10-20 01:50:21,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:21,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972048169] [2020-10-20 01:50:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 01:50:21,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972048169] [2020-10-20 01:50:21,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:21,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:21,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611157119] [2020-10-20 01:50:21,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:21,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:21,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:21,126 INFO L87 Difference]: Start difference. First operand 1026 states and 1255 transitions. Second operand 3 states. [2020-10-20 01:50:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:21,197 INFO L93 Difference]: Finished difference Result 1802 states and 2227 transitions. [2020-10-20 01:50:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:21,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-10-20 01:50:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:21,212 INFO L225 Difference]: With dead ends: 1802 [2020-10-20 01:50:21,212 INFO L226 Difference]: Without dead ends: 1014 [2020-10-20 01:50:21,214 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-10-20 01:50:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2020-10-20 01:50:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 920. [2020-10-20 01:50:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-10-20 01:50:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1104 transitions. [2020-10-20 01:50:21,289 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1104 transitions. Word has length 104 [2020-10-20 01:50:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:21,289 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 1104 transitions. [2020-10-20 01:50:21,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1104 transitions. [2020-10-20 01:50:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-10-20 01:50:21,294 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:21,295 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-10-20 01:50:21,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:50:21,295 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1950390027, now seen corresponding path program 1 times [2020-10-20 01:50:21,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:21,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951187776] [2020-10-20 01:50:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 01:50:21,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951187776] [2020-10-20 01:50:21,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:21,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:21,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053425414] [2020-10-20 01:50:21,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:21,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:21,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:21,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:21,493 INFO L87 Difference]: Start difference. First operand 920 states and 1104 transitions. Second operand 4 states. [2020-10-20 01:50:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:21,595 INFO L93 Difference]: Finished difference Result 1775 states and 2123 transitions. [2020-10-20 01:50:21,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:21,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2020-10-20 01:50:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:21,599 INFO L225 Difference]: With dead ends: 1775 [2020-10-20 01:50:21,599 INFO L226 Difference]: Without dead ends: 893 [2020-10-20 01:50:21,601 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-10-20 01:50:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2020-10-20 01:50:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 872. [2020-10-20 01:50:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2020-10-20 01:50:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1033 transitions. [2020-10-20 01:50:21,662 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1033 transitions. Word has length 104 [2020-10-20 01:50:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:21,663 INFO L481 AbstractCegarLoop]: Abstraction has 872 states and 1033 transitions. [2020-10-20 01:50:21,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1033 transitions. [2020-10-20 01:50:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-20 01:50:21,665 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:21,665 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-10-20 01:50:21,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:50:21,666 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:21,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:21,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2146905671, now seen corresponding path program 1 times [2020-10-20 01:50:21,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:21,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977097847] [2020-10-20 01:50:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 01:50:21,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977097847] [2020-10-20 01:50:21,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:21,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:21,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744538952] [2020-10-20 01:50:21,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:21,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:21,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:21,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:21,731 INFO L87 Difference]: Start difference. First operand 872 states and 1033 transitions. Second operand 5 states. [2020-10-20 01:50:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:21,868 INFO L93 Difference]: Finished difference Result 2004 states and 2354 transitions. [2020-10-20 01:50:21,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:21,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2020-10-20 01:50:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:21,871 INFO L225 Difference]: With dead ends: 2004 [2020-10-20 01:50:21,871 INFO L226 Difference]: Without dead ends: 861 [2020-10-20 01:50:21,873 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-10-20 01:50:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-10-20 01:50:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 571. [2020-10-20 01:50:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2020-10-20 01:50:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 658 transitions. [2020-10-20 01:50:21,915 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 658 transitions. Word has length 105 [2020-10-20 01:50:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:21,915 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 658 transitions. [2020-10-20 01:50:21,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 658 transitions. [2020-10-20 01:50:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-10-20 01:50:21,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:21,919 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-10-20 01:50:21,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:50:21,919 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash 418386111, now seen corresponding path program 1 times [2020-10-20 01:50:21,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:21,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961487476] [2020-10-20 01:50:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-10-20 01:50:21,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961487476] [2020-10-20 01:50:21,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:21,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:21,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232199578] [2020-10-20 01:50:22,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:22,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:22,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:22,001 INFO L87 Difference]: Start difference. First operand 571 states and 658 transitions. Second operand 3 states. [2020-10-20 01:50:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:22,043 INFO L93 Difference]: Finished difference Result 743 states and 849 transitions. [2020-10-20 01:50:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:22,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-10-20 01:50:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:22,044 INFO L225 Difference]: With dead ends: 743 [2020-10-20 01:50:22,045 INFO L226 Difference]: Without dead ends: 290 [2020-10-20 01:50:22,045 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-10-20 01:50:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-10-20 01:50:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-10-20 01:50:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-10-20 01:50:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 314 transitions. [2020-10-20 01:50:22,082 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 314 transitions. Word has length 158 [2020-10-20 01:50:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:22,082 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 314 transitions. [2020-10-20 01:50:22,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 314 transitions. [2020-10-20 01:50:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-10-20 01:50:22,085 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:22,085 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-10-20 01:50:22,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:50:22,086 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1214361389, now seen corresponding path program 1 times [2020-10-20 01:50:22,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:22,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721434833] [2020-10-20 01:50:22,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-20 01:50:22,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721434833] [2020-10-20 01:50:22,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:22,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:22,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428138823] [2020-10-20 01:50:22,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:22,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:22,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:22,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:22,154 INFO L87 Difference]: Start difference. First operand 290 states and 314 transitions. Second operand 3 states. [2020-10-20 01:50:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:22,189 INFO L93 Difference]: Finished difference Result 487 states and 529 transitions. [2020-10-20 01:50:22,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:22,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-10-20 01:50:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:22,190 INFO L225 Difference]: With dead ends: 487 [2020-10-20 01:50:22,191 INFO L226 Difference]: Without dead ends: 288 [2020-10-20 01:50:22,191 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-10-20 01:50:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-10-20 01:50:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2020-10-20 01:50:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-10-20 01:50:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 307 transitions. [2020-10-20 01:50:22,214 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 307 transitions. Word has length 159 [2020-10-20 01:50:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:22,214 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 307 transitions. [2020-10-20 01:50:22,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 307 transitions. [2020-10-20 01:50:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-10-20 01:50:22,217 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:22,217 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-10-20 01:50:22,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:50:22,217 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:22,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1149090725, now seen corresponding path program 1 times [2020-10-20 01:50:22,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:22,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215532063] [2020-10-20 01:50:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 46 proven. 59 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-20 01:50:22,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215532063] [2020-10-20 01:50:22,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510039091] [2020-10-20 01:50:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:50:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:22,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 01:50:22,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:50:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-10-20 01:50:22,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:50:22,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2020-10-20 01:50:22,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155164927] [2020-10-20 01:50:22,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 01:50:22,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:22,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 01:50:22,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:50:22,624 INFO L87 Difference]: Start difference. First operand 288 states and 307 transitions. Second operand 9 states. [2020-10-20 01:50:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:22,709 INFO L93 Difference]: Finished difference Result 539 states and 577 transitions. [2020-10-20 01:50:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 01:50:22,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2020-10-20 01:50:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:22,711 INFO L225 Difference]: With dead ends: 539 [2020-10-20 01:50:22,711 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 01:50:22,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:50:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 01:50:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 01:50:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 01:50:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 01:50:22,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2020-10-20 01:50:22,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:22,714 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 01:50:22,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 01:50:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 01:50:22,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 01:50:22,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:50:22,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 01:50:23,253 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 138 [2020-10-20 01:50:23,375 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2020-10-20 01:50:23,632 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 127 [2020-10-20 01:50:24,277 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 135 [2020-10-20 01:50:24,471 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2020-10-20 01:50:25,220 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 136 [2020-10-20 01:50:26,316 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2020-10-20 01:50:26,741 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2020-10-20 01:50:27,030 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2020-10-20 01:50:28,109 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2020-10-20 01:50:28,594 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-10-20 01:50:29,072 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-10-20 01:50:29,556 WARN L193 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-10-20 01:50:30,086 WARN L193 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2020-10-20 01:50:30,657 WARN L193 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2020-10-20 01:50:31,118 WARN L193 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-10-20 01:50:31,505 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2020-10-20 01:50:32,504 WARN L193 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2020-10-20 01:50:33,071 WARN L193 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-10-20 01:50:33,635 WARN L193 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2020-10-20 01:50:33,888 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 39 [2020-10-20 01:50:34,452 WARN L193 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2020-10-20 01:50:34,930 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2020-10-20 01:50:35,228 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2020-10-20 01:50:35,772 WARN L193 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2020-10-20 01:50:36,372 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2020-10-20 01:50:36,864 WARN L193 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-10-20 01:50:37,942 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2020-10-20 01:50:37,947 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:37,947 INFO L274 CegarLoopResult]: For program point L267-1(lines 266 279) no Hoare annotation was computed. [2020-10-20 01:50:37,948 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-10-20 01:50:37,948 INFO L274 CegarLoopResult]: For program point L267-2(lines 267 271) no Hoare annotation was computed. [2020-10-20 01:50:37,948 INFO L274 CegarLoopResult]: For program point L267-4(lines 266 279) no Hoare annotation was computed. [2020-10-20 01:50:37,948 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-10-20 01:50:37,949 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-10-20 01:50:37,949 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-20 01:50:37,949 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-20 01:50:37,949 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 01:50:37,950 INFO L274 CegarLoopResult]: For program point L251(lines 251 256) no Hoare annotation was computed. [2020-10-20 01:50:37,950 INFO L274 CegarLoopResult]: For program point L251-1(lines 251 256) no Hoare annotation was computed. [2020-10-20 01:50:37,950 INFO L277 CegarLoopResult]: At program point L466(lines 457 468) the Hoare annotation is: true [2020-10-20 01:50:37,950 INFO L274 CegarLoopResult]: For program point L285-1(lines 284 297) no Hoare annotation was computed. [2020-10-20 01:50:37,950 INFO L274 CegarLoopResult]: For program point L285-3(lines 284 297) no Hoare annotation was computed. [2020-10-20 01:50:37,951 INFO L274 CegarLoopResult]: For program point L120(lines 120 128) no Hoare annotation was computed. [2020-10-20 01:50:37,951 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-10-20 01:50:37,951 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-10-20 01:50:37,952 INFO L277 CegarLoopResult]: At program point L434(lines 397 439) the Hoare annotation is: true [2020-10-20 01:50:37,952 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-10-20 01:50:37,952 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-10-20 01:50:37,952 INFO L274 CegarLoopResult]: For program point L336(lines 336 340) no Hoare annotation was computed. [2020-10-20 01:50:37,953 INFO L274 CegarLoopResult]: For program point L336-1(lines 331 371) no Hoare annotation was computed. [2020-10-20 01:50:37,953 INFO L274 CegarLoopResult]: For program point L386(lines 386 391) no Hoare annotation was computed. [2020-10-20 01:50:37,953 INFO L274 CegarLoopResult]: For program point L123(lines 123 127) no Hoare annotation was computed. [2020-10-20 01:50:37,953 INFO L274 CegarLoopResult]: For program point L57(lines 57 66) no Hoare annotation was computed. [2020-10-20 01:50:37,953 INFO L274 CegarLoopResult]: For program point L57-2(lines 57 66) no Hoare annotation was computed. [2020-10-20 01:50:37,954 INFO L274 CegarLoopResult]: For program point L57-3(lines 57 66) no Hoare annotation was computed. [2020-10-20 01:50:37,954 INFO L274 CegarLoopResult]: For program point L57-5(lines 57 66) no Hoare annotation was computed. [2020-10-20 01:50:37,954 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-10-20 01:50:37,954 INFO L274 CegarLoopResult]: For program point L173(lines 172 203) no Hoare annotation was computed. [2020-10-20 01:50:37,955 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-10-20 01:50:37,955 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-10-20 01:50:37,955 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 01:50:37,955 INFO L274 CegarLoopResult]: For program point L190(lines 190 202) no Hoare annotation was computed. [2020-10-20 01:50:37,955 INFO L274 CegarLoopResult]: For program point L58(lines 58 63) no Hoare annotation was computed. [2020-10-20 01:50:37,956 INFO L274 CegarLoopResult]: For program point L58-1(lines 58 63) no Hoare annotation was computed. [2020-10-20 01:50:37,956 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-10-20 01:50:37,956 INFO L274 CegarLoopResult]: For program point L174-1(lines 174 184) no Hoare annotation was computed. [2020-10-20 01:50:37,957 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-10-20 01:50:37,957 INFO L274 CegarLoopResult]: For program point L191(lines 191 197) no Hoare annotation was computed. [2020-10-20 01:50:37,957 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-10-20 01:50:37,958 INFO L274 CegarLoopResult]: For program point L307(lines 307 311) no Hoare annotation was computed. [2020-10-20 01:50:37,958 INFO L274 CegarLoopResult]: For program point L307-2(lines 307 311) no Hoare annotation was computed. [2020-10-20 01:50:37,958 INFO L274 CegarLoopResult]: For program point L307-3(lines 307 311) no Hoare annotation was computed. [2020-10-20 01:50:37,958 INFO L274 CegarLoopResult]: For program point L307-5(lines 307 311) no Hoare annotation was computed. [2020-10-20 01:50:37,958 INFO L274 CegarLoopResult]: For program point L76(lines 76 85) no Hoare annotation was computed. [2020-10-20 01:50:37,959 INFO L274 CegarLoopResult]: For program point L76-2(lines 76 85) no Hoare annotation was computed. [2020-10-20 01:50:37,959 INFO L274 CegarLoopResult]: For program point L76-3(lines 76 85) no Hoare annotation was computed. [2020-10-20 01:50:37,959 INFO L274 CegarLoopResult]: For program point L76-5(lines 76 85) no Hoare annotation was computed. [2020-10-20 01:50:37,959 INFO L274 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2020-10-20 01:50:37,959 INFO L274 CegarLoopResult]: For program point L27-2(lines 26 41) no Hoare annotation was computed. [2020-10-20 01:50:37,959 INFO L274 CegarLoopResult]: For program point L27-3(lines 27 31) no Hoare annotation was computed. [2020-10-20 01:50:37,960 INFO L274 CegarLoopResult]: For program point L27-5(lines 26 41) no Hoare annotation was computed. [2020-10-20 01:50:37,960 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-10-20 01:50:37,960 INFO L274 CegarLoopResult]: For program point L77(lines 77 82) no Hoare annotation was computed. [2020-10-20 01:50:37,961 INFO L274 CegarLoopResult]: For program point L77-1(lines 77 82) no Hoare annotation was computed. [2020-10-20 01:50:37,961 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-10-20 01:50:37,962 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-10-20 01:50:37,962 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 01:50:37,962 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-10-20 01:50:37,962 INFO L274 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-10-20 01:50:37,963 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-10-20 01:50:37,963 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-10-20 01:50:37,963 INFO L274 CegarLoopResult]: For program point L161(lines 161 169) no Hoare annotation was computed. [2020-10-20 01:50:37,964 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-10-20 01:50:37,964 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-10-20 01:50:37,964 INFO L274 CegarLoopResult]: For program point L360(lines 360 367) no Hoare annotation was computed. [2020-10-20 01:50:37,965 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-10-20 01:50:37,965 INFO L274 CegarLoopResult]: For program point L229-1(lines 228 241) no Hoare annotation was computed. [2020-10-20 01:50:37,965 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-10-20 01:50:37,965 INFO L274 CegarLoopResult]: For program point L345(lines 345 352) no Hoare annotation was computed. [2020-10-20 01:50:37,966 INFO L274 CegarLoopResult]: For program point L428(lines 428 432) no Hoare annotation was computed. [2020-10-20 01:50:37,966 INFO L274 CegarLoopResult]: For program point L164(lines 164 168) no Hoare annotation was computed. [2020-10-20 01:50:37,966 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-10-20 01:50:37,966 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 01:50:37,967 INFO L274 CegarLoopResult]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2020-10-20 01:50:37,967 INFO L274 CegarLoopResult]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2020-10-20 01:50:37,967 INFO L274 CegarLoopResult]: For program point L412(line 412) no Hoare annotation was computed. [2020-10-20 01:50:37,967 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:37,967 INFO L274 CegarLoopResult]: For program point L247(lines 247 257) no Hoare annotation was computed. [2020-10-20 01:50:37,967 INFO L274 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-10-20 01:50:37,968 INFO L274 CegarLoopResult]: For program point L247-1(lines 247 257) no Hoare annotation was computed. [2020-10-20 01:50:37,968 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-10-20 01:50:37,968 INFO L274 CegarLoopResult]: For program point L214-2(lines 214 220) no Hoare annotation was computed. [2020-10-20 01:50:37,968 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-10-20 01:50:37,969 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-10-20 01:50:37,969 INFO L274 CegarLoopResult]: For program point L132(lines 131 149) no Hoare annotation was computed. [2020-10-20 01:50:37,969 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-10-20 01:50:37,969 INFO L274 CegarLoopResult]: For program point L315(lines 315 319) no Hoare annotation was computed. [2020-10-20 01:50:37,970 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-10-20 01:50:37,970 INFO L274 CegarLoopResult]: For program point L315-3(lines 315 319) no Hoare annotation was computed. [2020-10-20 01:50:37,970 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-10-20 01:50:37,971 INFO L274 CegarLoopResult]: For program point L332(line 332) no Hoare annotation was computed. [2020-10-20 01:50:37,971 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-10-20 01:50:37,971 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-10-20 01:50:38,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:50:38 BoogieIcfgContainer [2020-10-20 01:50:38,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:50:38,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:50:38,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:50:38,106 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:50:38,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:14" (3/4) ... [2020-10-20 01:50:38,111 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 01:50:38,137 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 01:50:38,138 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-20 01:50:38,138 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:50:38,139 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:50:38,177 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-10-20 01:50:38,178 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-10-20 01:50:38,178 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-10-20 01:50:38,179 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-10-20 01:50:38,180 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-10-20 01:50:38,180 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-10-20 01:50:38,180 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-10-20 01:50:38,181 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-10-20 01:50:38,182 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-10-20 01:50:38,183 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-10-20 01:50:38,183 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-10-20 01:50:38,184 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-10-20 01:50:38,184 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-10-20 01:50:38,184 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-10-20 01:50:38,185 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-10-20 01:50:38,185 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-10-20 01:50:38,186 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-10-20 01:50:38,186 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-10-20 01:50:38,186 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-10-20 01:50:38,187 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-10-20 01:50:38,187 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-10-20 01:50:38,187 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-10-20 01:50:38,191 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-10-20 01:50:38,192 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-10-20 01:50:38,192 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-10-20 01:50:38,192 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-10-20 01:50:38,277 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:50:38,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:50:38,279 INFO L168 Benchmark]: Toolchain (without parser) took 25123.56 ms. Allocated memory was 41.9 MB in the beginning and 239.6 MB in the end (delta: 197.7 MB). Free memory was 21.1 MB in the beginning and 198.6 MB in the end (delta: -177.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:38,280 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 32.0 MB. Free memory was 9.8 MB in the beginning and 9.7 MB in the end (delta: 68.4 kB). Peak memory consumption was 68.4 kB. Max. memory is 14.3 GB. [2020-10-20 01:50:38,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.13 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 20.1 MB in the beginning and 18.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:38,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.94 ms. Allocated memory is still 42.5 MB. Free memory was 18.3 MB in the beginning and 15.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:38,281 INFO L168 Benchmark]: Boogie Preprocessor took 35.54 ms. Allocated memory is still 42.5 MB. Free memory was 15.8 MB in the beginning and 13.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:38,282 INFO L168 Benchmark]: RCFGBuilder took 541.11 ms. Allocated memory was 42.5 MB in the beginning and 44.6 MB in the end (delta: 2.1 MB). Free memory was 13.8 MB in the beginning and 18.2 MB in the end (delta: -4.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:38,282 INFO L168 Benchmark]: TraceAbstraction took 23933.59 ms. Allocated memory was 44.6 MB in the beginning and 239.6 MB in the end (delta: 195.0 MB). Free memory was 17.9 MB in the beginning and 206.3 MB in the end (delta: -188.4 MB). Peak memory consumption was 192.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:38,283 INFO L168 Benchmark]: Witness Printer took 172.06 ms. Allocated memory is still 239.6 MB. Free memory was 206.3 MB in the beginning and 198.6 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:38,287 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.73 ms. Allocated memory is still 32.0 MB. Free memory was 9.8 MB in the beginning and 9.7 MB in the end (delta: 68.4 kB). Peak memory consumption was 68.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 373.13 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 20.1 MB in the beginning and 18.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 56.94 ms. Allocated memory is still 42.5 MB. Free memory was 18.3 MB in the beginning and 15.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 35.54 ms. Allocated memory is still 42.5 MB. Free memory was 15.8 MB in the beginning and 13.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 541.11 ms. Allocated memory was 42.5 MB in the beginning and 44.6 MB in the end (delta: 2.1 MB). Free memory was 13.8 MB in the beginning and 18.2 MB in the end (delta: -4.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 14.3 GB. * TraceAbstraction took 23933.59 ms. Allocated memory was 44.6 MB in the beginning and 239.6 MB in the end (delta: 195.0 MB). Free memory was 17.9 MB in the beginning and 206.3 MB in the end (delta: -188.4 MB). Peak memory consumption was 192.6 MB. Max. memory is 14.3 GB. * Witness Printer took 172.06 ms. Allocated memory is still 239.6 MB. Free memory was 206.3 MB in the beginning and 198.6 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 14.3 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: 8.6s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3170 SDtfs, 3779 SDslu, 5037 SDs, 0 SdLazy, 467 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s 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.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 2562 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 405 NumberOfFragments, 8055 HoareAnnotationTreeSize, 33 FomulaSimplifications, 402440 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 33 FomulaSimplificationsInter, 48929 FormulaSimplificationTreeSizeReductionInter, 12.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s 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...