./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa63abe8d244d72d8b78f82e911235dbe511cfc8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:49:25,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:49:25,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:49:25,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:49:25,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:49:25,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:49:25,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:49:25,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:49:25,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:49:25,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:49:25,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:49:25,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:49:25,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:49:25,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:49:25,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:49:25,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:49:25,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:49:25,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:49:25,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:49:25,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:49:25,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:49:25,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:49:25,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:49:25,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:49:25,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:49:25,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:49:25,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:49:25,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:49:25,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:49:25,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:49:25,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:49:25,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:49:25,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:49:25,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:49:25,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:49:25,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:49:25,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:49:25,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:49:25,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:49:25,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:49:25,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:49:25,226 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:49:25,251 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:49:25,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:49:25,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:49:25,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:49:25,253 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:49:25,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:49:25,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:49:25,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:49:25,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:49:25,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:49:25,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:49:25,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:49:25,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:49:25,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:49:25,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:49:25,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:49:25,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:49:25,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:49:25,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:49:25,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:49:25,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:49:25,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:49:25,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:49:25,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:49:25,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:49:25,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:49:25,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:49:25,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:49:25,258 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2019-11-20 00:49:25,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:49:25,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:49:25,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:49:25,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:49:25,493 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:49:25,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-20 00:49:25,565 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/data/c69408833/68a81aa958344fb2802d05e96100db9a/FLAGe6f10005e [2019-11-20 00:49:25,977 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:49:25,978 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-20 00:49:25,986 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/data/c69408833/68a81aa958344fb2802d05e96100db9a/FLAGe6f10005e [2019-11-20 00:49:26,359 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/data/c69408833/68a81aa958344fb2802d05e96100db9a [2019-11-20 00:49:26,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:49:26,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:49:26,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:49:26,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:49:26,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:49:26,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681ef91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26, skipping insertion in model container [2019-11-20 00:49:26,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,379 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:49:26,429 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:49:26,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:49:26,748 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:49:26,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:49:26,826 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:49:26,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26 WrapperNode [2019-11-20 00:49:26,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:49:26,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:49:26,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:49:26,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:49:26,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:49:26,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:49:26,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:49:26,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:49:26,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... [2019-11-20 00:49:26,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:49:26,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:49:26,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:49:26,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:49:26,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:49:27,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:49:27,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:49:27,458 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:49:27,458 INFO L285 CfgBuilder]: Removed 42 assume(true) statements. [2019-11-20 00:49:27,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:49:27 BoogieIcfgContainer [2019-11-20 00:49:27,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:49:27,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:49:27,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:49:27,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:49:27,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:49:26" (1/3) ... [2019-11-20 00:49:27,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438acf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:49:27, skipping insertion in model container [2019-11-20 00:49:27,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:26" (2/3) ... [2019-11-20 00:49:27,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438acf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:49:27, skipping insertion in model container [2019-11-20 00:49:27,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:49:27" (3/3) ... [2019-11-20 00:49:27,466 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-11-20 00:49:27,473 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:49:27,480 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-20 00:49:27,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-20 00:49:27,512 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:49:27,513 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:49:27,513 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:49:27,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:49:27,513 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:49:27,513 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:49:27,513 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:49:27,514 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:49:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-20 00:49:27,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 00:49:27,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:27,542 INFO L410 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] [2019-11-20 00:49:27,542 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2019-11-20 00:49:27,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:27,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758287036] [2019-11-20 00:49:27,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:27,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758287036] [2019-11-20 00:49:27,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:27,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:27,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342081203] [2019-11-20 00:49:27,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:27,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:27,769 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-20 00:49:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:27,854 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2019-11-20 00:49:27,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:27,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-20 00:49:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:27,870 INFO L225 Difference]: With dead ends: 214 [2019-11-20 00:49:27,870 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 00:49:27,873 INFO L630 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 [2019-11-20 00:49:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 00:49:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2019-11-20 00:49:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 00:49:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-11-20 00:49:27,926 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2019-11-20 00:49:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:27,927 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-20 00:49:27,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2019-11-20 00:49:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 00:49:27,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:27,930 INFO L410 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] [2019-11-20 00:49:27,930 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:27,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:27,931 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2019-11-20 00:49:27,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:27,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309777367] [2019-11-20 00:49:27,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:27,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309777367] [2019-11-20 00:49:27,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:27,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:27,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158663628] [2019-11-20 00:49:27,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:27,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:27,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:27,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:27,994 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2019-11-20 00:49:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:28,071 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2019-11-20 00:49:28,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:28,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-20 00:49:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:28,079 INFO L225 Difference]: With dead ends: 323 [2019-11-20 00:49:28,079 INFO L226 Difference]: Without dead ends: 215 [2019-11-20 00:49:28,081 INFO L630 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 [2019-11-20 00:49:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-20 00:49:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2019-11-20 00:49:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-20 00:49:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2019-11-20 00:49:28,126 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2019-11-20 00:49:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:28,127 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2019-11-20 00:49:28,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2019-11-20 00:49:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 00:49:28,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:28,130 INFO L410 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] [2019-11-20 00:49:28,131 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:28,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:28,131 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2019-11-20 00:49:28,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:28,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595521334] [2019-11-20 00:49:28,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:28,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595521334] [2019-11-20 00:49:28,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:28,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:28,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190840563] [2019-11-20 00:49:28,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:28,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:28,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:28,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:28,218 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2019-11-20 00:49:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:28,273 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2019-11-20 00:49:28,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:28,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-20 00:49:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:28,278 INFO L225 Difference]: With dead ends: 526 [2019-11-20 00:49:28,278 INFO L226 Difference]: Without dead ends: 321 [2019-11-20 00:49:28,280 INFO L630 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 [2019-11-20 00:49:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-20 00:49:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2019-11-20 00:49:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-20 00:49:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2019-11-20 00:49:28,311 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2019-11-20 00:49:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:28,311 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2019-11-20 00:49:28,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2019-11-20 00:49:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 00:49:28,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:28,315 INFO L410 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] [2019-11-20 00:49:28,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2019-11-20 00:49:28,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:28,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033510448] [2019-11-20 00:49:28,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:28,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033510448] [2019-11-20 00:49:28,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:28,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:28,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721201294] [2019-11-20 00:49:28,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:28,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:28,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:28,371 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2019-11-20 00:49:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:28,439 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2019-11-20 00:49:28,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:28,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-20 00:49:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:28,443 INFO L225 Difference]: With dead ends: 740 [2019-11-20 00:49:28,443 INFO L226 Difference]: Without dead ends: 449 [2019-11-20 00:49:28,445 INFO L630 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 [2019-11-20 00:49:28,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-20 00:49:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-11-20 00:49:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-20 00:49:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2019-11-20 00:49:28,481 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2019-11-20 00:49:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:28,481 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2019-11-20 00:49:28,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2019-11-20 00:49:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 00:49:28,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:28,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:49:28,487 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:28,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:28,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2019-11-20 00:49:28,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:28,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055033032] [2019-11-20 00:49:28,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:28,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055033032] [2019-11-20 00:49:28,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:28,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:28,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291099088] [2019-11-20 00:49:28,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:28,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:28,566 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2019-11-20 00:49:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:28,608 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2019-11-20 00:49:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:28,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-20 00:49:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:28,613 INFO L225 Difference]: With dead ends: 914 [2019-11-20 00:49:28,613 INFO L226 Difference]: Without dead ends: 555 [2019-11-20 00:49:28,615 INFO L630 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 [2019-11-20 00:49:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-20 00:49:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-11-20 00:49:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-11-20 00:49:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2019-11-20 00:49:28,653 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2019-11-20 00:49:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:28,656 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2019-11-20 00:49:28,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2019-11-20 00:49:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 00:49:28,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:28,665 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-20 00:49:28,666 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:28,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2019-11-20 00:49:28,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:28,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614355949] [2019-11-20 00:49:28,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:49:28,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614355949] [2019-11-20 00:49:28,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:28,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:28,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543731864] [2019-11-20 00:49:28,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:28,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:28,752 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 3 states. [2019-11-20 00:49:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:28,818 INFO L93 Difference]: Finished difference Result 970 states and 1263 transitions. [2019-11-20 00:49:28,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:28,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-20 00:49:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:28,823 INFO L225 Difference]: With dead ends: 970 [2019-11-20 00:49:28,824 INFO L226 Difference]: Without dead ends: 553 [2019-11-20 00:49:28,825 INFO L630 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 [2019-11-20 00:49:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-20 00:49:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 512. [2019-11-20 00:49:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-20 00:49:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 649 transitions. [2019-11-20 00:49:28,855 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 649 transitions. Word has length 53 [2019-11-20 00:49:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:28,855 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 649 transitions. [2019-11-20 00:49:28,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 649 transitions. [2019-11-20 00:49:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 00:49:28,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:28,857 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-20 00:49:28,858 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash -68365718, now seen corresponding path program 1 times [2019-11-20 00:49:28,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:28,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616363596] [2019-11-20 00:49:28,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:28,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616363596] [2019-11-20 00:49:28,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:28,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:49:28,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470394055] [2019-11-20 00:49:28,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:49:28,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:49:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:49:28,927 INFO L87 Difference]: Start difference. First operand 512 states and 649 transitions. Second operand 4 states. [2019-11-20 00:49:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:28,974 INFO L93 Difference]: Finished difference Result 557 states and 702 transitions. [2019-11-20 00:49:28,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:49:28,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-20 00:49:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:28,979 INFO L225 Difference]: With dead ends: 557 [2019-11-20 00:49:28,980 INFO L226 Difference]: Without dead ends: 555 [2019-11-20 00:49:28,981 INFO L630 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 [2019-11-20 00:49:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-20 00:49:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 510. [2019-11-20 00:49:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-20 00:49:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 646 transitions. [2019-11-20 00:49:29,018 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 646 transitions. Word has length 53 [2019-11-20 00:49:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:29,019 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 646 transitions. [2019-11-20 00:49:29,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:49:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 646 transitions. [2019-11-20 00:49:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 00:49:29,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:29,022 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:49:29,022 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:29,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2119348827, now seen corresponding path program 1 times [2019-11-20 00:49:29,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:29,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134519581] [2019-11-20 00:49:29,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:29,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134519581] [2019-11-20 00:49:29,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989620847] [2019-11-20 00:49:29,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:49:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:29,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 00:49:29,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:49:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:29,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:49:29,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-20 00:49:29,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439633569] [2019-11-20 00:49:29,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:49:29,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:49:29,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:49:29,352 INFO L87 Difference]: Start difference. First operand 510 states and 646 transitions. Second operand 7 states. [2019-11-20 00:49:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:29,443 INFO L93 Difference]: Finished difference Result 1064 states and 1348 transitions. [2019-11-20 00:49:29,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:49:29,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-20 00:49:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:29,450 INFO L225 Difference]: With dead ends: 1064 [2019-11-20 00:49:29,451 INFO L226 Difference]: Without dead ends: 1062 [2019-11-20 00:49:29,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:49:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-20 00:49:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 761. [2019-11-20 00:49:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-20 00:49:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 971 transitions. [2019-11-20 00:49:29,544 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 971 transitions. Word has length 54 [2019-11-20 00:49:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:29,544 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 971 transitions. [2019-11-20 00:49:29,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:49:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 971 transitions. [2019-11-20 00:49:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 00:49:29,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:29,549 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-20 00:49:29,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:49:29,768 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash -797889608, now seen corresponding path program 2 times [2019-11-20 00:49:29,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:29,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883102336] [2019-11-20 00:49:29,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:29,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883102336] [2019-11-20 00:49:29,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:29,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:29,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553641133] [2019-11-20 00:49:29,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:29,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:29,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:29,822 INFO L87 Difference]: Start difference. First operand 761 states and 971 transitions. Second operand 3 states. [2019-11-20 00:49:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:29,888 INFO L93 Difference]: Finished difference Result 1240 states and 1589 transitions. [2019-11-20 00:49:29,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:29,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-20 00:49:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:29,893 INFO L225 Difference]: With dead ends: 1240 [2019-11-20 00:49:29,894 INFO L226 Difference]: Without dead ends: 705 [2019-11-20 00:49:29,895 INFO L630 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 [2019-11-20 00:49:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-20 00:49:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 685. [2019-11-20 00:49:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-20 00:49:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 860 transitions. [2019-11-20 00:49:29,950 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 860 transitions. Word has length 69 [2019-11-20 00:49:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:29,950 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 860 transitions. [2019-11-20 00:49:29,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 860 transitions. [2019-11-20 00:49:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 00:49:29,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:29,953 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-20 00:49:29,954 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash -5008021, now seen corresponding path program 1 times [2019-11-20 00:49:29,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:29,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39510554] [2019-11-20 00:49:29,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:49:29,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39510554] [2019-11-20 00:49:29,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:29,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:29,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379710303] [2019-11-20 00:49:29,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:30,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:30,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:30,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:30,001 INFO L87 Difference]: Start difference. First operand 685 states and 860 transitions. Second operand 3 states. [2019-11-20 00:49:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:30,081 INFO L93 Difference]: Finished difference Result 1271 states and 1598 transitions. [2019-11-20 00:49:30,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:30,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-20 00:49:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:30,087 INFO L225 Difference]: With dead ends: 1271 [2019-11-20 00:49:30,087 INFO L226 Difference]: Without dead ends: 703 [2019-11-20 00:49:30,091 INFO L630 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 [2019-11-20 00:49:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-11-20 00:49:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 685. [2019-11-20 00:49:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-20 00:49:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 840 transitions. [2019-11-20 00:49:30,143 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 840 transitions. Word has length 80 [2019-11-20 00:49:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:30,143 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 840 transitions. [2019-11-20 00:49:30,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 840 transitions. [2019-11-20 00:49:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 00:49:30,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:30,146 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-20 00:49:30,147 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:30,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash 184036267, now seen corresponding path program 1 times [2019-11-20 00:49:30,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:30,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252276556] [2019-11-20 00:49:30,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 00:49:30,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252276556] [2019-11-20 00:49:30,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:30,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:30,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062401178] [2019-11-20 00:49:30,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:30,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:30,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:30,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:30,185 INFO L87 Difference]: Start difference. First operand 685 states and 840 transitions. Second operand 3 states. [2019-11-20 00:49:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:30,230 INFO L93 Difference]: Finished difference Result 1147 states and 1413 transitions. [2019-11-20 00:49:30,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:30,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-20 00:49:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:30,234 INFO L225 Difference]: With dead ends: 1147 [2019-11-20 00:49:30,234 INFO L226 Difference]: Without dead ends: 574 [2019-11-20 00:49:30,236 INFO L630 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 [2019-11-20 00:49:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-20 00:49:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-11-20 00:49:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-20 00:49:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 706 transitions. [2019-11-20 00:49:30,279 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 706 transitions. Word has length 80 [2019-11-20 00:49:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:30,280 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 706 transitions. [2019-11-20 00:49:30,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 706 transitions. [2019-11-20 00:49:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 00:49:30,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:30,282 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-20 00:49:30,283 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:30,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1014536047, now seen corresponding path program 1 times [2019-11-20 00:49:30,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:49:30,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241676909] [2019-11-20 00:49:30,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:49:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:49:30,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241676909] [2019-11-20 00:49:30,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:49:30,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:49:30,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034378529] [2019-11-20 00:49:30,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:49:30,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:49:30,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:49:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:49:30,334 INFO L87 Difference]: Start difference. First operand 574 states and 706 transitions. Second operand 3 states. [2019-11-20 00:49:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:30,382 INFO L93 Difference]: Finished difference Result 812 states and 995 transitions. [2019-11-20 00:49:30,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:49:30,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-20 00:49:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:30,383 INFO L225 Difference]: With dead ends: 812 [2019-11-20 00:49:30,383 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:49:30,385 INFO L630 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 [2019-11-20 00:49:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:49:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:49:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:49:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:49:30,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-11-20 00:49:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:30,390 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:49:30,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:49:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:49:30,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:49:30,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:49:31,049 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-20 00:49:31,332 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 00:49:31,861 WARN L191 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:32,361 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:32,813 WARN L191 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:32,941 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-11-20 00:49:33,090 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-11-20 00:49:33,526 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:33,848 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:34,143 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-11-20 00:49:34,505 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:34,913 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:35,308 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:35,618 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:35,913 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 00:49:35,933 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-20 00:49:35,933 INFO L444 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2019-11-20 00:49:35,933 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2019-11-20 00:49:35,933 INFO L444 ceAbstractionStarter]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L440 ceAbstractionStarter]: At program point L300(lines 284 302) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point L218-1(lines 218 223) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2019-11-20 00:49:35,934 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2019-11-20 00:49:35,935 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2019-11-20 00:49:35,938 INFO L440 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse5 (= ~p_dw_pc~0 1)) (.cse1 (= 0 ~q_free~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse0 (= ~c_num_read~0 0)) (.cse9 (= ~q_free~0 1)) (.cse8 (<= 2 ~c_dr_st~0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= 0 ~p_dw_pc~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and (or (and .cse0 .cse1 (= 1 ~p_num_write~0) .cse2 .cse3) (let ((.cse4 (+ ~c_num_read~0 1))) (and (<= .cse4 ~p_num_write~0) .cse1 .cse5 (<= ~p_num_write~0 .cse4) .cse3))) .cse6 .cse7) (and (or (and .cse1 .cse8 .cse5 .cse3) (and .cse1 .cse8 .cse2 .cse3)) .cse7) (and .cse0 .cse9 .cse10 (= ~c_dr_pc~0 0) .cse2 .cse3 .cse6 .cse7 .cse11) (and .cse0 .cse9 .cse8 .cse10 .cse2 .cse3 .cse7 .cse11))) [2019-11-20 00:49:35,939 INFO L444 ceAbstractionStarter]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2019-11-20 00:49:35,939 INFO L444 ceAbstractionStarter]: For program point L74-3(lines 74 78) no Hoare annotation was computed. [2019-11-20 00:49:35,939 INFO L444 ceAbstractionStarter]: For program point L74-5(lines 74 78) no Hoare annotation was computed. [2019-11-20 00:49:35,939 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:49:35,939 INFO L444 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2019-11-20 00:49:35,939 INFO L444 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-20 00:49:35,939 INFO L444 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-20 00:49:35,939 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-11-20 00:49:35,940 INFO L440 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse5 (<= 2 ~c_dr_st~0)) (.cse1 (= 0 ~p_dw_pc~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~c_dr_i~0 1)) (.cse4 (= 0 ~p_num_write~0))) (or (and .cse0 (= ~c_dr_pc~0 0) .cse1 .cse2 (= ~c_dr_st~0 0) .cse3 .cse4) (and (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse5 (= ~p_dw_pc~0 1) .cse2) .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse4))) [2019-11-20 00:49:35,940 INFO L440 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-11-20 00:49:35,940 INFO L440 ceAbstractionStarter]: At program point L43-1(lines 31 45) the Hoare annotation is: (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (= ~q_free~0 1) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_pc~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_i~0 1)) [2019-11-20 00:49:35,940 INFO L440 ceAbstractionStarter]: At program point L10-1(lines 138 190) the Hoare annotation is: (let ((.cse1 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse9 (= ~c_num_read~0 0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 0 ~p_dw_st~0)) (.cse10 (= 0 ~p_dw_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (and .cse8 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) .cse0) (and .cse9 .cse3 .cse8 .cse4 .cse10 .cse7 .cse0 .cse11) (and (= 0 ~q_free~0) .cse8 (let ((.cse12 (+ ~c_num_read~0 1))) (and (<= .cse12 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse12) .cse7)) .cse0) (and .cse9 .cse3 .cse4 .cse6 .cse10 .cse7 .cse0 .cse11))) [2019-11-20 00:49:35,941 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-11-20 00:49:35,941 INFO L444 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2019-11-20 00:49:35,941 INFO L440 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (<= .cse0 ~p_num_write~0) (= 0 ~q_free~0) (<= 2 ~p_dw_st~0) (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_i~0 1))) [2019-11-20 00:49:35,941 INFO L440 ceAbstractionStarter]: At program point L44(lines 28 46) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-11-20 00:49:35,941 INFO L440 ceAbstractionStarter]: At program point L44-1(lines 28 46) the Hoare annotation is: (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (= ~q_free~0 1) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_pc~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_i~0 1)) [2019-11-20 00:49:35,942 INFO L447 ceAbstractionStarter]: At program point L358(lines 349 360) the Hoare annotation is: true [2019-11-20 00:49:35,942 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2019-11-20 00:49:35,942 INFO L440 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,943 INFO L440 ceAbstractionStarter]: At program point L226-1(lines 213 228) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,943 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:49:35,943 INFO L447 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2019-11-20 00:49:35,943 INFO L440 ceAbstractionStarter]: At program point L227(lines 210 229) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,944 INFO L440 ceAbstractionStarter]: At program point L227-1(lines 210 229) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,944 INFO L440 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-11-20 00:49:35,944 INFO L440 ceAbstractionStarter]: At program point L62-1(lines 50 64) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_dr_i~0 1))) (or (and (<= 2 ~p_dw_st~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~p_dw_st~0) .cse5) .cse6))) [2019-11-20 00:49:35,944 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 104) no Hoare annotation was computed. [2019-11-20 00:49:35,944 INFO L440 ceAbstractionStarter]: At program point L63(lines 47 65) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-11-20 00:49:35,945 INFO L440 ceAbstractionStarter]: At program point L63-1(lines 47 65) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_dr_i~0 1))) (or (and (<= 2 ~p_dw_st~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~p_dw_st~0) .cse5) .cse6))) [2019-11-20 00:49:35,945 INFO L440 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,945 INFO L440 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,945 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 200) no Hoare annotation was computed. [2019-11-20 00:49:35,945 INFO L444 ceAbstractionStarter]: For program point L196-2(lines 195 208) no Hoare annotation was computed. [2019-11-20 00:49:35,945 INFO L444 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2019-11-20 00:49:35,945 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:49:35,945 INFO L444 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2019-11-20 00:49:35,945 INFO L444 ceAbstractionStarter]: For program point L32-3(lines 32 41) no Hoare annotation was computed. [2019-11-20 00:49:35,946 INFO L444 ceAbstractionStarter]: For program point L32-5(lines 32 41) no Hoare annotation was computed. [2019-11-20 00:49:35,946 INFO L440 ceAbstractionStarter]: At program point L346(lines 332 348) the Hoare annotation is: (and (= ~c_num_read~0 0) (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= ~c_dr_pc~0 0) (= 0 ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_dr_i~0 1) (= 0 ~p_num_write~0)) [2019-11-20 00:49:35,946 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-20 00:49:35,946 INFO L440 ceAbstractionStarter]: At program point L313-1(lines 192 325) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,946 INFO L440 ceAbstractionStarter]: At program point L247(lines 237 277) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,947 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2019-11-20 00:49:35,947 INFO L444 ceAbstractionStarter]: For program point L214-1(lines 214 224) no Hoare annotation was computed. [2019-11-20 00:49:35,947 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2019-11-20 00:49:35,947 INFO L440 ceAbstractionStarter]: At program point L82-2(lines 66 90) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 1)) (.cse0 (= 0 ~q_free~0)) (.cse1 (= 0 ~p_dw_pc~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and (or (and (= ~c_num_read~0 0) .cse0 (= 1 ~p_num_write~0) .cse1 .cse2) (let ((.cse3 (+ ~c_num_read~0 1))) (and (<= .cse3 ~p_num_write~0) .cse0 .cse4 (<= ~p_num_write~0 .cse3) .cse2))) (= ~c_dr_st~0 0) .cse5) (and (let ((.cse6 (<= 2 ~c_dr_st~0))) (or (and .cse0 .cse6 .cse4 .cse2) (and .cse0 .cse6 .cse1 .cse2))) .cse5))) [2019-11-20 00:49:35,947 INFO L444 ceAbstractionStarter]: For program point L82-3(lines 82 86) no Hoare annotation was computed. [2019-11-20 00:49:35,948 INFO L440 ceAbstractionStarter]: At program point L82-5(lines 66 90) the Hoare annotation is: (let ((.cse1 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (= ~c_dr_i~0 1))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~p_dw_st~0) .cse6)) (and (<= 2 ~p_dw_st~0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse0))) [2019-11-20 00:49:35,948 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2019-11-20 00:49:35,948 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-11-20 00:49:35,948 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 33 38) no Hoare annotation was computed. [2019-11-20 00:49:35,948 INFO L444 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2019-11-20 00:49:35,949 INFO L444 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2019-11-20 00:49:35,949 INFO L444 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2019-11-20 00:49:35,949 INFO L444 ceAbstractionStarter]: For program point L51-3(lines 51 60) no Hoare annotation was computed. [2019-11-20 00:49:35,949 INFO L444 ceAbstractionStarter]: For program point L51-5(lines 51 60) no Hoare annotation was computed. [2019-11-20 00:49:35,949 INFO L440 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: (let ((.cse12 (<= 2 ~c_dr_st~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse2 (and .cse12 .cse16 .cse9)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ~q_free~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse3 (= ~c_dr_i~0 1)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11) (and .cse4 .cse5 .cse1 .cse12 .cse6 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse2) .cse1 .cse3) (and .cse4 .cse5 .cse12 .cse6 .cse15 .cse8 .cse9 .cse3 .cse11) (and (and .cse13 .cse14 .cse12 .cse16 .cse15 .cse9) .cse3) (and .cse0 .cse1 (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) .cse16 (<= ~p_num_write~0 .cse17) .cse9)) .cse10 .cse3) (and .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11)))) [2019-11-20 00:49:35,950 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2019-11-20 00:49:36,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:49:36 BoogieIcfgContainer [2019-11-20 00:49:36,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:49:36,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:49:36,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:49:36,019 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:49:36,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:49:27" (3/4) ... [2019-11-20 00:49:36,023 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:49:36,038 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 00:49:36,039 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:49:36,129 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b5880563-c746-4b23-aec1-793caf465438/bin/uautomizer/witness.graphml [2019-11-20 00:49:36,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:49:36,131 INFO L168 Benchmark]: Toolchain (without parser) took 9767.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 242.2 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -224.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:36,131 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:49:36,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:36,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:36,132 INFO L168 Benchmark]: Boogie Preprocessor took 53.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:49:36,133 INFO L168 Benchmark]: RCFGBuilder took 518.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:36,133 INFO L168 Benchmark]: TraceAbstraction took 8557.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -74.2 MB). Peak memory consumption was 291.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:36,133 INFO L168 Benchmark]: Witness Printer took 111.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:36,135 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 462.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 518.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8557.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -74.2 MB). Peak memory consumption was 291.8 MB. Max. memory is 11.5 GB. * Witness Printer took 111.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((((c_num_read + 1 <= p_num_write && 0 == q_free) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0)) && c_dr_st == 0) && c_dr_i == 1) || (((((0 == q_free && 2 <= c_dr_st) && p_dw_pc == 1) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((((c_num_read + 1 <= p_num_write && 0 == q_free) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0)) && c_dr_st == 0) && c_dr_i == 1) || (((((0 == q_free && 2 <= c_dr_st) && p_dw_pc == 1) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || (((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1)) || (((((c_num_read == 0 && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (c_dr_i == 1 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) || ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_i == 1 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((c_dr_i == 1 && (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) || ((2 <= p_dw_st && ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1)) || (((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || (((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_i == 1)) || (((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && 2 <= p_dw_st) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && c_dr_i == 1) || (((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && (2 <= c_dr_st && p_dw_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st) && c_dr_i == 1)) || ((((((((c_num_read == 0 && q_free == 1) && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_i == 1) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_dw_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && c_dr_i == 1)) || ((((0 == q_free && 2 <= p_dw_st) && ((c_num_read + 1 <= p_num_write && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1)) || (((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 2 error locations. Result: SAFE, OverallTime: 8.4s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.5s, HoareTripleCheckerStatistics: 1443 SDtfs, 1095 SDslu, 1141 SDs, 0 SdLazy, 117 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=761occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 474 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 157 NumberOfFragments, 3120 HoareAnnotationTreeSize, 27 FomulaSimplifications, 2984 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 27 FomulaSimplificationsInter, 1955 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 92635 SizeOfPredicates, 2 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 119/123 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...