./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__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-30f4e4a [2019-11-28 00:26:59,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:26:59,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:26:59,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:26:59,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:26:59,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:26:59,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:26:59,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:26:59,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:26:59,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:26:59,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:26:59,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:26:59,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:26:59,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:26:59,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:26:59,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:26:59,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:26:59,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:26:59,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:26:59,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:26:59,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:26:59,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:26:59,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:26:59,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:26:59,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:26:59,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:26:59,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:26:59,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:26:59,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:26:59,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:26:59,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:26:59,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:26:59,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:26:59,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:26:59,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:26:59,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:26:59,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:26:59,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:26:59,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:26:59,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:26:59,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:26:59,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:26:59,992 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:26:59,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:26:59,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:26:59,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:26:59,997 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:26:59,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:26:59,997 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:26:59,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:26:59,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:26:59,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:26:59,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:26:59,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:26:59,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:26:59,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:26:59,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:26:59,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:27:00,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:27:00,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:27:00,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:27:00,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:27:00,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:27:00,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:27:00,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:27:00,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:27:00,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:27:00,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:27:00,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:27:00,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:27:00,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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-28 00:27:00,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:27:00,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:27:00,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:27:00,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:27:00,376 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:27:00,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-28 00:27:00,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5316406ac/4fabe3d0cd8d47938ae20ca45488acf0/FLAG3eff2ee4e [2019-11-28 00:27:00,914 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:27:00,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-28 00:27:00,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5316406ac/4fabe3d0cd8d47938ae20ca45488acf0/FLAG3eff2ee4e [2019-11-28 00:27:01,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5316406ac/4fabe3d0cd8d47938ae20ca45488acf0 [2019-11-28 00:27:01,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:27:01,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:27:01,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:01,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:27:01,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:27:01,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c492e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01, skipping insertion in model container [2019-11-28 00:27:01,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:27:01,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:27:01,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:01,607 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:27:01,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:01,761 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:27:01,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01 WrapperNode [2019-11-28 00:27:01,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:01,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:01,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:27:01,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:27:01,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:01,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:27:01,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:27:01,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:27:01,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... [2019-11-28 00:27:01,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:27:01,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:27:01,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:27:01,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:27:01,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:27:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:27:01,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:27:02,412 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:27:02,412 INFO L297 CfgBuilder]: Removed 42 assume(true) statements. [2019-11-28 00:27:02,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:02 BoogieIcfgContainer [2019-11-28 00:27:02,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:27:02,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:27:02,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:27:02,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:27:02,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:27:01" (1/3) ... [2019-11-28 00:27:02,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3fee4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:02, skipping insertion in model container [2019-11-28 00:27:02,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:01" (2/3) ... [2019-11-28 00:27:02,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3fee4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:02, skipping insertion in model container [2019-11-28 00:27:02,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:02" (3/3) ... [2019-11-28 00:27:02,424 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-11-28 00:27:02,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:27:02,445 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 00:27:02,458 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 00:27:02,481 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:27:02,482 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:27:02,482 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:27:02,482 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:27:02,482 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:27:02,482 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:27:02,483 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:27:02,483 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:27:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-28 00:27:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:27:02,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:02,507 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-28 00:27:02,507 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2019-11-28 00:27:02,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:02,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488822525] [2019-11-28 00:27:02,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:02,714 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-28 00:27:02,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488822525] [2019-11-28 00:27:02,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:02,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:02,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316367873] [2019-11-28 00:27:02,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:02,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:02,747 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-28 00:27:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:02,884 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2019-11-28 00:27:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:02,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-28 00:27:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:02,910 INFO L225 Difference]: With dead ends: 214 [2019-11-28 00:27:02,910 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 00:27:02,917 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-28 00:27:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 00:27:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2019-11-28 00:27:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 00:27:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-11-28 00:27:02,972 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2019-11-28 00:27:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:02,973 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-28 00:27:02,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2019-11-28 00:27:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:27:02,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:02,975 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-28 00:27:02,976 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2019-11-28 00:27:02,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:02,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243722875] [2019-11-28 00:27:02,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:03,060 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-28 00:27:03,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243722875] [2019-11-28 00:27:03,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:03,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:03,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987436454] [2019-11-28 00:27:03,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:03,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:03,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:03,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:03,064 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2019-11-28 00:27:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:03,142 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2019-11-28 00:27:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:03,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 00:27:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:03,145 INFO L225 Difference]: With dead ends: 323 [2019-11-28 00:27:03,146 INFO L226 Difference]: Without dead ends: 215 [2019-11-28 00:27:03,147 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-28 00:27:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-28 00:27:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2019-11-28 00:27:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-28 00:27:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2019-11-28 00:27:03,203 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2019-11-28 00:27:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:03,207 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2019-11-28 00:27:03,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2019-11-28 00:27:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:27:03,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:03,211 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-28 00:27:03,211 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:03,215 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2019-11-28 00:27:03,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:03,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049802825] [2019-11-28 00:27:03,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:03,322 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-28 00:27:03,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049802825] [2019-11-28 00:27:03,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:03,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:03,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546847708] [2019-11-28 00:27:03,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:03,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:03,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:03,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:03,324 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2019-11-28 00:27:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:03,395 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2019-11-28 00:27:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:03,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 00:27:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:03,399 INFO L225 Difference]: With dead ends: 526 [2019-11-28 00:27:03,399 INFO L226 Difference]: Without dead ends: 321 [2019-11-28 00:27:03,401 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-28 00:27:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-28 00:27:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2019-11-28 00:27:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-28 00:27:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2019-11-28 00:27:03,440 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2019-11-28 00:27:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:03,441 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2019-11-28 00:27:03,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2019-11-28 00:27:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 00:27:03,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:03,444 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-28 00:27:03,444 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:03,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2019-11-28 00:27:03,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:03,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316572293] [2019-11-28 00:27:03,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:03,507 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-28 00:27:03,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316572293] [2019-11-28 00:27:03,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:03,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:03,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696141852] [2019-11-28 00:27:03,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:03,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:03,510 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2019-11-28 00:27:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:03,564 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2019-11-28 00:27:03,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:03,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-28 00:27:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:03,568 INFO L225 Difference]: With dead ends: 740 [2019-11-28 00:27:03,568 INFO L226 Difference]: Without dead ends: 449 [2019-11-28 00:27:03,570 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-28 00:27:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-28 00:27:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-11-28 00:27:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-28 00:27:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2019-11-28 00:27:03,608 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2019-11-28 00:27:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:03,608 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2019-11-28 00:27:03,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2019-11-28 00:27:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 00:27:03,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:03,614 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-28 00:27:03,614 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:03,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:03,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2019-11-28 00:27:03,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:03,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742682463] [2019-11-28 00:27:03,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:03,684 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-28 00:27:03,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742682463] [2019-11-28 00:27:03,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:03,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:03,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293382763] [2019-11-28 00:27:03,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:03,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:03,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:03,687 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2019-11-28 00:27:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:03,752 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2019-11-28 00:27:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:03,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 00:27:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:03,756 INFO L225 Difference]: With dead ends: 914 [2019-11-28 00:27:03,757 INFO L226 Difference]: Without dead ends: 555 [2019-11-28 00:27:03,758 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-28 00:27:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-28 00:27:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-11-28 00:27:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-11-28 00:27:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2019-11-28 00:27:03,789 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2019-11-28 00:27:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:03,790 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2019-11-28 00:27:03,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2019-11-28 00:27:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 00:27:03,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:03,792 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-28 00:27:03,794 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2019-11-28 00:27:03,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:03,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991205687] [2019-11-28 00:27:03,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:03,894 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-28 00:27:03,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991205687] [2019-11-28 00:27:03,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:03,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:03,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202715960] [2019-11-28 00:27:03,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:03,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:03,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:03,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:03,899 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 3 states. [2019-11-28 00:27:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:03,959 INFO L93 Difference]: Finished difference Result 970 states and 1263 transitions. [2019-11-28 00:27:03,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:03,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 00:27:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:03,963 INFO L225 Difference]: With dead ends: 970 [2019-11-28 00:27:03,963 INFO L226 Difference]: Without dead ends: 553 [2019-11-28 00:27:03,964 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-28 00:27:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-28 00:27:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 512. [2019-11-28 00:27:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-28 00:27:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 649 transitions. [2019-11-28 00:27:03,995 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 649 transitions. Word has length 53 [2019-11-28 00:27:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:03,995 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 649 transitions. [2019-11-28 00:27:03,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 649 transitions. [2019-11-28 00:27:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 00:27:03,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:03,998 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-28 00:27:03,998 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash -68365718, now seen corresponding path program 1 times [2019-11-28 00:27:03,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:03,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574000844] [2019-11-28 00:27:03,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:04,092 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-28 00:27:04,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574000844] [2019-11-28 00:27:04,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:04,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:27:04,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657707149] [2019-11-28 00:27:04,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:27:04,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:04,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:27:04,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:27:04,101 INFO L87 Difference]: Start difference. First operand 512 states and 649 transitions. Second operand 4 states. [2019-11-28 00:27:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:04,149 INFO L93 Difference]: Finished difference Result 557 states and 702 transitions. [2019-11-28 00:27:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:27:04,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-28 00:27:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:04,155 INFO L225 Difference]: With dead ends: 557 [2019-11-28 00:27:04,155 INFO L226 Difference]: Without dead ends: 555 [2019-11-28 00:27:04,156 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-28 00:27:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-28 00:27:04,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 510. [2019-11-28 00:27:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-28 00:27:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 646 transitions. [2019-11-28 00:27:04,192 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 646 transitions. Word has length 53 [2019-11-28 00:27:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:04,192 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 646 transitions. [2019-11-28 00:27:04,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:27:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 646 transitions. [2019-11-28 00:27:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 00:27:04,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:04,195 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-28 00:27:04,196 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2119348827, now seen corresponding path program 1 times [2019-11-28 00:27:04,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:04,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663916361] [2019-11-28 00:27:04,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:04,378 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-28 00:27:04,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663916361] [2019-11-28 00:27:04,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744125893] [2019-11-28 00:27:04,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:27:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:04,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 00:27:04,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:27:04,585 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-28 00:27:04,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:27:04,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-28 00:27:04,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712205097] [2019-11-28 00:27:04,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:27:04,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:04,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:27:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:27:04,591 INFO L87 Difference]: Start difference. First operand 510 states and 646 transitions. Second operand 7 states. [2019-11-28 00:27:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:04,717 INFO L93 Difference]: Finished difference Result 1064 states and 1348 transitions. [2019-11-28 00:27:04,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:27:04,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-28 00:27:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:04,724 INFO L225 Difference]: With dead ends: 1064 [2019-11-28 00:27:04,724 INFO L226 Difference]: Without dead ends: 1062 [2019-11-28 00:27:04,725 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-28 00:27:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-28 00:27:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 761. [2019-11-28 00:27:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-28 00:27:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 971 transitions. [2019-11-28 00:27:04,795 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 971 transitions. Word has length 54 [2019-11-28 00:27:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:04,795 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 971 transitions. [2019-11-28 00:27:04,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:27:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 971 transitions. [2019-11-28 00:27:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:27:04,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:04,800 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-28 00:27:05,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:27:05,005 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash -797889608, now seen corresponding path program 2 times [2019-11-28 00:27:05,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:05,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959262376] [2019-11-28 00:27:05,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:05,046 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-28 00:27:05,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959262376] [2019-11-28 00:27:05,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:05,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:05,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792875107] [2019-11-28 00:27:05,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:05,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:05,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:05,048 INFO L87 Difference]: Start difference. First operand 761 states and 971 transitions. Second operand 3 states. [2019-11-28 00:27:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:05,115 INFO L93 Difference]: Finished difference Result 1240 states and 1589 transitions. [2019-11-28 00:27:05,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:05,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-28 00:27:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:05,119 INFO L225 Difference]: With dead ends: 1240 [2019-11-28 00:27:05,119 INFO L226 Difference]: Without dead ends: 705 [2019-11-28 00:27:05,121 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-28 00:27:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-28 00:27:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 685. [2019-11-28 00:27:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-28 00:27:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 860 transitions. [2019-11-28 00:27:05,209 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 860 transitions. Word has length 69 [2019-11-28 00:27:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:05,209 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 860 transitions. [2019-11-28 00:27:05,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 860 transitions. [2019-11-28 00:27:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-28 00:27:05,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:05,212 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-28 00:27:05,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:05,213 INFO L82 PathProgramCache]: Analyzing trace with hash -5008021, now seen corresponding path program 1 times [2019-11-28 00:27:05,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:05,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675045570] [2019-11-28 00:27:05,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:05,248 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-28 00:27:05,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675045570] [2019-11-28 00:27:05,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:05,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:05,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386124087] [2019-11-28 00:27:05,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:05,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:05,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:05,251 INFO L87 Difference]: Start difference. First operand 685 states and 860 transitions. Second operand 3 states. [2019-11-28 00:27:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:05,324 INFO L93 Difference]: Finished difference Result 1271 states and 1598 transitions. [2019-11-28 00:27:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:05,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-28 00:27:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:05,328 INFO L225 Difference]: With dead ends: 1271 [2019-11-28 00:27:05,329 INFO L226 Difference]: Without dead ends: 703 [2019-11-28 00:27:05,330 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-28 00:27:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-11-28 00:27:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 685. [2019-11-28 00:27:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-28 00:27:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 840 transitions. [2019-11-28 00:27:05,379 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 840 transitions. Word has length 80 [2019-11-28 00:27:05,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:05,379 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 840 transitions. [2019-11-28 00:27:05,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 840 transitions. [2019-11-28 00:27:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-28 00:27:05,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:05,382 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-28 00:27:05,382 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:05,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:05,382 INFO L82 PathProgramCache]: Analyzing trace with hash 184036267, now seen corresponding path program 1 times [2019-11-28 00:27:05,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:05,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579016581] [2019-11-28 00:27:05,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:05,407 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-28 00:27:05,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579016581] [2019-11-28 00:27:05,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:05,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:05,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471983847] [2019-11-28 00:27:05,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:05,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:05,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:05,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:05,409 INFO L87 Difference]: Start difference. First operand 685 states and 840 transitions. Second operand 3 states. [2019-11-28 00:27:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:05,451 INFO L93 Difference]: Finished difference Result 1147 states and 1413 transitions. [2019-11-28 00:27:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:05,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-28 00:27:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:05,454 INFO L225 Difference]: With dead ends: 1147 [2019-11-28 00:27:05,454 INFO L226 Difference]: Without dead ends: 574 [2019-11-28 00:27:05,456 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-28 00:27:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-28 00:27:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-11-28 00:27:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-28 00:27:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 706 transitions. [2019-11-28 00:27:05,495 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 706 transitions. Word has length 80 [2019-11-28 00:27:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:05,495 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 706 transitions. [2019-11-28 00:27:05,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 706 transitions. [2019-11-28 00:27:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:27:05,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:05,497 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-28 00:27:05,497 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:05,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1014536047, now seen corresponding path program 1 times [2019-11-28 00:27:05,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:05,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628702148] [2019-11-28 00:27:05,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:05,531 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-28 00:27:05,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628702148] [2019-11-28 00:27:05,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:05,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:05,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677522497] [2019-11-28 00:27:05,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:05,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:05,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:05,533 INFO L87 Difference]: Start difference. First operand 574 states and 706 transitions. Second operand 3 states. [2019-11-28 00:27:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:05,578 INFO L93 Difference]: Finished difference Result 812 states and 995 transitions. [2019-11-28 00:27:05,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:05,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-28 00:27:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:05,579 INFO L225 Difference]: With dead ends: 812 [2019-11-28 00:27:05,579 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:27:05,581 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-28 00:27:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:27:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:27:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:27:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:27:05,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-11-28 00:27:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:05,582 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:27:05,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:27:05,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:27:05,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:27:06,141 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-28 00:27:06,457 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-28 00:27:06,993 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:07,445 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:07,827 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:08,028 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-11-28 00:27:08,391 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:08,728 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:08,833 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-28 00:27:09,072 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-11-28 00:27:09,462 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:09,818 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:10,235 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:10,605 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:11,006 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-28 00:27:11,037 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-28 00:27:11,037 INFO L246 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2019-11-28 00:27:11,037 INFO L246 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2019-11-28 00:27:11,037 INFO L246 CegarLoopResult]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2019-11-28 00:27:11,038 INFO L242 CegarLoopResult]: 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-28 00:27:11,039 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:27:11,039 INFO L246 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2019-11-28 00:27:11,039 INFO L246 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-11-28 00:27:11,039 INFO L246 CegarLoopResult]: For program point L218-1(lines 218 223) no Hoare annotation was computed. [2019-11-28 00:27:11,039 INFO L246 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2019-11-28 00:27:11,039 INFO L246 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-28 00:27:11,040 INFO L246 CegarLoopResult]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-28 00:27:11,040 INFO L246 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2019-11-28 00:27:11,040 INFO L246 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2019-11-28 00:27:11,040 INFO L246 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2019-11-28 00:27:11,040 INFO L246 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2019-11-28 00:27:11,040 INFO L242 CegarLoopResult]: 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-28 00:27:11,041 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2019-11-28 00:27:11,041 INFO L246 CegarLoopResult]: For program point L74-3(lines 74 78) no Hoare annotation was computed. [2019-11-28 00:27:11,041 INFO L246 CegarLoopResult]: For program point L74-5(lines 74 78) no Hoare annotation was computed. [2019-11-28 00:27:11,041 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:27:11,041 INFO L246 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2019-11-28 00:27:11,041 INFO L246 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-28 00:27:11,041 INFO L246 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-28 00:27:11,041 INFO L246 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-11-28 00:27:11,042 INFO L242 CegarLoopResult]: 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-28 00:27:11,042 INFO L242 CegarLoopResult]: 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-28 00:27:11,042 INFO L242 CegarLoopResult]: 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-28 00:27:11,042 INFO L242 CegarLoopResult]: 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-28 00:27:11,042 INFO L246 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-11-28 00:27:11,043 INFO L246 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2019-11-28 00:27:11,043 INFO L242 CegarLoopResult]: 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-28 00:27:11,043 INFO L242 CegarLoopResult]: 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-28 00:27:11,043 INFO L242 CegarLoopResult]: 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-28 00:27:11,043 INFO L249 CegarLoopResult]: At program point L358(lines 349 360) the Hoare annotation is: true [2019-11-28 00:27:11,043 INFO L246 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2019-11-28 00:27:11,044 INFO L242 CegarLoopResult]: 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-28 00:27:11,044 INFO L242 CegarLoopResult]: 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-28 00:27:11,044 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:27:11,044 INFO L249 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2019-11-28 00:27:11,044 INFO L242 CegarLoopResult]: 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-28 00:27:11,044 INFO L242 CegarLoopResult]: 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-28 00:27:11,045 INFO L242 CegarLoopResult]: 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-28 00:27:11,045 INFO L242 CegarLoopResult]: 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-28 00:27:11,045 INFO L246 CegarLoopResult]: For program point L96(lines 96 104) no Hoare annotation was computed. [2019-11-28 00:27:11,045 INFO L242 CegarLoopResult]: 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-28 00:27:11,045 INFO L242 CegarLoopResult]: 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-28 00:27:11,045 INFO L242 CegarLoopResult]: 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-28 00:27:11,046 INFO L242 CegarLoopResult]: 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-28 00:27:11,046 INFO L246 CegarLoopResult]: For program point L196(lines 196 200) no Hoare annotation was computed. [2019-11-28 00:27:11,046 INFO L246 CegarLoopResult]: For program point L196-2(lines 195 208) no Hoare annotation was computed. [2019-11-28 00:27:11,046 INFO L246 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2019-11-28 00:27:11,046 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:27:11,046 INFO L246 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2019-11-28 00:27:11,046 INFO L246 CegarLoopResult]: For program point L32-3(lines 32 41) no Hoare annotation was computed. [2019-11-28 00:27:11,046 INFO L246 CegarLoopResult]: For program point L32-5(lines 32 41) no Hoare annotation was computed. [2019-11-28 00:27:11,046 INFO L242 CegarLoopResult]: 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-28 00:27:11,047 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-28 00:27:11,047 INFO L242 CegarLoopResult]: 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-28 00:27:11,047 INFO L242 CegarLoopResult]: 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-28 00:27:11,047 INFO L246 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2019-11-28 00:27:11,047 INFO L246 CegarLoopResult]: For program point L214-1(lines 214 224) no Hoare annotation was computed. [2019-11-28 00:27:11,047 INFO L246 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2019-11-28 00:27:11,047 INFO L242 CegarLoopResult]: 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-28 00:27:11,048 INFO L246 CegarLoopResult]: For program point L82-3(lines 82 86) no Hoare annotation was computed. [2019-11-28 00:27:11,048 INFO L242 CegarLoopResult]: 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-28 00:27:11,048 INFO L246 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2019-11-28 00:27:11,048 INFO L246 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-11-28 00:27:11,048 INFO L246 CegarLoopResult]: For program point L33-1(lines 33 38) no Hoare annotation was computed. [2019-11-28 00:27:11,048 INFO L246 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2019-11-28 00:27:11,048 INFO L246 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2019-11-28 00:27:11,048 INFO L246 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2019-11-28 00:27:11,048 INFO L246 CegarLoopResult]: For program point L51-3(lines 51 60) no Hoare annotation was computed. [2019-11-28 00:27:11,049 INFO L246 CegarLoopResult]: For program point L51-5(lines 51 60) no Hoare annotation was computed. [2019-11-28 00:27:11,049 INFO L242 CegarLoopResult]: 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-28 00:27:11,049 INFO L246 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2019-11-28 00:27:11,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:27:11 BoogieIcfgContainer [2019-11-28 00:27:11,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:27:11,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:27:11,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:27:11,117 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:27:11,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:02" (3/4) ... [2019-11-28 00:27:11,122 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:27:11,150 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:27:11,152 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:27:11,309 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:27:11,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:27:11,310 INFO L168 Benchmark]: Toolchain (without parser) took 10064.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -330.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:11,311 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:11,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:11,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:11,311 INFO L168 Benchmark]: Boogie Preprocessor took 59.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:11,312 INFO L168 Benchmark]: RCFGBuilder took 518.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:11,312 INFO L168 Benchmark]: TraceAbstraction took 8701.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.1 MB). Peak memory consumption was 452.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:11,312 INFO L168 Benchmark]: Witness Printer took 192.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:11,314 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 515.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 518.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8701.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.1 MB). Peak memory consumption was 452.3 MB. Max. memory is 11.5 GB. * Witness Printer took 192.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 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: 3.1s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, 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.5s 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, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 92635 SizeOfPredicates, 2 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 119/123 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...