./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/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-6b5699a [2019-11-25 08:50:02,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:02,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:02,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:02,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:02,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:02,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:02,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:02,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:02,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:02,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:02,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:02,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:02,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:02,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:02,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:02,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:02,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:02,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:02,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:02,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:02,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:02,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:02,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:02,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:02,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:02,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:02,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:02,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:02,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:02,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:02,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:02,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:02,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:02,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:02,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:02,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:02,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:02,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:02,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:02,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:02,593 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:50:02,605 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:02,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:02,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:02,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:02,607 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:02,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:02,607 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:50:02,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:50:02,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:50:02,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:02,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:50:02,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:50:02,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:50:02,609 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:50:02,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:02,609 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:02,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:50:02,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:02,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:02,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:50:02,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:50:02,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:02,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:02,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:50:02,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:50:02,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:50:02,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:50:02,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:50:02,612 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_5fcc80ac-06d5-4e12-9faf-accad72fa49c/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-25 08:50:02,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:02,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:02,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:02,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:02,762 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:02,763 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-25 08:50:02,812 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/data/f4f142c70/378e7fa69dd1419f82d0534d37df16bd/FLAGe2dfb9a12 [2019-11-25 08:50:03,240 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:03,243 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-25 08:50:03,254 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/data/f4f142c70/378e7fa69dd1419f82d0534d37df16bd/FLAGe2dfb9a12 [2019-11-25 08:50:03,602 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/data/f4f142c70/378e7fa69dd1419f82d0534d37df16bd [2019-11-25 08:50:03,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:03,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:03,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:03,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:03,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:03,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:03,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24881ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03, skipping insertion in model container [2019-11-25 08:50:03,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:03,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:03,659 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:03,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:03,946 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:50:03,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:03,989 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:50:03,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03 WrapperNode [2019-11-25 08:50:03,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:03,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:03,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:50:03,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:50:03,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:04,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:04,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:04,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:50:04,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:50:04,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:50:04,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:04,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:04,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:04,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:04,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:04,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:04,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... [2019-11-25 08:50:04,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:50:04,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:50:04,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:50:04,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:50:04,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/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-25 08:50:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:50:04,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:50:04,538 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:50:04,538 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-11-25 08:50:04,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:04 BoogieIcfgContainer [2019-11-25 08:50:04,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:50:04,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:50:04,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:50:04,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:50:04,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:50:03" (1/3) ... [2019-11-25 08:50:04,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648af648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:04, skipping insertion in model container [2019-11-25 08:50:04,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:03" (2/3) ... [2019-11-25 08:50:04,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648af648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:04, skipping insertion in model container [2019-11-25 08:50:04,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:04" (3/3) ... [2019-11-25 08:50:04,547 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-11-25 08:50:04,557 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:50:04,567 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-25 08:50:04,577 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-25 08:50:04,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:50:04,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:50:04,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:50:04,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:50:04,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:50:04,600 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:50:04,600 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:50:04,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:50:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-25 08:50:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:50:04,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:04,623 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-25 08:50:04,623 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2019-11-25 08:50:04,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202465280] [2019-11-25 08:50:04,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:04,792 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-25 08:50:04,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202465280] [2019-11-25 08:50:04,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:04,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:04,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924591106] [2019-11-25 08:50:04,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:04,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:04,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:04,825 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-25 08:50:04,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,942 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2019-11-25 08:50:04,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:04,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-25 08:50:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:04,962 INFO L225 Difference]: With dead ends: 214 [2019-11-25 08:50:04,962 INFO L226 Difference]: Without dead ends: 135 [2019-11-25 08:50:04,966 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-25 08:50:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-25 08:50:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2019-11-25 08:50:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-25 08:50:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-11-25 08:50:05,012 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2019-11-25 08:50:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,014 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-25 08:50:05,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2019-11-25 08:50:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:50:05,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,015 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-25 08:50:05,016 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2019-11-25 08:50:05,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883257704] [2019-11-25 08:50:05,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,070 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-25 08:50:05,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883257704] [2019-11-25 08:50:05,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:05,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187839990] [2019-11-25 08:50:05,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:05,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:05,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:05,073 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2019-11-25 08:50:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,139 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2019-11-25 08:50:05,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:05,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-25 08:50:05,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,142 INFO L225 Difference]: With dead ends: 323 [2019-11-25 08:50:05,142 INFO L226 Difference]: Without dead ends: 215 [2019-11-25 08:50:05,144 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-25 08:50:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-25 08:50:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2019-11-25 08:50:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-25 08:50:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2019-11-25 08:50:05,179 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2019-11-25 08:50:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,179 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2019-11-25 08:50:05,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2019-11-25 08:50:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:50:05,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,182 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-25 08:50:05,184 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,185 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2019-11-25 08:50:05,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417029812] [2019-11-25 08:50:05,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,248 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-25 08:50:05,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417029812] [2019-11-25 08:50:05,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:05,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728457948] [2019-11-25 08:50:05,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:05,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:05,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:05,250 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2019-11-25 08:50:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,292 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2019-11-25 08:50:05,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:05,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-25 08:50:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,295 INFO L225 Difference]: With dead ends: 526 [2019-11-25 08:50:05,296 INFO L226 Difference]: Without dead ends: 321 [2019-11-25 08:50:05,297 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-25 08:50:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-25 08:50:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2019-11-25 08:50:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-25 08:50:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2019-11-25 08:50:05,326 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2019-11-25 08:50:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,327 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2019-11-25 08:50:05,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2019-11-25 08:50:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:50:05,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,330 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-25 08:50:05,331 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2019-11-25 08:50:05,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129800718] [2019-11-25 08:50:05,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,379 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-25 08:50:05,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129800718] [2019-11-25 08:50:05,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:05,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664165107] [2019-11-25 08:50:05,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:05,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:05,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:05,381 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2019-11-25 08:50:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,466 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2019-11-25 08:50:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:05,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-25 08:50:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,470 INFO L225 Difference]: With dead ends: 740 [2019-11-25 08:50:05,470 INFO L226 Difference]: Without dead ends: 449 [2019-11-25 08:50:05,472 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-25 08:50:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-25 08:50:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-11-25 08:50:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-25 08:50:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2019-11-25 08:50:05,505 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2019-11-25 08:50:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,505 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2019-11-25 08:50:05,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2019-11-25 08:50:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:50:05,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,510 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-25 08:50:05,510 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2019-11-25 08:50:05,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982277134] [2019-11-25 08:50:05,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,547 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-25 08:50:05,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982277134] [2019-11-25 08:50:05,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:05,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628993365] [2019-11-25 08:50:05,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:05,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:05,549 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2019-11-25 08:50:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,599 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2019-11-25 08:50:05,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:05,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-25 08:50:05,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,603 INFO L225 Difference]: With dead ends: 914 [2019-11-25 08:50:05,604 INFO L226 Difference]: Without dead ends: 555 [2019-11-25 08:50:05,605 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-25 08:50:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-25 08:50:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-11-25 08:50:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-11-25 08:50:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2019-11-25 08:50:05,641 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2019-11-25 08:50:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,643 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2019-11-25 08:50:05,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2019-11-25 08:50:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:50:05,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,647 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-25 08:50:05,647 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2019-11-25 08:50:05,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574081406] [2019-11-25 08:50:05,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,735 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-25 08:50:05,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574081406] [2019-11-25 08:50:05,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:05,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902288816] [2019-11-25 08:50:05,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:05,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:05,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:05,737 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 3 states. [2019-11-25 08:50:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,788 INFO L93 Difference]: Finished difference Result 970 states and 1263 transitions. [2019-11-25 08:50:05,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:05,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-25 08:50:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,792 INFO L225 Difference]: With dead ends: 970 [2019-11-25 08:50:05,792 INFO L226 Difference]: Without dead ends: 553 [2019-11-25 08:50:05,793 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-25 08:50:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-25 08:50:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 512. [2019-11-25 08:50:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-25 08:50:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 649 transitions. [2019-11-25 08:50:05,820 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 649 transitions. Word has length 53 [2019-11-25 08:50:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,820 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 649 transitions. [2019-11-25 08:50:05,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 649 transitions. [2019-11-25 08:50:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:50:05,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,823 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-25 08:50:05,823 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,824 INFO L82 PathProgramCache]: Analyzing trace with hash -68365718, now seen corresponding path program 1 times [2019-11-25 08:50:05,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461880918] [2019-11-25 08:50:05,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,932 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-25 08:50:05,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461880918] [2019-11-25 08:50:05,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:05,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045948309] [2019-11-25 08:50:05,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:05,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:05,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:05,935 INFO L87 Difference]: Start difference. First operand 512 states and 649 transitions. Second operand 4 states. [2019-11-25 08:50:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:05,979 INFO L93 Difference]: Finished difference Result 557 states and 702 transitions. [2019-11-25 08:50:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:05,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-25 08:50:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,983 INFO L225 Difference]: With dead ends: 557 [2019-11-25 08:50:05,984 INFO L226 Difference]: Without dead ends: 555 [2019-11-25 08:50:05,984 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-25 08:50:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-25 08:50:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 510. [2019-11-25 08:50:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-25 08:50:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 646 transitions. [2019-11-25 08:50:06,015 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 646 transitions. Word has length 53 [2019-11-25 08:50:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:06,015 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 646 transitions. [2019-11-25 08:50:06,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 646 transitions. [2019-11-25 08:50:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-25 08:50:06,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:06,017 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-25 08:50:06,018 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2119348827, now seen corresponding path program 1 times [2019-11-25 08:50:06,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:06,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624446095] [2019-11-25 08:50:06,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,105 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-25 08:50:06,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624446095] [2019-11-25 08:50:06,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791783660] [2019-11-25 08:50:06,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/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-25 08:50:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:50:06,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:06,249 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-25 08:50:06,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:50:06,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-25 08:50:06,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68137964] [2019-11-25 08:50:06,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:50:06,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:06,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:50:06,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:06,251 INFO L87 Difference]: Start difference. First operand 510 states and 646 transitions. Second operand 7 states. [2019-11-25 08:50:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:06,340 INFO L93 Difference]: Finished difference Result 1064 states and 1348 transitions. [2019-11-25 08:50:06,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:06,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-25 08:50:06,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:06,346 INFO L225 Difference]: With dead ends: 1064 [2019-11-25 08:50:06,347 INFO L226 Difference]: Without dead ends: 1062 [2019-11-25 08:50:06,347 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-25 08:50:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-25 08:50:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 761. [2019-11-25 08:50:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-25 08:50:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 971 transitions. [2019-11-25 08:50:06,400 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 971 transitions. Word has length 54 [2019-11-25 08:50:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:06,400 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 971 transitions. [2019-11-25 08:50:06,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:50:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 971 transitions. [2019-11-25 08:50:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:50:06,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:06,403 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-25 08:50:06,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:50:06,609 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:06,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:06,609 INFO L82 PathProgramCache]: Analyzing trace with hash -797889608, now seen corresponding path program 2 times [2019-11-25 08:50:06,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:06,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746154019] [2019-11-25 08:50:06,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,644 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-25 08:50:06,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746154019] [2019-11-25 08:50:06,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:06,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:06,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872306087] [2019-11-25 08:50:06,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:06,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:06,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:06,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:06,646 INFO L87 Difference]: Start difference. First operand 761 states and 971 transitions. Second operand 3 states. [2019-11-25 08:50:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:06,714 INFO L93 Difference]: Finished difference Result 1240 states and 1589 transitions. [2019-11-25 08:50:06,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:06,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-25 08:50:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:06,718 INFO L225 Difference]: With dead ends: 1240 [2019-11-25 08:50:06,718 INFO L226 Difference]: Without dead ends: 705 [2019-11-25 08:50:06,720 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-25 08:50:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-25 08:50:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 685. [2019-11-25 08:50:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-25 08:50:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 860 transitions. [2019-11-25 08:50:06,778 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 860 transitions. Word has length 69 [2019-11-25 08:50:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:06,778 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 860 transitions. [2019-11-25 08:50:06,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 860 transitions. [2019-11-25 08:50:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-25 08:50:06,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:06,796 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-25 08:50:06,796 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash -5008021, now seen corresponding path program 1 times [2019-11-25 08:50:06,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:06,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035909983] [2019-11-25 08:50:06,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,835 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-25 08:50:06,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035909983] [2019-11-25 08:50:06,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:06,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:06,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268531455] [2019-11-25 08:50:06,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:06,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:06,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:06,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:06,837 INFO L87 Difference]: Start difference. First operand 685 states and 860 transitions. Second operand 3 states. [2019-11-25 08:50:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:06,903 INFO L93 Difference]: Finished difference Result 1271 states and 1598 transitions. [2019-11-25 08:50:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:06,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-25 08:50:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:06,907 INFO L225 Difference]: With dead ends: 1271 [2019-11-25 08:50:06,907 INFO L226 Difference]: Without dead ends: 703 [2019-11-25 08:50:06,908 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-25 08:50:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-11-25 08:50:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 685. [2019-11-25 08:50:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-25 08:50:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 840 transitions. [2019-11-25 08:50:06,949 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 840 transitions. Word has length 80 [2019-11-25 08:50:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:06,950 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 840 transitions. [2019-11-25 08:50:06,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 840 transitions. [2019-11-25 08:50:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-25 08:50:06,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:06,952 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-25 08:50:06,952 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:06,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:06,953 INFO L82 PathProgramCache]: Analyzing trace with hash 184036267, now seen corresponding path program 1 times [2019-11-25 08:50:06,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:06,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244812491] [2019-11-25 08:50:06,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,977 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-25 08:50:06,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244812491] [2019-11-25 08:50:06,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:06,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:06,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627078867] [2019-11-25 08:50:06,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:06,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:06,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:06,980 INFO L87 Difference]: Start difference. First operand 685 states and 840 transitions. Second operand 3 states. [2019-11-25 08:50:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:07,018 INFO L93 Difference]: Finished difference Result 1147 states and 1413 transitions. [2019-11-25 08:50:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:07,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-25 08:50:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:07,022 INFO L225 Difference]: With dead ends: 1147 [2019-11-25 08:50:07,022 INFO L226 Difference]: Without dead ends: 574 [2019-11-25 08:50:07,023 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-25 08:50:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-25 08:50:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-11-25 08:50:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-25 08:50:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 706 transitions. [2019-11-25 08:50:07,059 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 706 transitions. Word has length 80 [2019-11-25 08:50:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:07,059 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 706 transitions. [2019-11-25 08:50:07,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 706 transitions. [2019-11-25 08:50:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-25 08:50:07,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:07,061 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-25 08:50:07,062 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:07,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1014536047, now seen corresponding path program 1 times [2019-11-25 08:50:07,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:07,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031999883] [2019-11-25 08:50:07,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:07,092 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-25 08:50:07,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031999883] [2019-11-25 08:50:07,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:07,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:07,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603277326] [2019-11-25 08:50:07,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:07,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:07,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:07,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:07,095 INFO L87 Difference]: Start difference. First operand 574 states and 706 transitions. Second operand 3 states. [2019-11-25 08:50:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:07,137 INFO L93 Difference]: Finished difference Result 812 states and 995 transitions. [2019-11-25 08:50:07,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:07,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-25 08:50:07,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:07,138 INFO L225 Difference]: With dead ends: 812 [2019-11-25 08:50:07,138 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:50:07,139 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-25 08:50:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:50:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:50:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:50:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:50:07,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-11-25 08:50:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:07,140 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:50:07,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:50:07,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:50:07,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:50:07,639 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-25 08:50:07,879 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-25 08:50:08,300 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:08,797 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:09,237 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:09,427 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-11-25 08:50:09,826 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:10,121 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:10,375 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-11-25 08:50:10,694 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:10,936 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:11,227 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:11,491 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:11,764 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-25 08:50:11,781 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-25 08:50:11,781 INFO L444 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2019-11-25 08:50:11,781 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2019-11-25 08:50:11,782 INFO L444 ceAbstractionStarter]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2019-11-25 08:50:11,782 INFO L440 ceAbstractionStarter]: At program point L300(lines 284 302) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,782 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:50:11,782 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2019-11-25 08:50:11,782 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-11-25 08:50:11,783 INFO L444 ceAbstractionStarter]: For program point L218-1(lines 218 223) no Hoare annotation was computed. [2019-11-25 08:50:11,783 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2019-11-25 08:50:11,783 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-25 08:50:11,783 INFO L444 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-25 08:50:11,783 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2019-11-25 08:50:11,783 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2019-11-25 08:50:11,783 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2019-11-25 08:50:11,783 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2019-11-25 08:50:11,784 INFO L440 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= 1 ~q_free~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse0 (= ~c_num_read~0 0)) (.cse5 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse9 (= 0 ~q_free~0)) (.cse8 (<= 2 ~c_dr_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and (or (and .cse0 .cse9 (= 1 ~p_num_write~0) .cse3 .cse4) (let ((.cse10 (+ ~c_num_read~0 1))) (and (<= .cse10 ~p_num_write~0) .cse9 (<= ~p_num_write~0 .cse10) .cse4 .cse11))) .cse5 .cse6) (and (or (and .cse9 .cse8 .cse3 .cse4) (and .cse9 .cse8 .cse4 .cse11)) .cse6))) [2019-11-25 08:50:11,784 INFO L444 ceAbstractionStarter]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2019-11-25 08:50:11,784 INFO L444 ceAbstractionStarter]: For program point L74-3(lines 74 78) no Hoare annotation was computed. [2019-11-25 08:50:11,784 INFO L444 ceAbstractionStarter]: For program point L74-5(lines 74 78) no Hoare annotation was computed. [2019-11-25 08:50:11,784 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:50:11,784 INFO L444 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2019-11-25 08:50:11,784 INFO L444 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-25 08:50:11,785 INFO L444 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-25 08:50:11,785 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-11-25 08:50:11,785 INFO L440 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0)) (.cse0 (= ~c_num_read~0 0)) (.cse2 (= 0 ~p_dw_pc~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse3 (= 1 ~p_dw_pc~0) .cse4) (and .cse0 (= ~c_dr_pc~0 0) .cse2 .cse3 (= ~c_dr_st~0 0) .cse4 .cse5))) [2019-11-25 08:50:11,785 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-25 08:50:11,786 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) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (= 1 ~c_dr_i~0)) [2019-11-25 08:50:11,786 INFO L440 ceAbstractionStarter]: At program point L10-1(lines 138 190) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~c_num_read~0 0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= 0 ~p_dw_st~0)) (.cse10 (= 0 ~p_dw_pc~0)) (.cse11 (= 0 ~p_num_write~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~p_dw_pc~0)) (.cse7 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 .cse3 .cse10 .cse5 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse10 .cse5 .cse7 .cse11) (let ((.cse12 (+ ~c_num_read~0 1))) (and (<= .cse12 ~p_num_write~0) (= 0 ~q_free~0) .cse9 (<= ~p_num_write~0 .cse12) .cse5 .cse6 .cse7)))) [2019-11-25 08:50:11,786 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-11-25 08:50:11,786 INFO L444 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2019-11-25 08:50:11,786 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_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (= 1 ~c_dr_i~0))) [2019-11-25 08:50:11,787 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-25 08:50:11,787 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) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (= 1 ~c_dr_i~0)) [2019-11-25 08:50:11,787 INFO L447 ceAbstractionStarter]: At program point L358(lines 349 360) the Hoare annotation is: true [2019-11-25 08:50:11,787 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2019-11-25 08:50:11,803 INFO L440 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,804 INFO L440 ceAbstractionStarter]: At program point L226-1(lines 213 228) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,804 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:50:11,804 INFO L447 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2019-11-25 08:50:11,804 INFO L440 ceAbstractionStarter]: At program point L227(lines 210 229) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,805 INFO L440 ceAbstractionStarter]: At program point L227-1(lines 210 229) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,805 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-25 08:50:11,805 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 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-25 08:50:11,805 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 104) no Hoare annotation was computed. [2019-11-25 08:50:11,806 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-25 08:50:11,806 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 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-25 08:50:11,806 INFO L440 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,806 INFO L440 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,807 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 200) no Hoare annotation was computed. [2019-11-25 08:50:11,807 INFO L444 ceAbstractionStarter]: For program point L196-2(lines 195 208) no Hoare annotation was computed. [2019-11-25 08:50:11,807 INFO L444 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2019-11-25 08:50:11,807 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:50:11,807 INFO L444 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2019-11-25 08:50:11,807 INFO L444 ceAbstractionStarter]: For program point L32-3(lines 32 41) no Hoare annotation was computed. [2019-11-25 08:50:11,808 INFO L444 ceAbstractionStarter]: For program point L32-5(lines 32 41) no Hoare annotation was computed. [2019-11-25 08:50:11,808 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-25 08:50:11,808 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-25 08:50:11,808 INFO L440 ceAbstractionStarter]: At program point L313-1(lines 192 325) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,809 INFO L440 ceAbstractionStarter]: At program point L247(lines 237 277) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,809 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2019-11-25 08:50:11,809 INFO L444 ceAbstractionStarter]: For program point L214-1(lines 214 224) no Hoare annotation was computed. [2019-11-25 08:50:11,809 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2019-11-25 08:50:11,810 INFO L440 ceAbstractionStarter]: At program point L82-2(lines 66 90) the Hoare annotation is: (let ((.cse1 (= 0 ~p_dw_pc~0)) (.cse0 (= 0 ~q_free~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0)) (.cse5 (= 1 ~c_dr_i~0))) (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 (<= ~p_num_write~0 .cse3) .cse2 .cse4))) (= ~c_dr_st~0 0) .cse5) (and (let ((.cse6 (<= 2 ~c_dr_st~0))) (or (and .cse0 .cse6 .cse1 .cse2) (and .cse0 .cse6 .cse2 .cse4))) .cse5))) [2019-11-25 08:50:11,811 INFO L444 ceAbstractionStarter]: For program point L82-3(lines 82 86) no Hoare annotation was computed. [2019-11-25 08:50:11,811 INFO L440 ceAbstractionStarter]: At program point L82-5(lines 66 90) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-25 08:50:11,811 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2019-11-25 08:50:11,812 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-11-25 08:50:11,812 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 33 38) no Hoare annotation was computed. [2019-11-25 08:50:11,812 INFO L444 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2019-11-25 08:50:11,812 INFO L444 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2019-11-25 08:50:11,812 INFO L444 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2019-11-25 08:50:11,812 INFO L444 ceAbstractionStarter]: For program point L51-3(lines 51 60) no Hoare annotation was computed. [2019-11-25 08:50:11,812 INFO L444 ceAbstractionStarter]: For program point L51-5(lines 51 60) no Hoare annotation was computed. [2019-11-25 08:50:11,813 INFO L440 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-25 08:50:11,813 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2019-11-25 08:50:11,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:11 BoogieIcfgContainer [2019-11-25 08:50:11,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:11,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:11,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:11,879 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:11,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:04" (3/4) ... [2019-11-25 08:50:11,882 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:50:11,898 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:50:11,899 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:50:12,028 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5fcc80ac-06d5-4e12-9faf-accad72fa49c/bin/uautomizer/witness.graphml [2019-11-25 08:50:12,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:12,029 INFO L168 Benchmark]: Toolchain (without parser) took 8424.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 950.1 MB in the beginning and 1.3 GB in the end (delta: -334.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:12,029 INFO L168 Benchmark]: CDTParser took 0.22 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-25 08:50:12,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:12,031 INFO L168 Benchmark]: Boogie Preprocessor took 26.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,031 INFO L168 Benchmark]: RCFGBuilder took 482.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,031 INFO L168 Benchmark]: TraceAbstraction took 7337.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.2 MB). Peak memory consumption was 454.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,032 INFO L168 Benchmark]: Witness Printer took 149.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,033 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.22 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 384.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 482.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7337.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.2 MB). Peak memory consumption was 454.0 MB. Max. memory is 11.5 GB. * Witness Printer took 149.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 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_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_dr_st == 0) && 1 == c_dr_i) || (((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 1 == c_dr_i) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - 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 && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write) || (((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || (((((((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_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_dr_st == 0) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 1 == c_dr_i) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 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: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 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 && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || ((((((c_num_read == 0 && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 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: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 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: 7.2s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, 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, 3057 HoareAnnotationTreeSize, 27 FomulaSimplifications, 3145 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 27 FomulaSimplificationsInter, 2018 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s 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...