./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:39:11,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:39:11,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:39:11,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:39:11,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:39:11,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:39:11,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:39:11,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:39:11,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:39:11,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:39:11,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:39:11,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:39:11,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:39:11,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:39:11,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:39:11,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:39:11,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:39:11,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:39:11,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:39:11,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:39:11,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:39:11,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:39:11,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:39:11,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:39:11,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:39:11,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:39:11,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:39:11,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:39:11,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:39:11,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:39:11,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:39:11,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:39:11,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:39:11,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:39:11,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:39:11,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:39:11,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:39:11,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:39:11,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:39:11,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:39:11,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:39:11,551 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:39:11,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:39:11,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:39:11,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:39:11,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:39:11,567 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:39:11,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:39:11,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:39:11,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:39:11,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:39:11,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:39:11,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:39:11,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:39:11,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:39:11,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:39:11,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:39:11,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:39:11,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:39:11,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:39:11,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:39:11,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:39:11,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:39:11,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:39:11,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:39:11,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:39:11,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:39:11,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:39:11,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:39:11,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:39:11,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 [2019-11-15 23:39:11,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:39:11,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:39:11,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:39:11,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:39:11,632 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:39:11,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/../../sv-benchmarks/c/systemc/toy.cil.c [2019-11-15 23:39:11,695 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/data/ed069f18c/a93d8dfc4d954407a7ee417014aed0ae/FLAGe5ac74455 [2019-11-15 23:39:12,190 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:39:12,194 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/sv-benchmarks/c/systemc/toy.cil.c [2019-11-15 23:39:12,211 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/data/ed069f18c/a93d8dfc4d954407a7ee417014aed0ae/FLAGe5ac74455 [2019-11-15 23:39:12,540 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/data/ed069f18c/a93d8dfc4d954407a7ee417014aed0ae [2019-11-15 23:39:12,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:39:12,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:39:12,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:39:12,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:39:12,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:39:12,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:12,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277e830e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12, skipping insertion in model container [2019-11-15 23:39:12,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:12,558 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:39:12,612 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:39:12,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:39:12,919 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:39:12,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:39:12,986 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:39:12,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12 WrapperNode [2019-11-15 23:39:12,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:39:12,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:39:12,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:39:12,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:39:12,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:13,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:13,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:39:13,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:39:13,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:39:13,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:39:13,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:13,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:13,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:13,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:13,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:13,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:13,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... [2019-11-15 23:39:13,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:39:13,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:39:13,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:39:13,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:39:13,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:39:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:39:13,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:39:13,668 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:39:13,668 INFO L284 CfgBuilder]: Removed 26 assume(true) statements. [2019-11-15 23:39:13,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:39:13 BoogieIcfgContainer [2019-11-15 23:39:13,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:39:13,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:39:13,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:39:13,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:39:13,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:39:12" (1/3) ... [2019-11-15 23:39:13,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584e2838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:39:13, skipping insertion in model container [2019-11-15 23:39:13,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:12" (2/3) ... [2019-11-15 23:39:13,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584e2838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:39:13, skipping insertion in model container [2019-11-15 23:39:13,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:39:13" (3/3) ... [2019-11-15 23:39:13,678 INFO L109 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2019-11-15 23:39:13,687 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:39:13,694 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:39:13,704 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:39:13,737 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:39:13,737 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:39:13,737 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:39:13,737 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:39:13,737 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:39:13,738 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:39:13,738 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:39:13,739 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:39:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-15 23:39:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:13,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:13,777 INFO L380 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] [2019-11-15 23:39:13,779 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:13,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:13,784 INFO L82 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2019-11-15 23:39:13,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:13,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282259598] [2019-11-15 23:39:13,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:13,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:13,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:13,948 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-15 23:39:13,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282259598] [2019-11-15 23:39:13,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:13,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:13,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389253486] [2019-11-15 23:39:13,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:13,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:13,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:13,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:13,969 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-15 23:39:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:14,011 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2019-11-15 23:39:14,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:14,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 23:39:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:14,024 INFO L225 Difference]: With dead ends: 244 [2019-11-15 23:39:14,024 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 23:39:14,028 INFO L600 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-15 23:39:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 23:39:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-11-15 23:39:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 23:39:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2019-11-15 23:39:14,069 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2019-11-15 23:39:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:14,070 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2019-11-15 23:39:14,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2019-11-15 23:39:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:14,072 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:14,073 INFO L380 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] [2019-11-15 23:39:14,073 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2019-11-15 23:39:14,073 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:14,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199702146] [2019-11-15 23:39:14,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:14,174 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-15 23:39:14,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199702146] [2019-11-15 23:39:14,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:14,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:14,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603721565] [2019-11-15 23:39:14,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:14,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:14,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:14,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:14,178 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand 3 states. [2019-11-15 23:39:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:14,213 INFO L93 Difference]: Finished difference Result 234 states and 414 transitions. [2019-11-15 23:39:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:14,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 23:39:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:14,216 INFO L225 Difference]: With dead ends: 234 [2019-11-15 23:39:14,216 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 23:39:14,217 INFO L600 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-15 23:39:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 23:39:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-11-15 23:39:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 23:39:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 214 transitions. [2019-11-15 23:39:14,228 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 214 transitions. Word has length 36 [2019-11-15 23:39:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:14,228 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 214 transitions. [2019-11-15 23:39:14,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 214 transitions. [2019-11-15 23:39:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:14,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:14,230 INFO L380 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] [2019-11-15 23:39:14,230 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2019-11-15 23:39:14,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:14,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44085166] [2019-11-15 23:39:14,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:14,299 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-15 23:39:14,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44085166] [2019-11-15 23:39:14,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:14,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:14,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839477649] [2019-11-15 23:39:14,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:14,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:14,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:14,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:14,301 INFO L87 Difference]: Start difference. First operand 122 states and 214 transitions. Second operand 3 states. [2019-11-15 23:39:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:14,403 INFO L93 Difference]: Finished difference Result 319 states and 559 transitions. [2019-11-15 23:39:14,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:14,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 23:39:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:14,406 INFO L225 Difference]: With dead ends: 319 [2019-11-15 23:39:14,406 INFO L226 Difference]: Without dead ends: 208 [2019-11-15 23:39:14,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-15 23:39:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 197. [2019-11-15 23:39:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-15 23:39:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 332 transitions. [2019-11-15 23:39:14,432 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 332 transitions. Word has length 36 [2019-11-15 23:39:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:14,432 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 332 transitions. [2019-11-15 23:39:14,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 332 transitions. [2019-11-15 23:39:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:14,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:14,434 INFO L380 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] [2019-11-15 23:39:14,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:14,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1832433288, now seen corresponding path program 1 times [2019-11-15 23:39:14,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:14,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752265178] [2019-11-15 23:39:14,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:14,477 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-15 23:39:14,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752265178] [2019-11-15 23:39:14,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:14,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:14,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979135376] [2019-11-15 23:39:14,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:14,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:14,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:14,479 INFO L87 Difference]: Start difference. First operand 197 states and 332 transitions. Second operand 4 states. [2019-11-15 23:39:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:14,617 INFO L93 Difference]: Finished difference Result 533 states and 902 transitions. [2019-11-15 23:39:14,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:39:14,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:39:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:14,621 INFO L225 Difference]: With dead ends: 533 [2019-11-15 23:39:14,621 INFO L226 Difference]: Without dead ends: 348 [2019-11-15 23:39:14,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:39:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-11-15 23:39:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341. [2019-11-15 23:39:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-15 23:39:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 574 transitions. [2019-11-15 23:39:14,658 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 574 transitions. Word has length 36 [2019-11-15 23:39:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:14,659 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 574 transitions. [2019-11-15 23:39:14,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 574 transitions. [2019-11-15 23:39:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:14,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:14,661 INFO L380 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] [2019-11-15 23:39:14,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:14,662 INFO L82 PathProgramCache]: Analyzing trace with hash -539305974, now seen corresponding path program 1 times [2019-11-15 23:39:14,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:14,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899352533] [2019-11-15 23:39:14,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:14,698 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-15 23:39:14,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899352533] [2019-11-15 23:39:14,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:14,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:14,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115974958] [2019-11-15 23:39:14,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:14,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:14,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:14,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:14,700 INFO L87 Difference]: Start difference. First operand 341 states and 574 transitions. Second operand 4 states. [2019-11-15 23:39:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:14,820 INFO L93 Difference]: Finished difference Result 958 states and 1617 transitions. [2019-11-15 23:39:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:39:14,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:39:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:14,825 INFO L225 Difference]: With dead ends: 958 [2019-11-15 23:39:14,825 INFO L226 Difference]: Without dead ends: 630 [2019-11-15 23:39:14,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:39:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-11-15 23:39:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 623. [2019-11-15 23:39:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-11-15 23:39:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1044 transitions. [2019-11-15 23:39:14,862 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1044 transitions. Word has length 36 [2019-11-15 23:39:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:14,862 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 1044 transitions. [2019-11-15 23:39:14,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1044 transitions. [2019-11-15 23:39:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:14,865 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:14,866 INFO L380 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] [2019-11-15 23:39:14,866 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:14,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash -477266360, now seen corresponding path program 1 times [2019-11-15 23:39:14,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:14,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994259916] [2019-11-15 23:39:14,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:14,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:14,937 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-15 23:39:14,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994259916] [2019-11-15 23:39:14,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:14,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:14,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261404451] [2019-11-15 23:39:14,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:14,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:14,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:14,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:14,939 INFO L87 Difference]: Start difference. First operand 623 states and 1044 transitions. Second operand 4 states. [2019-11-15 23:39:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:15,093 INFO L93 Difference]: Finished difference Result 1894 states and 3154 transitions. [2019-11-15 23:39:15,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:39:15,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:39:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:15,105 INFO L225 Difference]: With dead ends: 1894 [2019-11-15 23:39:15,105 INFO L226 Difference]: Without dead ends: 1285 [2019-11-15 23:39:15,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:39:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2019-11-15 23:39:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1278. [2019-11-15 23:39:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-11-15 23:39:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 2104 transitions. [2019-11-15 23:39:15,175 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 2104 transitions. Word has length 36 [2019-11-15 23:39:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:15,176 INFO L462 AbstractCegarLoop]: Abstraction has 1278 states and 2104 transitions. [2019-11-15 23:39:15,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 2104 transitions. [2019-11-15 23:39:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:15,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:15,181 INFO L380 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] [2019-11-15 23:39:15,181 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash -336717750, now seen corresponding path program 1 times [2019-11-15 23:39:15,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:15,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663224408] [2019-11-15 23:39:15,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:15,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:15,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:15,276 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-15 23:39:15,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663224408] [2019-11-15 23:39:15,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:15,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:15,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122049976] [2019-11-15 23:39:15,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:15,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:15,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:15,278 INFO L87 Difference]: Start difference. First operand 1278 states and 2104 transitions. Second operand 3 states. [2019-11-15 23:39:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:15,397 INFO L93 Difference]: Finished difference Result 2606 states and 4301 transitions. [2019-11-15 23:39:15,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:15,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 23:39:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:15,406 INFO L225 Difference]: With dead ends: 2606 [2019-11-15 23:39:15,406 INFO L226 Difference]: Without dead ends: 1385 [2019-11-15 23:39:15,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-11-15 23:39:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1378. [2019-11-15 23:39:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-11-15 23:39:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2261 transitions. [2019-11-15 23:39:15,492 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2261 transitions. Word has length 36 [2019-11-15 23:39:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:15,492 INFO L462 AbstractCegarLoop]: Abstraction has 1378 states and 2261 transitions. [2019-11-15 23:39:15,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2261 transitions. [2019-11-15 23:39:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:15,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:15,495 INFO L380 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] [2019-11-15 23:39:15,495 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash 952987590, now seen corresponding path program 1 times [2019-11-15 23:39:15,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:15,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738675836] [2019-11-15 23:39:15,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:15,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:15,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:15,546 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-15 23:39:15,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738675836] [2019-11-15 23:39:15,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:15,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:15,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355409146] [2019-11-15 23:39:15,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:15,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:15,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:15,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:15,548 INFO L87 Difference]: Start difference. First operand 1378 states and 2261 transitions. Second operand 4 states. [2019-11-15 23:39:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:15,677 INFO L93 Difference]: Finished difference Result 2888 states and 4749 transitions. [2019-11-15 23:39:15,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:15,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:39:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:15,687 INFO L225 Difference]: With dead ends: 2888 [2019-11-15 23:39:15,688 INFO L226 Difference]: Without dead ends: 1544 [2019-11-15 23:39:15,690 INFO L600 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-15 23:39:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-11-15 23:39:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1533. [2019-11-15 23:39:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2019-11-15 23:39:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2479 transitions. [2019-11-15 23:39:15,764 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2479 transitions. Word has length 36 [2019-11-15 23:39:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:15,765 INFO L462 AbstractCegarLoop]: Abstraction has 1533 states and 2479 transitions. [2019-11-15 23:39:15,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2479 transitions. [2019-11-15 23:39:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:15,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:15,766 INFO L380 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] [2019-11-15 23:39:15,766 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash -635360312, now seen corresponding path program 1 times [2019-11-15 23:39:15,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:15,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747051907] [2019-11-15 23:39:15,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:15,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:15,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:15,807 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-15 23:39:15,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747051907] [2019-11-15 23:39:15,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:15,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:15,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338668946] [2019-11-15 23:39:15,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:15,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:15,809 INFO L87 Difference]: Start difference. First operand 1533 states and 2479 transitions. Second operand 4 states. [2019-11-15 23:39:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:15,953 INFO L93 Difference]: Finished difference Result 3360 states and 5440 transitions. [2019-11-15 23:39:15,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:15,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:39:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:15,965 INFO L225 Difference]: With dead ends: 3360 [2019-11-15 23:39:15,965 INFO L226 Difference]: Without dead ends: 1873 [2019-11-15 23:39:15,967 INFO L600 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-15 23:39:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-11-15 23:39:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1849. [2019-11-15 23:39:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-11-15 23:39:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2951 transitions. [2019-11-15 23:39:16,049 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2951 transitions. Word has length 36 [2019-11-15 23:39:16,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:16,049 INFO L462 AbstractCegarLoop]: Abstraction has 1849 states and 2951 transitions. [2019-11-15 23:39:16,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2951 transitions. [2019-11-15 23:39:16,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:39:16,051 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:16,051 INFO L380 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] [2019-11-15 23:39:16,051 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:16,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:16,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2019-11-15 23:39:16,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:16,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982610737] [2019-11-15 23:39:16,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:16,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:16,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:16,087 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-15 23:39:16,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982610737] [2019-11-15 23:39:16,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:16,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:16,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828111438] [2019-11-15 23:39:16,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:16,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:16,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:16,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:16,088 INFO L87 Difference]: Start difference. First operand 1849 states and 2951 transitions. Second operand 3 states. [2019-11-15 23:39:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:16,184 INFO L93 Difference]: Finished difference Result 3319 states and 5302 transitions. [2019-11-15 23:39:16,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:16,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 23:39:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:16,194 INFO L225 Difference]: With dead ends: 3319 [2019-11-15 23:39:16,194 INFO L226 Difference]: Without dead ends: 1498 [2019-11-15 23:39:16,200 INFO L600 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-15 23:39:16,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2019-11-15 23:39:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1487. [2019-11-15 23:39:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-11-15 23:39:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2343 transitions. [2019-11-15 23:39:16,262 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2343 transitions. Word has length 36 [2019-11-15 23:39:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:16,263 INFO L462 AbstractCegarLoop]: Abstraction has 1487 states and 2343 transitions. [2019-11-15 23:39:16,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2343 transitions. [2019-11-15 23:39:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:39:16,265 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:16,265 INFO L380 BasicCegarLoop]: trace histogram [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-15 23:39:16,265 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:16,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times [2019-11-15 23:39:16,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:16,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619203272] [2019-11-15 23:39:16,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:16,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:16,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:16,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619203272] [2019-11-15 23:39:16,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:16,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:16,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822362171] [2019-11-15 23:39:16,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:16,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:16,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:16,306 INFO L87 Difference]: Start difference. First operand 1487 states and 2343 transitions. Second operand 3 states. [2019-11-15 23:39:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:16,397 INFO L93 Difference]: Finished difference Result 3710 states and 5901 transitions. [2019-11-15 23:39:16,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:16,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-15 23:39:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:16,410 INFO L225 Difference]: With dead ends: 3710 [2019-11-15 23:39:16,410 INFO L226 Difference]: Without dead ends: 2277 [2019-11-15 23:39:16,412 INFO L600 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-15 23:39:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2019-11-15 23:39:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2275. [2019-11-15 23:39:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2019-11-15 23:39:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 3579 transitions. [2019-11-15 23:39:16,541 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 3579 transitions. Word has length 46 [2019-11-15 23:39:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:16,542 INFO L462 AbstractCegarLoop]: Abstraction has 2275 states and 3579 transitions. [2019-11-15 23:39:16,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 3579 transitions. [2019-11-15 23:39:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:39:16,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:16,544 INFO L380 BasicCegarLoop]: trace histogram [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-15 23:39:16,544 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:16,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times [2019-11-15 23:39:16,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:16,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501744656] [2019-11-15 23:39:16,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:16,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:16,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:39:16,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501744656] [2019-11-15 23:39:16,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:16,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:16,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61052646] [2019-11-15 23:39:16,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:16,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:16,565 INFO L87 Difference]: Start difference. First operand 2275 states and 3579 transitions. Second operand 3 states. [2019-11-15 23:39:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:16,648 INFO L93 Difference]: Finished difference Result 4452 states and 7032 transitions. [2019-11-15 23:39:16,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:16,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-15 23:39:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:16,661 INFO L225 Difference]: With dead ends: 4452 [2019-11-15 23:39:16,661 INFO L226 Difference]: Without dead ends: 2231 [2019-11-15 23:39:16,664 INFO L600 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-15 23:39:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-15 23:39:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231. [2019-11-15 23:39:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-11-15 23:39:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 3522 transitions. [2019-11-15 23:39:16,760 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 3522 transitions. Word has length 46 [2019-11-15 23:39:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:16,760 INFO L462 AbstractCegarLoop]: Abstraction has 2231 states and 3522 transitions. [2019-11-15 23:39:16,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 3522 transitions. [2019-11-15 23:39:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:39:16,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:16,762 INFO L380 BasicCegarLoop]: trace histogram [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-15 23:39:16,762 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:16,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times [2019-11-15 23:39:16,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:16,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142398192] [2019-11-15 23:39:16,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:16,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:16,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:16,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142398192] [2019-11-15 23:39:16,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:16,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:16,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853513702] [2019-11-15 23:39:16,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:16,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:16,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:16,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:16,801 INFO L87 Difference]: Start difference. First operand 2231 states and 3522 transitions. Second operand 3 states. [2019-11-15 23:39:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:16,941 INFO L93 Difference]: Finished difference Result 5731 states and 9112 transitions. [2019-11-15 23:39:16,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:16,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-15 23:39:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:16,961 INFO L225 Difference]: With dead ends: 5731 [2019-11-15 23:39:16,961 INFO L226 Difference]: Without dead ends: 3554 [2019-11-15 23:39:16,965 INFO L600 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-15 23:39:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-11-15 23:39:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3552. [2019-11-15 23:39:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3552 states. [2019-11-15 23:39:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 5590 transitions. [2019-11-15 23:39:17,110 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 5590 transitions. Word has length 47 [2019-11-15 23:39:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:17,110 INFO L462 AbstractCegarLoop]: Abstraction has 3552 states and 5590 transitions. [2019-11-15 23:39:17,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 5590 transitions. [2019-11-15 23:39:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:39:17,112 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:17,112 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:17,113 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:17,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times [2019-11-15 23:39:17,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:17,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481266823] [2019-11-15 23:39:17,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:17,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:17,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:17,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481266823] [2019-11-15 23:39:17,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:17,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:17,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432356522] [2019-11-15 23:39:17,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:17,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:17,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:17,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:17,154 INFO L87 Difference]: Start difference. First operand 3552 states and 5590 transitions. Second operand 3 states. [2019-11-15 23:39:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:17,420 INFO L93 Difference]: Finished difference Result 9027 states and 14388 transitions. [2019-11-15 23:39:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:17,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 23:39:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:17,450 INFO L225 Difference]: With dead ends: 9027 [2019-11-15 23:39:17,451 INFO L226 Difference]: Without dead ends: 5533 [2019-11-15 23:39:17,456 INFO L600 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-15 23:39:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2019-11-15 23:39:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 5531. [2019-11-15 23:39:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5531 states. [2019-11-15 23:39:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 8775 transitions. [2019-11-15 23:39:17,690 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 8775 transitions. Word has length 48 [2019-11-15 23:39:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:17,691 INFO L462 AbstractCegarLoop]: Abstraction has 5531 states and 8775 transitions. [2019-11-15 23:39:17,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 8775 transitions. [2019-11-15 23:39:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:39:17,695 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:17,695 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:17,695 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:17,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:17,696 INFO L82 PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times [2019-11-15 23:39:17,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:17,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481690337] [2019-11-15 23:39:17,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:17,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:17,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:39:17,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481690337] [2019-11-15 23:39:17,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:17,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:17,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805662667] [2019-11-15 23:39:17,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:17,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:17,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:17,718 INFO L87 Difference]: Start difference. First operand 5531 states and 8775 transitions. Second operand 3 states. [2019-11-15 23:39:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:17,887 INFO L93 Difference]: Finished difference Result 10960 states and 17424 transitions. [2019-11-15 23:39:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:17,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 23:39:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:17,907 INFO L225 Difference]: With dead ends: 10960 [2019-11-15 23:39:17,913 INFO L226 Difference]: Without dead ends: 5487 [2019-11-15 23:39:17,921 INFO L600 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-15 23:39:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5487 states. [2019-11-15 23:39:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5487 to 5487. [2019-11-15 23:39:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2019-11-15 23:39:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 8720 transitions. [2019-11-15 23:39:18,178 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 8720 transitions. Word has length 48 [2019-11-15 23:39:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:18,179 INFO L462 AbstractCegarLoop]: Abstraction has 5487 states and 8720 transitions. [2019-11-15 23:39:18,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 8720 transitions. [2019-11-15 23:39:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:39:18,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:18,182 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:18,182 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times [2019-11-15 23:39:18,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:18,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424138588] [2019-11-15 23:39:18,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:18,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:18,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:18,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424138588] [2019-11-15 23:39:18,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:18,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:18,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108683003] [2019-11-15 23:39:18,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:18,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:18,214 INFO L87 Difference]: Start difference. First operand 5487 states and 8720 transitions. Second operand 3 states. [2019-11-15 23:39:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:18,532 INFO L93 Difference]: Finished difference Result 15505 states and 24580 transitions. [2019-11-15 23:39:18,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:18,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 23:39:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:18,555 INFO L225 Difference]: With dead ends: 15505 [2019-11-15 23:39:18,555 INFO L226 Difference]: Without dead ends: 8306 [2019-11-15 23:39:18,565 INFO L600 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-15 23:39:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8306 states. [2019-11-15 23:39:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8306 to 8306. [2019-11-15 23:39:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8306 states. [2019-11-15 23:39:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8306 states to 8306 states and 13014 transitions. [2019-11-15 23:39:19,038 INFO L78 Accepts]: Start accepts. Automaton has 8306 states and 13014 transitions. Word has length 49 [2019-11-15 23:39:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:19,038 INFO L462 AbstractCegarLoop]: Abstraction has 8306 states and 13014 transitions. [2019-11-15 23:39:19,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 8306 states and 13014 transitions. [2019-11-15 23:39:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:39:19,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:19,044 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:19,044 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:19,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:19,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1878430016, now seen corresponding path program 1 times [2019-11-15 23:39:19,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:19,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751674959] [2019-11-15 23:39:19,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:19,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:19,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:19,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751674959] [2019-11-15 23:39:19,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:19,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:19,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387026369] [2019-11-15 23:39:19,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:19,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:19,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:19,089 INFO L87 Difference]: Start difference. First operand 8306 states and 13014 transitions. Second operand 3 states. [2019-11-15 23:39:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:19,369 INFO L93 Difference]: Finished difference Result 17117 states and 26766 transitions. [2019-11-15 23:39:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:19,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-15 23:39:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:19,388 INFO L225 Difference]: With dead ends: 17117 [2019-11-15 23:39:19,388 INFO L226 Difference]: Without dead ends: 8847 [2019-11-15 23:39:19,400 INFO L600 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-15 23:39:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8847 states. [2019-11-15 23:39:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8847 to 8296. [2019-11-15 23:39:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8296 states. [2019-11-15 23:39:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 12747 transitions. [2019-11-15 23:39:19,707 INFO L78 Accepts]: Start accepts. Automaton has 8296 states and 12747 transitions. Word has length 53 [2019-11-15 23:39:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:19,708 INFO L462 AbstractCegarLoop]: Abstraction has 8296 states and 12747 transitions. [2019-11-15 23:39:19,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8296 states and 12747 transitions. [2019-11-15 23:39:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:39:19,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:19,716 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:19,716 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash -753024327, now seen corresponding path program 1 times [2019-11-15 23:39:19,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:19,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115266338] [2019-11-15 23:39:19,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:19,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:19,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:39:19,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115266338] [2019-11-15 23:39:19,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:19,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:19,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945673331] [2019-11-15 23:39:19,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:19,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:19,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:19,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:19,753 INFO L87 Difference]: Start difference. First operand 8296 states and 12747 transitions. Second operand 3 states. [2019-11-15 23:39:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:20,295 INFO L93 Difference]: Finished difference Result 24576 states and 37848 transitions. [2019-11-15 23:39:20,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:20,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-15 23:39:20,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:20,325 INFO L225 Difference]: With dead ends: 24576 [2019-11-15 23:39:20,325 INFO L226 Difference]: Without dead ends: 16283 [2019-11-15 23:39:20,338 INFO L600 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-15 23:39:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16283 states. [2019-11-15 23:39:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16283 to 16153. [2019-11-15 23:39:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16153 states. [2019-11-15 23:39:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16153 states to 16153 states and 24943 transitions. [2019-11-15 23:39:20,989 INFO L78 Accepts]: Start accepts. Automaton has 16153 states and 24943 transitions. Word has length 55 [2019-11-15 23:39:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:20,990 INFO L462 AbstractCegarLoop]: Abstraction has 16153 states and 24943 transitions. [2019-11-15 23:39:20,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 16153 states and 24943 transitions. [2019-11-15 23:39:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 23:39:21,004 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:21,004 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:21,005 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash 983251502, now seen corresponding path program 1 times [2019-11-15 23:39:21,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:21,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342640566] [2019-11-15 23:39:21,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:21,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:21,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:21,058 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-15 23:39:21,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342640566] [2019-11-15 23:39:21,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:21,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:21,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069044768] [2019-11-15 23:39:21,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:21,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:21,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:21,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:21,061 INFO L87 Difference]: Start difference. First operand 16153 states and 24943 transitions. Second operand 3 states. [2019-11-15 23:39:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:21,775 INFO L93 Difference]: Finished difference Result 32961 states and 50844 transitions. [2019-11-15 23:39:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:21,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-15 23:39:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:21,806 INFO L225 Difference]: With dead ends: 32961 [2019-11-15 23:39:21,807 INFO L226 Difference]: Without dead ends: 16837 [2019-11-15 23:39:21,829 INFO L600 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-15 23:39:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16837 states. [2019-11-15 23:39:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16837 to 16773. [2019-11-15 23:39:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16773 states. [2019-11-15 23:39:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16773 states to 16773 states and 25245 transitions. [2019-11-15 23:39:22,441 INFO L78 Accepts]: Start accepts. Automaton has 16773 states and 25245 transitions. Word has length 86 [2019-11-15 23:39:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:22,442 INFO L462 AbstractCegarLoop]: Abstraction has 16773 states and 25245 transitions. [2019-11-15 23:39:22,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 16773 states and 25245 transitions. [2019-11-15 23:39:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:39:22,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:22,453 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:22,453 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1499414459, now seen corresponding path program 1 times [2019-11-15 23:39:22,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:22,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887155673] [2019-11-15 23:39:22,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:22,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:22,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:39:22,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887155673] [2019-11-15 23:39:22,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:22,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:22,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818064729] [2019-11-15 23:39:22,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:22,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:22,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:22,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:22,506 INFO L87 Difference]: Start difference. First operand 16773 states and 25245 transitions. Second operand 4 states. [2019-11-15 23:39:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:23,248 INFO L93 Difference]: Finished difference Result 27695 states and 41815 transitions. [2019-11-15 23:39:23,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:23,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:39:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:23,279 INFO L225 Difference]: With dead ends: 27695 [2019-11-15 23:39:23,279 INFO L226 Difference]: Without dead ends: 15867 [2019-11-15 23:39:23,291 INFO L600 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-15 23:39:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15867 states. [2019-11-15 23:39:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15867 to 15761. [2019-11-15 23:39:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15761 states. [2019-11-15 23:39:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15761 states to 15761 states and 23539 transitions. [2019-11-15 23:39:23,890 INFO L78 Accepts]: Start accepts. Automaton has 15761 states and 23539 transitions. Word has length 87 [2019-11-15 23:39:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:23,890 INFO L462 AbstractCegarLoop]: Abstraction has 15761 states and 23539 transitions. [2019-11-15 23:39:23,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 15761 states and 23539 transitions. [2019-11-15 23:39:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:39:23,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:23,899 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:23,899 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:23,899 INFO L82 PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times [2019-11-15 23:39:23,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:23,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270360221] [2019-11-15 23:39:23,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:23,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:23,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:23,936 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-15 23:39:23,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270360221] [2019-11-15 23:39:23,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:23,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:23,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645245755] [2019-11-15 23:39:23,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:23,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:23,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:23,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:23,940 INFO L87 Difference]: Start difference. First operand 15761 states and 23539 transitions. Second operand 3 states. [2019-11-15 23:39:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:24,875 INFO L93 Difference]: Finished difference Result 32291 states and 48176 transitions. [2019-11-15 23:39:24,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:24,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-15 23:39:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:24,906 INFO L225 Difference]: With dead ends: 32291 [2019-11-15 23:39:24,906 INFO L226 Difference]: Without dead ends: 16571 [2019-11-15 23:39:24,916 INFO L600 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-15 23:39:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16571 states. [2019-11-15 23:39:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16571 to 16491. [2019-11-15 23:39:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16491 states. [2019-11-15 23:39:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16491 states to 16491 states and 23911 transitions. [2019-11-15 23:39:25,466 INFO L78 Accepts]: Start accepts. Automaton has 16491 states and 23911 transitions. Word has length 87 [2019-11-15 23:39:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:25,467 INFO L462 AbstractCegarLoop]: Abstraction has 16491 states and 23911 transitions. [2019-11-15 23:39:25,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 16491 states and 23911 transitions. [2019-11-15 23:39:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:39:25,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:25,476 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:25,477 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times [2019-11-15 23:39:25,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:25,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740166058] [2019-11-15 23:39:25,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:25,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:25,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:25,515 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-15 23:39:25,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740166058] [2019-11-15 23:39:25,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:25,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:25,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928868145] [2019-11-15 23:39:25,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:25,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:25,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:25,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:25,518 INFO L87 Difference]: Start difference. First operand 16491 states and 23911 transitions. Second operand 3 states. [2019-11-15 23:39:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:26,091 INFO L93 Difference]: Finished difference Result 33398 states and 48544 transitions. [2019-11-15 23:39:26,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:26,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-15 23:39:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:26,119 INFO L225 Difference]: With dead ends: 33398 [2019-11-15 23:39:26,119 INFO L226 Difference]: Without dead ends: 16968 [2019-11-15 23:39:26,129 INFO L600 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-15 23:39:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16968 states. [2019-11-15 23:39:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16968 to 13475. [2019-11-15 23:39:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13475 states. [2019-11-15 23:39:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 18849 transitions. [2019-11-15 23:39:26,545 INFO L78 Accepts]: Start accepts. Automaton has 13475 states and 18849 transitions. Word has length 88 [2019-11-15 23:39:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:26,545 INFO L462 AbstractCegarLoop]: Abstraction has 13475 states and 18849 transitions. [2019-11-15 23:39:26,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 13475 states and 18849 transitions. [2019-11-15 23:39:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 23:39:26,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:26,553 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:26,554 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times [2019-11-15 23:39:26,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:26,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387582688] [2019-11-15 23:39:26,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:26,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:26,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:39:26,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387582688] [2019-11-15 23:39:26,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:26,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:26,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567976000] [2019-11-15 23:39:26,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:26,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:26,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:26,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:26,597 INFO L87 Difference]: Start difference. First operand 13475 states and 18849 transitions. Second operand 3 states. [2019-11-15 23:39:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:27,100 INFO L93 Difference]: Finished difference Result 23981 states and 33577 transitions. [2019-11-15 23:39:27,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:27,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-15 23:39:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:27,122 INFO L225 Difference]: With dead ends: 23981 [2019-11-15 23:39:27,122 INFO L226 Difference]: Without dead ends: 15629 [2019-11-15 23:39:27,130 INFO L600 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-15 23:39:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15629 states. [2019-11-15 23:39:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15629 to 15149. [2019-11-15 23:39:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15149 states. [2019-11-15 23:39:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15149 states to 15149 states and 20704 transitions. [2019-11-15 23:39:27,683 INFO L78 Accepts]: Start accepts. Automaton has 15149 states and 20704 transitions. Word has length 89 [2019-11-15 23:39:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:27,684 INFO L462 AbstractCegarLoop]: Abstraction has 15149 states and 20704 transitions. [2019-11-15 23:39:27,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 15149 states and 20704 transitions. [2019-11-15 23:39:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 23:39:27,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:27,702 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:27,703 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times [2019-11-15 23:39:27,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:27,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125060465] [2019-11-15 23:39:27,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:27,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:27,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:27,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125060465] [2019-11-15 23:39:27,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:27,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:27,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566375665] [2019-11-15 23:39:27,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:27,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:27,760 INFO L87 Difference]: Start difference. First operand 15149 states and 20704 transitions. Second operand 3 states. [2019-11-15 23:39:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:28,354 INFO L93 Difference]: Finished difference Result 29536 states and 40326 transitions. [2019-11-15 23:39:28,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:28,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-15 23:39:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:28,367 INFO L225 Difference]: With dead ends: 29536 [2019-11-15 23:39:28,367 INFO L226 Difference]: Without dead ends: 15079 [2019-11-15 23:39:28,375 INFO L600 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-15 23:39:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15079 states. [2019-11-15 23:39:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15079 to 15079. [2019-11-15 23:39:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15079 states. [2019-11-15 23:39:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15079 states to 15079 states and 20550 transitions. [2019-11-15 23:39:28,807 INFO L78 Accepts]: Start accepts. Automaton has 15079 states and 20550 transitions. Word has length 116 [2019-11-15 23:39:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:28,807 INFO L462 AbstractCegarLoop]: Abstraction has 15079 states and 20550 transitions. [2019-11-15 23:39:28,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 15079 states and 20550 transitions. [2019-11-15 23:39:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 23:39:28,822 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:28,822 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:28,823 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:28,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash 521223166, now seen corresponding path program 1 times [2019-11-15 23:39:28,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:28,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788797458] [2019-11-15 23:39:28,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:28,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:28,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 23:39:28,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788797458] [2019-11-15 23:39:28,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:28,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:28,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988767162] [2019-11-15 23:39:28,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:28,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:28,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:28,860 INFO L87 Difference]: Start difference. First operand 15079 states and 20550 transitions. Second operand 3 states. [2019-11-15 23:39:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:29,209 INFO L93 Difference]: Finished difference Result 25622 states and 34854 transitions. [2019-11-15 23:39:29,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:29,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-15 23:39:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:29,219 INFO L225 Difference]: With dead ends: 25622 [2019-11-15 23:39:29,219 INFO L226 Difference]: Without dead ends: 10600 [2019-11-15 23:39:29,228 INFO L600 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-15 23:39:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2019-11-15 23:39:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 8632. [2019-11-15 23:39:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8632 states. [2019-11-15 23:39:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8632 states to 8632 states and 11298 transitions. [2019-11-15 23:39:29,523 INFO L78 Accepts]: Start accepts. Automaton has 8632 states and 11298 transitions. Word has length 127 [2019-11-15 23:39:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:29,523 INFO L462 AbstractCegarLoop]: Abstraction has 8632 states and 11298 transitions. [2019-11-15 23:39:29,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 8632 states and 11298 transitions. [2019-11-15 23:39:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-15 23:39:29,532 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:29,532 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:29,532 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times [2019-11-15 23:39:29,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:29,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511057296] [2019-11-15 23:39:29,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:29,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:29,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:29,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511057296] [2019-11-15 23:39:29,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:29,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:29,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078371923] [2019-11-15 23:39:29,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:29,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:29,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:29,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:29,574 INFO L87 Difference]: Start difference. First operand 8632 states and 11298 transitions. Second operand 3 states. [2019-11-15 23:39:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:29,953 INFO L93 Difference]: Finished difference Result 14223 states and 18615 transitions. [2019-11-15 23:39:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:29,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-11-15 23:39:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:29,961 INFO L225 Difference]: With dead ends: 14223 [2019-11-15 23:39:29,961 INFO L226 Difference]: Without dead ends: 6745 [2019-11-15 23:39:29,965 INFO L600 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-15 23:39:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6745 states. [2019-11-15 23:39:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6745 to 6161. [2019-11-15 23:39:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6161 states. [2019-11-15 23:39:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 7897 transitions. [2019-11-15 23:39:30,236 INFO L78 Accepts]: Start accepts. Automaton has 6161 states and 7897 transitions. Word has length 128 [2019-11-15 23:39:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:30,237 INFO L462 AbstractCegarLoop]: Abstraction has 6161 states and 7897 transitions. [2019-11-15 23:39:30,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 6161 states and 7897 transitions. [2019-11-15 23:39:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 23:39:30,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:30,244 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:30,244 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times [2019-11-15 23:39:30,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:30,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519101837] [2019-11-15 23:39:30,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:30,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:30,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 23:39:30,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519101837] [2019-11-15 23:39:30,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:30,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:30,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495855518] [2019-11-15 23:39:30,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:30,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:30,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:30,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:30,287 INFO L87 Difference]: Start difference. First operand 6161 states and 7897 transitions. Second operand 3 states. [2019-11-15 23:39:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:30,486 INFO L93 Difference]: Finished difference Result 11935 states and 15282 transitions. [2019-11-15 23:39:30,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:30,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-15 23:39:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:30,491 INFO L225 Difference]: With dead ends: 11935 [2019-11-15 23:39:30,491 INFO L226 Difference]: Without dead ends: 6160 [2019-11-15 23:39:30,495 INFO L600 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-15 23:39:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6160 states. [2019-11-15 23:39:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6160 to 6120. [2019-11-15 23:39:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-11-15 23:39:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 7814 transitions. [2019-11-15 23:39:30,674 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 7814 transitions. Word has length 134 [2019-11-15 23:39:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:30,674 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 7814 transitions. [2019-11-15 23:39:30,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 7814 transitions. [2019-11-15 23:39:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 23:39:30,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:30,677 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:30,678 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:30,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:30,678 INFO L82 PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times [2019-11-15 23:39:30,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:30,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754618359] [2019-11-15 23:39:30,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:30,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:30,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 23:39:30,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754618359] [2019-11-15 23:39:30,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:30,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:30,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600461211] [2019-11-15 23:39:30,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:30,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:30,725 INFO L87 Difference]: Start difference. First operand 6120 states and 7814 transitions. Second operand 3 states. [2019-11-15 23:39:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:30,991 INFO L93 Difference]: Finished difference Result 11874 states and 15143 transitions. [2019-11-15 23:39:30,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:30,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-15 23:39:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:30,996 INFO L225 Difference]: With dead ends: 11874 [2019-11-15 23:39:30,996 INFO L226 Difference]: Without dead ends: 6130 [2019-11-15 23:39:30,999 INFO L600 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-15 23:39:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6130 states. [2019-11-15 23:39:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6130 to 6090. [2019-11-15 23:39:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6090 states. [2019-11-15 23:39:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 7743 transitions. [2019-11-15 23:39:31,180 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 7743 transitions. Word has length 134 [2019-11-15 23:39:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:31,180 INFO L462 AbstractCegarLoop]: Abstraction has 6090 states and 7743 transitions. [2019-11-15 23:39:31,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 7743 transitions. [2019-11-15 23:39:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 23:39:31,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:31,183 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:31,184 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:31,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times [2019-11-15 23:39:31,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:31,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313723829] [2019-11-15 23:39:31,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:31,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:31,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 23:39:31,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313723829] [2019-11-15 23:39:31,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:31,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:31,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729180074] [2019-11-15 23:39:31,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:31,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:31,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:31,222 INFO L87 Difference]: Start difference. First operand 6090 states and 7743 transitions. Second operand 3 states. [2019-11-15 23:39:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:31,457 INFO L93 Difference]: Finished difference Result 10918 states and 13929 transitions. [2019-11-15 23:39:31,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:31,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-15 23:39:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:31,463 INFO L225 Difference]: With dead ends: 10918 [2019-11-15 23:39:31,463 INFO L226 Difference]: Without dead ends: 5200 [2019-11-15 23:39:31,467 INFO L600 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-15 23:39:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2019-11-15 23:39:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5198. [2019-11-15 23:39:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5198 states. [2019-11-15 23:39:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 6467 transitions. [2019-11-15 23:39:31,692 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 6467 transitions. Word has length 137 [2019-11-15 23:39:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:31,693 INFO L462 AbstractCegarLoop]: Abstraction has 5198 states and 6467 transitions. [2019-11-15 23:39:31,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 6467 transitions. [2019-11-15 23:39:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 23:39:31,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:31,696 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:31,696 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:31,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:31,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times [2019-11-15 23:39:31,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:31,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537221928] [2019-11-15 23:39:31,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:31,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:31,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 23:39:31,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537221928] [2019-11-15 23:39:31,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:31,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:31,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218364417] [2019-11-15 23:39:31,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:31,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:31,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:31,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:31,749 INFO L87 Difference]: Start difference. First operand 5198 states and 6467 transitions. Second operand 3 states. [2019-11-15 23:39:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:31,954 INFO L93 Difference]: Finished difference Result 9274 states and 11585 transitions. [2019-11-15 23:39:31,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:31,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-15 23:39:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:31,959 INFO L225 Difference]: With dead ends: 9274 [2019-11-15 23:39:31,959 INFO L226 Difference]: Without dead ends: 4110 [2019-11-15 23:39:31,963 INFO L600 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-15 23:39:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2019-11-15 23:39:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 4092. [2019-11-15 23:39:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4092 states. [2019-11-15 23:39:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 5032 transitions. [2019-11-15 23:39:32,157 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 5032 transitions. Word has length 137 [2019-11-15 23:39:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:32,157 INFO L462 AbstractCegarLoop]: Abstraction has 4092 states and 5032 transitions. [2019-11-15 23:39:32,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 5032 transitions. [2019-11-15 23:39:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-15 23:39:32,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:32,162 INFO L380 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:32,163 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:32,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:32,163 INFO L82 PathProgramCache]: Analyzing trace with hash 48056104, now seen corresponding path program 1 times [2019-11-15 23:39:32,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:32,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934023949] [2019-11-15 23:39:32,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:32,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:32,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:32,225 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 23:39:32,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934023949] [2019-11-15 23:39:32,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:32,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:32,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159034038] [2019-11-15 23:39:32,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:32,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:32,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:32,228 INFO L87 Difference]: Start difference. First operand 4092 states and 5032 transitions. Second operand 3 states. [2019-11-15 23:39:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:32,477 INFO L93 Difference]: Finished difference Result 7599 states and 9405 transitions. [2019-11-15 23:39:32,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:32,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-15 23:39:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:32,482 INFO L225 Difference]: With dead ends: 7599 [2019-11-15 23:39:32,482 INFO L226 Difference]: Without dead ends: 3783 [2019-11-15 23:39:32,485 INFO L600 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-15 23:39:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2019-11-15 23:39:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3563. [2019-11-15 23:39:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3563 states. [2019-11-15 23:39:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4341 transitions. [2019-11-15 23:39:32,707 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4341 transitions. Word has length 170 [2019-11-15 23:39:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:32,707 INFO L462 AbstractCegarLoop]: Abstraction has 3563 states and 4341 transitions. [2019-11-15 23:39:32,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4341 transitions. [2019-11-15 23:39:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 23:39:32,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:32,712 INFO L380 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:32,712 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:32,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1975319017, now seen corresponding path program 1 times [2019-11-15 23:39:32,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:32,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469333357] [2019-11-15 23:39:32,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:32,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:32,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 23:39:32,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469333357] [2019-11-15 23:39:32,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:32,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:32,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717502721] [2019-11-15 23:39:32,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:32,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:32,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:32,794 INFO L87 Difference]: Start difference. First operand 3563 states and 4341 transitions. Second operand 3 states. [2019-11-15 23:39:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:33,140 INFO L93 Difference]: Finished difference Result 8926 states and 10917 transitions. [2019-11-15 23:39:33,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:33,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-15 23:39:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:33,145 INFO L225 Difference]: With dead ends: 8926 [2019-11-15 23:39:33,145 INFO L226 Difference]: Without dead ends: 5639 [2019-11-15 23:39:33,146 INFO L600 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-15 23:39:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2019-11-15 23:39:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5417. [2019-11-15 23:39:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5417 states. [2019-11-15 23:39:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 6519 transitions. [2019-11-15 23:39:33,304 INFO L78 Accepts]: Start accepts. Automaton has 5417 states and 6519 transitions. Word has length 177 [2019-11-15 23:39:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:33,304 INFO L462 AbstractCegarLoop]: Abstraction has 5417 states and 6519 transitions. [2019-11-15 23:39:33,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5417 states and 6519 transitions. [2019-11-15 23:39:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 23:39:33,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:33,307 INFO L380 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:33,307 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:33,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1080445198, now seen corresponding path program 1 times [2019-11-15 23:39:33,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:33,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738252624] [2019-11-15 23:39:33,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:33,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:33,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 23:39:33,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738252624] [2019-11-15 23:39:33,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:33,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:33,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551217924] [2019-11-15 23:39:33,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:33,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:33,371 INFO L87 Difference]: Start difference. First operand 5417 states and 6519 transitions. Second operand 4 states. [2019-11-15 23:39:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:33,560 INFO L93 Difference]: Finished difference Result 8455 states and 10154 transitions. [2019-11-15 23:39:33,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:39:33,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-15 23:39:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:33,563 INFO L225 Difference]: With dead ends: 8455 [2019-11-15 23:39:33,563 INFO L226 Difference]: Without dead ends: 3314 [2019-11-15 23:39:33,565 INFO L600 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-15 23:39:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2019-11-15 23:39:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2364. [2019-11-15 23:39:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-11-15 23:39:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2795 transitions. [2019-11-15 23:39:33,649 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 2795 transitions. Word has length 180 [2019-11-15 23:39:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:33,649 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 2795 transitions. [2019-11-15 23:39:33,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2795 transitions. [2019-11-15 23:39:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 23:39:33,651 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:33,651 INFO L380 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:33,652 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash 844703381, now seen corresponding path program 1 times [2019-11-15 23:39:33,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:33,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952170832] [2019-11-15 23:39:33,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:33,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:33,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:39:33,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952170832] [2019-11-15 23:39:33,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:33,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:33,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341845590] [2019-11-15 23:39:33,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:33,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:33,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:33,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:33,715 INFO L87 Difference]: Start difference. First operand 2364 states and 2795 transitions. Second operand 3 states. [2019-11-15 23:39:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:33,869 INFO L93 Difference]: Finished difference Result 6276 states and 7453 transitions. [2019-11-15 23:39:33,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:33,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-15 23:39:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:33,873 INFO L225 Difference]: With dead ends: 6276 [2019-11-15 23:39:33,873 INFO L226 Difference]: Without dead ends: 3726 [2019-11-15 23:39:33,874 INFO L600 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-15 23:39:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2019-11-15 23:39:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3711. [2019-11-15 23:39:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2019-11-15 23:39:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 4391 transitions. [2019-11-15 23:39:34,005 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 4391 transitions. Word has length 184 [2019-11-15 23:39:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:34,005 INFO L462 AbstractCegarLoop]: Abstraction has 3711 states and 4391 transitions. [2019-11-15 23:39:34,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 4391 transitions. [2019-11-15 23:39:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 23:39:34,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:34,007 INFO L380 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:34,007 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash 539882129, now seen corresponding path program 1 times [2019-11-15 23:39:34,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:34,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011580964] [2019-11-15 23:39:34,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:34,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:34,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 23:39:34,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011580964] [2019-11-15 23:39:34,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:34,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:34,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723892724] [2019-11-15 23:39:34,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:34,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:34,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:34,065 INFO L87 Difference]: Start difference. First operand 3711 states and 4391 transitions. Second operand 3 states. [2019-11-15 23:39:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:34,193 INFO L93 Difference]: Finished difference Result 5004 states and 5865 transitions. [2019-11-15 23:39:34,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:34,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-15 23:39:34,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:34,195 INFO L225 Difference]: With dead ends: 5004 [2019-11-15 23:39:34,196 INFO L226 Difference]: Without dead ends: 1520 [2019-11-15 23:39:34,198 INFO L600 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-15 23:39:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-11-15 23:39:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2019-11-15 23:39:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2019-11-15 23:39:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1701 transitions. [2019-11-15 23:39:34,279 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1701 transitions. Word has length 184 [2019-11-15 23:39:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:34,280 INFO L462 AbstractCegarLoop]: Abstraction has 1520 states and 1701 transitions. [2019-11-15 23:39:34,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1701 transitions. [2019-11-15 23:39:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 23:39:34,282 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:34,282 INFO L380 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:34,282 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:34,283 INFO L82 PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times [2019-11-15 23:39:34,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:34,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121646075] [2019-11-15 23:39:34,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:34,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:34,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:34,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121646075] [2019-11-15 23:39:34,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043880206] [2019-11-15 23:39:34,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:39:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:34,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:39:34,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:39:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:34,819 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:39:34,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-15 23:39:34,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816101122] [2019-11-15 23:39:34,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:39:34,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:34,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:39:34,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:39:34,821 INFO L87 Difference]: Start difference. First operand 1520 states and 1701 transitions. Second operand 10 states. [2019-11-15 23:39:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:35,536 INFO L93 Difference]: Finished difference Result 3342 states and 3749 transitions. [2019-11-15 23:39:35,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:39:35,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2019-11-15 23:39:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:35,545 INFO L225 Difference]: With dead ends: 3342 [2019-11-15 23:39:35,545 INFO L226 Difference]: Without dead ends: 2500 [2019-11-15 23:39:35,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:39:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2019-11-15 23:39:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 1882. [2019-11-15 23:39:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2019-11-15 23:39:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2107 transitions. [2019-11-15 23:39:35,703 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2107 transitions. Word has length 185 [2019-11-15 23:39:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:35,704 INFO L462 AbstractCegarLoop]: Abstraction has 1882 states and 2107 transitions. [2019-11-15 23:39:35,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:39:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2107 transitions. [2019-11-15 23:39:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 23:39:35,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:35,707 INFO L380 BasicCegarLoop]: trace histogram [7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:39:35,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:39:35,911 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times [2019-11-15 23:39:35,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:35,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18305293] [2019-11-15 23:39:35,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:35,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:35,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:39:36,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18305293] [2019-11-15 23:39:36,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976963620] [2019-11-15 23:39:36,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:39:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:36,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:39:36,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:39:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:39:36,399 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:39:36,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-15 23:39:36,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115639453] [2019-11-15 23:39:36,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:39:36,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:36,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:39:36,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:39:36,403 INFO L87 Difference]: Start difference. First operand 1882 states and 2107 transitions. Second operand 9 states. [2019-11-15 23:39:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:37,057 INFO L93 Difference]: Finished difference Result 4238 states and 4750 transitions. [2019-11-15 23:39:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:39:37,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-11-15 23:39:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:37,064 INFO L225 Difference]: With dead ends: 4238 [2019-11-15 23:39:37,064 INFO L226 Difference]: Without dead ends: 3054 [2019-11-15 23:39:37,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:39:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2019-11-15 23:39:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2246. [2019-11-15 23:39:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-11-15 23:39:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2519 transitions. [2019-11-15 23:39:37,202 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2519 transitions. Word has length 191 [2019-11-15 23:39:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:37,203 INFO L462 AbstractCegarLoop]: Abstraction has 2246 states and 2519 transitions. [2019-11-15 23:39:37,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:39:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2519 transitions. [2019-11-15 23:39:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-15 23:39:37,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:37,206 INFO L380 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:37,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:39:37,410 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:37,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1360853638, now seen corresponding path program 1 times [2019-11-15 23:39:37,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:37,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581659241] [2019-11-15 23:39:37,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:37,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:37,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-15 23:39:37,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581659241] [2019-11-15 23:39:37,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:37,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:37,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539104355] [2019-11-15 23:39:37,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:37,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:37,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:37,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:37,542 INFO L87 Difference]: Start difference. First operand 2246 states and 2519 transitions. Second operand 3 states. [2019-11-15 23:39:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:37,658 INFO L93 Difference]: Finished difference Result 3370 states and 3780 transitions. [2019-11-15 23:39:37,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:37,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2019-11-15 23:39:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:37,661 INFO L225 Difference]: With dead ends: 3370 [2019-11-15 23:39:37,661 INFO L226 Difference]: Without dead ends: 1652 [2019-11-15 23:39:37,663 INFO L600 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-15 23:39:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-11-15 23:39:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1582. [2019-11-15 23:39:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2019-11-15 23:39:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1755 transitions. [2019-11-15 23:39:37,797 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1755 transitions. Word has length 275 [2019-11-15 23:39:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:37,800 INFO L462 AbstractCegarLoop]: Abstraction has 1582 states and 1755 transitions. [2019-11-15 23:39:37,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1755 transitions. [2019-11-15 23:39:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-15 23:39:37,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:37,804 INFO L380 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:37,804 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1393925257, now seen corresponding path program 1 times [2019-11-15 23:39:37,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:37,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696569128] [2019-11-15 23:39:37,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:37,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:37,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-15 23:39:37,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696569128] [2019-11-15 23:39:37,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:37,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:37,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749174100] [2019-11-15 23:39:37,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:37,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:37,952 INFO L87 Difference]: Start difference. First operand 1582 states and 1755 transitions. Second operand 3 states. [2019-11-15 23:39:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:38,048 INFO L93 Difference]: Finished difference Result 2334 states and 2579 transitions. [2019-11-15 23:39:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:38,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-15 23:39:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:38,049 INFO L225 Difference]: With dead ends: 2334 [2019-11-15 23:39:38,049 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:39:38,052 INFO L600 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-15 23:39:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:39:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:39:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:39:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:39:38,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2019-11-15 23:39:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:38,053 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:39:38,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:39:38,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:39:38,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:39:39,250 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 451 DAG size of output: 227 [2019-11-15 23:39:39,541 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 149 [2019-11-15 23:39:39,656 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 104 [2019-11-15 23:39:40,353 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 394 DAG size of output: 187 [2019-11-15 23:39:40,642 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 108 [2019-11-15 23:39:41,474 WARN L191 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 223 [2019-11-15 23:39:41,577 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 107 [2019-11-15 23:39:41,913 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 181 [2019-11-15 23:39:42,626 WARN L191 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 467 DAG size of output: 233 [2019-11-15 23:39:42,850 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 189 [2019-11-15 23:39:43,408 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 223 [2019-11-15 23:39:43,788 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 215 [2019-11-15 23:39:49,190 WARN L191 SmtUtils]: Spent 5.40 s on a formula simplification. DAG size of input: 195 DAG size of output: 151 [2019-11-15 23:39:49,960 WARN L191 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-15 23:39:51,303 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 142 DAG size of output: 100 [2019-11-15 23:39:52,297 WARN L191 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-11-15 23:39:56,448 WARN L191 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 158 DAG size of output: 140 [2019-11-15 23:39:56,924 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-11-15 23:39:57,546 WARN L191 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-11-15 23:39:59,010 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2019-11-15 23:40:03,703 WARN L191 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 191 DAG size of output: 150 [2019-11-15 23:40:04,528 WARN L191 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-11-15 23:40:07,218 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 150 DAG size of output: 107 [2019-11-15 23:40:07,811 WARN L191 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-11-15 23:40:12,942 WARN L191 SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 199 DAG size of output: 151 [2019-11-15 23:40:13,127 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-11-15 23:40:16,156 WARN L191 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 162 DAG size of output: 123 [2019-11-15 23:40:16,781 WARN L191 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-11-15 23:40:21,484 WARN L191 SmtUtils]: Spent 4.70 s on a formula simplification. DAG size of input: 191 DAG size of output: 150 [2019-11-15 23:40:22,946 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 214 DAG size of output: 90 [2019-11-15 23:40:22,948 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 671) no Hoare annotation was computed. [2019-11-15 23:40:22,948 INFO L443 ceAbstractionStarter]: For program point L597(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,948 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,948 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 404) no Hoare annotation was computed. [2019-11-15 23:40:22,949 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 404) no Hoare annotation was computed. [2019-11-15 23:40:22,949 INFO L439 ceAbstractionStarter]: At program point L135(lines 130 170) the Hoare annotation is: (let ((.cse25 (+ ~t_b~0 1))) (let ((.cse2 (= ~c2_st~0 0)) (.cse1 (not (= ~e_f~0 1))) (.cse7 (not (= ~e_f~0 0))) (.cse8 (= 1 ~wl_pc~0)) (.cse15 (<= 2 ~e_wl~0)) (.cse13 (<= 2 ~wb_st~0)) (.cse0 (= ~c2_pc~0 1)) (.cse22 (= 2 ~wl_pc~0)) (.cse26 (<= .cse25 ~data~0)) (.cse3 (= ~wb_i~0 1)) (.cse4 (= ~processed~0 0)) (.cse5 (<= 2 ~wl_st~0)) (.cse6 (not (= ~e_c~0 0))) (.cse9 (not (= ~e_e~0 0))) (.cse10 (= ~c2_i~0 1)) (.cse21 (<= 2 ~c2_st~0)) (.cse11 (not (= ~e_g~0 0))) (.cse27 (<= ~data~0 .cse25)) (.cse12 (= ~c1_i~0 1)) (.cse14 (<= 2 ~r_st~0)) (.cse24 (= 0 ~wb_st~0)) (.cse16 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_e~0 1))) (.cse23 (= ~e_f~0 ~wl_st~0)) (.cse18 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0)) (.cse20 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse3 .cse5 (= ~e_wl~0 ~e_f~0) .cse6 .cse9 .cse10 .cse11 .cse12 (= 0 ~wl_pc~0) .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse22 .cse3 .cse4 .cse5 (<= ~t_b~0 ~data~0) .cse6 .cse9 .cse10 (<= ~data~0 ~t_b~0) .cse13 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse16 .cse18 .cse19 .cse20 .cse11 .cse12 .cse14 .cse23 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse8 .cse21 .cse11 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 (<= .cse25 ~c_t~0) .cse22 .cse3 .cse5 .cse6 .cse9 .cse10 .cse21 .cse13 .cse16 (= ~c_req_up~0 1) .cse18 .cse19 .cse20 .cse26 .cse11 .cse27 .cse12 .cse14 (<= ~c_t~0 .cse25) .cse23 .cse17) (and .cse0 .cse22 .cse26 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse21 .cse11 .cse27 .cse12 .cse14 .cse24 .cse16 .cse17 .cse23 .cse18 .cse19 .cse20)))) [2019-11-15 23:40:22,950 INFO L439 ceAbstractionStarter]: At program point L69(lines 55 125) the Hoare annotation is: (let ((.cse0 (= ~c2_pc~0 1)) (.cse4 (not (= ~e_e~0 0))) (.cse6 (<= 2 ~c2_st~0)) (.cse8 (<= 2 ~c1_st~0)) (.cse23 (<= 2 ~wb_st~0)) (.cse11 (= ~c1_pc~0 1)) (.cse13 (not (= ~e_g~0 1))) (.cse25 (= 1 ~wb_pc~0)) (.cse15 (= ~e_e~0 ~e_c~0)) (.cse22 (= ~c2_st~0 0)) (.cse1 (= ~wb_i~0 1)) (.cse2 (= ~processed~0 0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse5 (= ~c2_i~0 1)) (.cse7 (<= ~data~0 ~t_b~0)) (.cse9 (= 0 ~wb_st~0)) (.cse24 (= ~c2_pc~0 0)) (.cse10 (<= 2 ~e_wl~0)) (.cse12 (<= ~r_i~0 0)) (.cse26 (= ~c1_pc~0 0)) (.cse14 (not (= ~e_g~0 0))) (.cse16 (= ~c1_i~0 1)) (.cse17 (= ~e_e~0 ~e_f~0)) (.cse18 (<= 2 ~r_st~0)) (.cse27 (= ~c1_st~0 0)) (.cse28 (= ~e_c~0 ~e_g~0)) (.cse19 (<= ~c_req_up~0 0)) (.cse29 (= ~e_g~0 ~e_f~0)) (.cse20 (not (= ~e_e~0 1))) (.cse21 (= 0 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse24 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse22 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse10 .cse12 .cse13 .cse25 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20) (and .cse22 .cse1 .cse2 .cse3 .cse5 .cse7 .cse23 .cse24 .cse10 .cse12 .cse25 .cse26 .cse14 .cse16 .cse17 .cse18 .cse27 .cse28 .cse19 .cse29 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse22 .cse1 .cse2 .cse3 .cse5 .cse7 .cse9 .cse24 .cse10 .cse12 .cse26 .cse14 .cse16 .cse17 .cse18 .cse27 .cse28 .cse19 .cse29 .cse20 .cse21))) [2019-11-15 23:40:22,950 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 602) no Hoare annotation was computed. [2019-11-15 23:40:22,950 INFO L439 ceAbstractionStarter]: At program point L466(lines 459 476) the Hoare annotation is: (let ((.cse0 (= ~c2_st~0 0)) (.cse1 (= ~wb_i~0 1)) (.cse2 (= ~c2_i~0 1)) (.cse5 (= 0 ~wb_st~0)) (.cse8 (<= 2 ~e_wl~0)) (.cse10 (<= ~r_i~0 0)) (.cse3 (= ~c1_i~0 1)) (.cse4 (= ~e_e~0 ~e_f~0)) (.cse6 (= ~c1_st~0 0)) (.cse7 (= 0 ~wl_pc~0)) (.cse9 (= ~e_g~0 ~e_f~0))) (or (and .cse0 .cse1 (<= 2 ~wl_st~0) (= ~e_wl~0 ~e_f~0) (not (= ~e_c~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ~processed~0 0) (<= ~t_b~0 ~data~0) (= 0 ~wl_st~0) .cse2 (<= ~data~0 ~t_b~0) .cse5 (= ~c2_pc~0 0) .cse8 .cse10 (= ~c1_pc~0 0) .cse3 .cse4 (<= 2 ~r_st~0) .cse6 .cse7 (= ~e_c~0 ~e_g~0) (<= ~c_req_up~0 0) .cse9 (= 0 ~wb_pc~0) (= ~e_wl~0 ~e_c~0)))) [2019-11-15 23:40:22,950 INFO L443 ceAbstractionStarter]: For program point L467(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,950 INFO L443 ceAbstractionStarter]: For program point L434-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,950 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-15 23:40:22,950 INFO L443 ceAbstractionStarter]: For program point L302-1(lines 288 386) no Hoare annotation was computed. [2019-11-15 23:40:22,950 INFO L443 ceAbstractionStarter]: For program point L666(lines 666 670) no Hoare annotation was computed. [2019-11-15 23:40:22,950 INFO L443 ceAbstractionStarter]: For program point L666-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,951 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 472) no Hoare annotation was computed. [2019-11-15 23:40:22,951 INFO L443 ceAbstractionStarter]: For program point L634-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,951 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-15 23:40:22,951 INFO L443 ceAbstractionStarter]: For program point L569-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,952 INFO L439 ceAbstractionStarter]: At program point L371(lines 288 386) the Hoare annotation is: (let ((.cse26 (= 1 ~wl_pc~0)) (.cse17 (= ~e_e~0 ~e_f~0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse24 (<= 2 ~wl_st~0)) (.cse36 (not (= ~e_e~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse6 (<= 2 ~c2_st~0)) (.cse8 (<= 2 ~c1_st~0)) (.cse14 (not (= ~e_g~0 0))) (.cse15 (= ~e_e~0 ~e_c~0)) (.cse16 (= ~c1_i~0 1)) (.cse32 (<= 2 ~wb_st~0)) (.cse18 (<= 2 ~r_st~0)) (.cse20 (<= ~c_req_up~0 0)) (.cse11 (= ~c1_pc~0 1)) (.cse41 (= ~e_f~0 ~wl_st~0)) (.cse30 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_g~0 1))) (.cse13 (<= ~r_i~0 0)) (.cse33 (= 1 ~wb_pc~0)) (.cse55 (+ ~t_b~0 1)) (.cse53 (+ ~t_b~0 2))) (let ((.cse50 (<= .cse53 ~c~0)) (.cse52 (<= ~c~0 .cse53)) (.cse42 (<= .cse55 ~c_t~0)) (.cse43 (<= .cse55 ~c~0)) (.cse44 (<= ~c_t~0 .cse55)) (.cse34 (not (= ~e_f~0 1))) (.cse39 (<= .cse55 ~data~0)) (.cse35 (not (= ~e_f~0 0))) (.cse40 (<= ~data~0 .cse55)) (.cse47 (<= ~c~0 .cse55)) (.cse54 (or (and .cse0 .cse2 .cse1 .cse24 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse0 .cse1 .cse2 .cse24 .cse36 .cse5 .cse6 .cse8 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33))) (.cse23 (= ~c2_st~0 0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse4 (= 0 ~wl_st~0)) (.cse7 (<= ~data~0 ~t_b~0)) (.cse9 (= 0 ~wb_st~0)) (.cse25 (= ~c2_pc~0 0)) (.cse10 (<= 2 ~e_wl~0)) (.cse27 (= ~c1_pc~0 0)) (.cse28 (= ~c1_st~0 0)) (.cse19 (= 0 ~wl_pc~0)) (.cse29 (= ~e_c~0 ~e_g~0)) (.cse31 (= ~e_g~0 ~e_f~0)) (.cse21 (= 0 ~wb_pc~0)) (.cse22 (= ~e_wl~0 ~e_c~0)) (.cse49 (<= .cse53 ~c_t~0)) (.cse38 (= 2 ~wl_pc~0)) (.cse37 (not (= ~e_c~0 0))) (.cse48 (= ~c_req_up~0 1)) (.cse45 (<= .cse53 ~data~0)) (.cse46 (<= ~data~0 .cse53)) (.cse51 (<= ~c_t~0 .cse53))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse9 .cse25 .cse13 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse10 .cse12 .cse13 .cse33 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse22) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse34 .cse2 .cse3 .cse4 .cse35 .cse36 .cse5 .cse26 .cse6 .cse8 .cse7 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse6 .cse14 .cse16 .cse32 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse6 .cse8 .cse14 .cse16 .cse32 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse38 .cse39 .cse2 .cse1 .cse24 .cse37 .cse36 .cse5 .cse8 .cse14 .cse40 .cse16 .cse18 .cse9 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse32 .cse25 .cse13 .cse33 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse34 .cse23 .cse2 .cse1 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse42 .cse43 .cse44 (or (and .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse46 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse39 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33)) .cse47) (and .cse0 .cse42 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse39 .cse14 .cse40 .cse16 .cse18 .cse28 .cse44 .cse41 .cse30) (and .cse0 .cse34 .cse23 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse8 .cse14 .cse16 .cse32 .cse18 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse49 .cse0 .cse38 .cse2 .cse24 .cse50 .cse37 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 .cse14 .cse45 .cse16 .cse46 .cse51 .cse52 .cse20 .cse41 .cse30) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse7 .cse8 .cse9 .cse25 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse32 .cse12 .cse13 .cse33 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30) (and .cse49 .cse0 .cse34 .cse38 .cse2 (<= .cse53 ~d~0) .cse50 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 (<= ~d~0 .cse53) .cse14 .cse45 .cse16 .cse18 .cse46 .cse51 .cse52 .cse20 .cse30) (and .cse10 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse38 .cse2 .cse1 .cse24 .cse3 .cse37 .cse36 .cse5 .cse7 .cse32 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse11 .cse12 .cse13 .cse33 .cse14 .cse16 .cse18 .cse28 .cse41 .cse30) (and .cse0 .cse38 .cse2 .cse1 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse16 .cse45 .cse18 .cse46 .cse9 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse1 .cse2 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse6 .cse14 .cse16 .cse18 .cse9 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse48 (and .cse42 .cse44 (or (and .cse0 .cse38 .cse39 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse18 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse46 .cse18 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33)))) (and .cse38 .cse54) (and .cse0 .cse34 .cse23 .cse2 .cse1 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse14 .cse16 .cse32 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse39 .cse1 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse14 .cse40 .cse16 .cse18 .cse9 .cse28 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse32 .cse25 .cse10 .cse13 .cse33 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse22) (and .cse0 .cse23 .cse42 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse8 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse39 .cse14 .cse40 .cse16 .cse18 .cse44 .cse41 .cse30) (and .cse0 .cse34 .cse2 .cse1 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse6 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and (<= ~d~0 .cse55) (<= .cse55 ~d~0) .cse42 .cse43 .cse44 (or (and .cse0 .cse34 .cse38 .cse2 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse18 .cse46 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse38 .cse39 .cse2 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33)) .cse47) (and .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse32 .cse25 .cse10 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30 .cse21) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse7 .cse8 .cse32 .cse25 .cse11 .cse12 .cse13 .cse33 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse3 .cse54 .cse7) (and .cse2 .cse24 (= ~e_wl~0 ~e_f~0) .cse37 .cse36 .cse5 .cse14 .cse16 .cse19 .cse10 .cse30 .cse12 .cse13) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse9 .cse25 .cse10 .cse13 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse21 .cse22) (and .cse49 .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse14 .cse45 .cse16 .cse46 .cse18 .cse51 .cse41 .cse30)))) [2019-11-15 23:40:22,952 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,952 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,952 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 119) no Hoare annotation was computed. [2019-11-15 23:40:22,953 INFO L439 ceAbstractionStarter]: At program point L341(lines 288 386) the Hoare annotation is: (let ((.cse26 (= 1 ~wl_pc~0)) (.cse17 (= ~e_e~0 ~e_f~0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse24 (<= 2 ~wl_st~0)) (.cse36 (not (= ~e_e~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse6 (<= 2 ~c2_st~0)) (.cse8 (<= 2 ~c1_st~0)) (.cse14 (not (= ~e_g~0 0))) (.cse15 (= ~e_e~0 ~e_c~0)) (.cse16 (= ~c1_i~0 1)) (.cse32 (<= 2 ~wb_st~0)) (.cse18 (<= 2 ~r_st~0)) (.cse20 (<= ~c_req_up~0 0)) (.cse11 (= ~c1_pc~0 1)) (.cse41 (= ~e_f~0 ~wl_st~0)) (.cse30 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_g~0 1))) (.cse13 (<= ~r_i~0 0)) (.cse33 (= 1 ~wb_pc~0)) (.cse55 (+ ~t_b~0 1)) (.cse53 (+ ~t_b~0 2))) (let ((.cse49 (<= .cse53 ~c_t~0)) (.cse50 (<= .cse53 ~c~0)) (.cse51 (<= ~c_t~0 .cse53)) (.cse52 (<= ~c~0 .cse53)) (.cse48 (= ~c_req_up~0 1)) (.cse42 (<= .cse55 ~c_t~0)) (.cse43 (<= .cse55 ~c~0)) (.cse44 (<= ~c_t~0 .cse55)) (.cse45 (<= .cse53 ~data~0)) (.cse46 (<= ~data~0 .cse53)) (.cse34 (not (= ~e_f~0 1))) (.cse38 (= 2 ~wl_pc~0)) (.cse39 (<= .cse55 ~data~0)) (.cse35 (not (= ~e_f~0 0))) (.cse40 (<= ~data~0 .cse55)) (.cse47 (<= ~c~0 .cse55)) (.cse54 (or (and .cse0 .cse2 .cse1 .cse24 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse0 .cse1 .cse2 .cse24 .cse36 .cse5 .cse6 .cse8 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33))) (.cse37 (not (= ~e_c~0 0))) (.cse23 (= ~c2_st~0 0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse4 (= 0 ~wl_st~0)) (.cse7 (<= ~data~0 ~t_b~0)) (.cse9 (= 0 ~wb_st~0)) (.cse25 (= ~c2_pc~0 0)) (.cse10 (<= 2 ~e_wl~0)) (.cse27 (= ~c1_pc~0 0)) (.cse28 (= ~c1_st~0 0)) (.cse19 (= 0 ~wl_pc~0)) (.cse29 (= ~e_c~0 ~e_g~0)) (.cse31 (= ~e_g~0 ~e_f~0)) (.cse21 (= 0 ~wb_pc~0)) (.cse22 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse9 .cse25 .cse13 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse10 .cse12 .cse13 .cse33 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse22) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse34 .cse2 .cse3 .cse4 .cse35 .cse36 .cse5 .cse26 .cse6 .cse8 .cse7 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse6 .cse14 .cse16 .cse32 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse6 .cse8 .cse14 .cse16 .cse32 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse38 .cse39 .cse2 .cse1 .cse24 .cse37 .cse36 .cse5 .cse8 .cse14 .cse40 .cse16 .cse18 .cse9 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse32 .cse25 .cse13 .cse33 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse34 .cse23 .cse2 .cse1 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse42 .cse43 .cse44 (or (and .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse46 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse39 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33)) .cse47) (and .cse0 .cse42 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse39 .cse14 .cse40 .cse16 .cse18 .cse28 .cse44 .cse41 .cse30) (and .cse0 .cse34 .cse23 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse8 .cse14 .cse16 .cse32 .cse18 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse49 .cse0 .cse38 .cse2 .cse24 .cse50 .cse37 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 .cse14 .cse45 .cse16 .cse46 .cse51 .cse52 .cse20 .cse41 .cse30) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse7 .cse8 .cse9 .cse25 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse32 .cse12 .cse13 .cse33 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30) (and .cse49 .cse0 .cse34 .cse38 .cse2 (<= .cse53 ~d~0) .cse50 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 (<= ~d~0 .cse53) .cse14 .cse45 .cse16 .cse18 .cse46 .cse51 .cse52 .cse20 .cse30) (and .cse10 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse38 .cse2 .cse1 .cse24 .cse3 .cse37 .cse36 .cse5 .cse7 .cse32 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse11 .cse12 .cse13 .cse33 .cse14 .cse16 .cse18 .cse28 .cse41 .cse30) (and .cse0 .cse38 .cse2 .cse1 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse16 .cse45 .cse18 .cse46 .cse9 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse1 .cse2 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse6 .cse14 .cse16 .cse18 .cse9 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse48 (and .cse42 .cse44 (or (and .cse0 .cse38 .cse39 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse18 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse46 .cse18 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33)))) (and .cse38 .cse54) (and .cse0 .cse34 .cse23 .cse2 .cse1 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse14 .cse16 .cse32 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse39 .cse1 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse14 .cse40 .cse16 .cse18 .cse9 .cse28 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse32 .cse25 .cse10 .cse13 .cse33 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse22) (and .cse0 .cse23 .cse42 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse8 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse39 .cse14 .cse40 .cse16 .cse18 .cse44 .cse41 .cse30) (and .cse0 .cse34 .cse2 .cse1 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse6 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and (<= ~d~0 .cse55) (<= .cse55 ~d~0) .cse42 .cse43 .cse44 (or (and .cse0 .cse34 .cse38 .cse2 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse18 .cse46 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse38 .cse39 .cse2 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33)) .cse47) (and .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse32 .cse25 .cse10 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30 .cse21) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse7 .cse8 .cse32 .cse25 .cse11 .cse12 .cse13 .cse33 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse3 .cse54 .cse7) (and .cse2 .cse24 (= ~e_wl~0 ~e_f~0) .cse37 .cse36 .cse5 .cse14 .cse16 .cse19 .cse10 .cse30 .cse12 .cse13) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse9 .cse25 .cse10 .cse13 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse21 .cse22)))) [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 184) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L606(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L639-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 382) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 611) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L574-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 118) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L443 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-11-15 23:40:22,954 INFO L439 ceAbstractionStarter]: At program point L707(lines 682 709) the Hoare annotation is: (= ~c2_i~0 1) [2019-11-15 23:40:22,955 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 552) no Hoare annotation was computed. [2019-11-15 23:40:22,956 INFO L443 ceAbstractionStarter]: For program point L509-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,957 INFO L443 ceAbstractionStarter]: For program point L542-2(lines 542 552) no Hoare annotation was computed. [2019-11-15 23:40:22,958 INFO L439 ceAbstractionStarter]: At program point L311(lines 288 386) the Hoare annotation is: (let ((.cse54 (+ ~t_b~0 2)) (.cse49 (+ ~t_b~0 1))) (let ((.cse45 (<= .cse49 ~c~0)) (.cse47 (<= ~c~0 .cse49)) (.cse44 (<= .cse49 ~c_t~0)) (.cse48 (= ~c_req_up~0 1)) (.cse42 (<= .cse49 ~data~0)) (.cse43 (<= ~data~0 .cse49)) (.cse46 (<= ~c_t~0 .cse49)) (.cse37 (= ~e_f~0 ~wl_st~0)) (.cse26 (= 1 ~wl_pc~0)) (.cse15 (= ~e_e~0 ~e_c~0)) (.cse24 (<= 2 ~wl_st~0)) (.cse23 (= ~c2_st~0 0)) (.cse1 (= ~processed~0 0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse7 (<= ~data~0 ~t_b~0)) (.cse9 (= 0 ~wb_st~0)) (.cse25 (= ~c2_pc~0 0)) (.cse10 (<= 2 ~e_wl~0)) (.cse27 (= ~c1_pc~0 0)) (.cse17 (= ~e_e~0 ~e_f~0)) (.cse28 (= ~c1_st~0 0)) (.cse19 (= 0 ~wl_pc~0)) (.cse29 (= ~e_c~0 ~e_g~0)) (.cse31 (= ~e_g~0 ~e_f~0)) (.cse21 (= 0 ~wb_pc~0)) (.cse22 (= ~e_wl~0 ~e_c~0)) (.cse50 (<= .cse54 ~c_t~0)) (.cse0 (= ~c2_pc~0 1)) (.cse40 (not (= ~e_f~0 1))) (.cse32 (= 2 ~wl_pc~0)) (.cse2 (= ~wb_i~0 1)) (.cse51 (<= .cse54 ~c~0)) (.cse4 (= 0 ~wl_st~0)) (.cse33 (not (= ~e_c~0 0))) (.cse41 (not (= ~e_f~0 0))) (.cse34 (not (= ~e_e~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse6 (<= 2 ~c2_st~0)) (.cse8 (<= 2 ~c1_st~0)) (.cse35 (<= 2 ~wb_st~0)) (.cse11 (= ~c1_pc~0 1)) (.cse12 (not (= ~e_g~0 1))) (.cse13 (<= ~r_i~0 0)) (.cse36 (= 1 ~wb_pc~0)) (.cse14 (not (= ~e_g~0 0))) (.cse38 (<= .cse54 ~data~0)) (.cse16 (= ~c1_i~0 1)) (.cse18 (<= 2 ~r_st~0)) (.cse39 (<= ~data~0 .cse54)) (.cse52 (<= ~c_t~0 .cse54)) (.cse53 (<= ~c~0 .cse54)) (.cse20 (<= ~c_req_up~0 0)) (.cse30 (not (= ~e_e~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse9 .cse25 .cse13 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31 .cse21) (and .cse0 .cse23 .cse32 .cse2 .cse1 .cse24 .cse3 .cse33 .cse34 .cse5 .cse7 .cse35 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse11 .cse12 .cse13 .cse36 .cse14 .cse16 .cse18 .cse28 .cse37 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse35 .cse10 .cse12 .cse13 .cse36 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse22) (and .cse0 .cse2 .cse1 .cse24 .cse3 .cse34 .cse5 .cse6 .cse7 .cse8 .cse35 .cse11 .cse12 .cse13 .cse36 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse0 .cse32 .cse2 .cse1 .cse24 .cse33 .cse34 .cse5 .cse6 .cse8 .cse14 .cse16 .cse38 .cse18 .cse39 .cse9 .cse11 .cse30 .cse37 .cse12 .cse13 .cse36) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse35 .cse10 .cse11 .cse12 .cse13 .cse36 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse40 .cse2 .cse3 .cse4 .cse41 .cse34 .cse5 .cse26 .cse6 .cse8 .cse7 .cse14 .cse15 .cse16 .cse35 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse36) (and .cse0 .cse40 .cse2 .cse24 .cse33 .cse41 .cse26 .cse34 .cse5 .cse6 .cse14 .cse16 .cse35 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse36) (and .cse0 .cse40 .cse1 .cse2 .cse24 .cse33 .cse41 .cse34 .cse5 .cse26 .cse6 .cse14 .cse16 .cse18 .cse9 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse36) (and .cse0 .cse40 .cse2 .cse24 .cse33 .cse41 .cse26 .cse34 .cse5 .cse6 .cse8 .cse14 .cse16 .cse35 .cse10 .cse11 .cse30 .cse12 .cse13 .cse36) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse32 .cse42 .cse2 .cse1 .cse24 .cse33 .cse34 .cse5 .cse8 .cse14 .cse43 .cse16 .cse18 .cse9 .cse11 .cse30 .cse37 .cse12 .cse13 .cse36) (and .cse0 .cse40 .cse23 .cse2 .cse1 .cse24 .cse33 .cse41 .cse26 .cse34 .cse5 .cse14 .cse16 .cse35 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse36) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse35 .cse25 .cse13 .cse36 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse40 .cse23 .cse2 .cse1 .cse24 .cse33 .cse41 .cse34 .cse5 .cse26 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse36) (and .cse44 .cse45 .cse46 (or (and .cse0 .cse32 .cse2 .cse24 .cse33 .cse34 .cse5 .cse6 .cse8 .cse14 .cse38 .cse16 .cse35 .cse39 .cse20 .cse11 .cse37 .cse30 .cse12 .cse13 .cse36) (and .cse0 .cse32 .cse42 .cse2 .cse24 .cse33 .cse34 .cse5 .cse6 .cse8 .cse14 .cse43 .cse16 .cse35 .cse20 .cse11 .cse37 .cse30 .cse12 .cse13 .cse36)) .cse47) (and .cse0 .cse32 .cse42 .cse1 .cse2 .cse24 .cse33 .cse34 .cse5 .cse6 .cse14 .cse43 .cse16 .cse18 .cse9 .cse28 .cse11 .cse30 .cse37 .cse12 .cse13 .cse36) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse35 .cse25 .cse10 .cse13 .cse36 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse22) (and .cse0 .cse23 .cse44 .cse32 .cse2 .cse24 .cse33 .cse34 .cse5 .cse8 .cse35 .cse11 .cse48 .cse12 .cse13 .cse36 .cse42 .cse14 .cse43 .cse16 .cse18 .cse46 .cse37 .cse30) (and .cse0 .cse40 .cse2 .cse1 .cse24 .cse33 .cse41 .cse34 .cse5 .cse26 .cse6 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse36) (and (<= ~d~0 .cse49) (<= .cse49 ~d~0) .cse44 .cse45 .cse46 (or (and .cse0 .cse40 .cse32 .cse2 .cse4 .cse33 .cse41 .cse34 .cse5 .cse6 .cse8 .cse14 .cse38 .cse16 .cse35 .cse18 .cse39 .cse20 .cse11 .cse30 .cse12 .cse13 .cse36) (and .cse0 .cse40 .cse32 .cse42 .cse2 .cse4 .cse33 .cse41 .cse34 .cse5 .cse6 .cse8 .cse14 .cse43 .cse16 .cse35 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse36)) .cse47) (and .cse0 .cse40 .cse23 .cse2 .cse24 .cse33 .cse41 .cse26 .cse34 .cse5 .cse8 .cse14 .cse16 .cse35 .cse18 .cse10 .cse11 .cse30 .cse12 .cse13 .cse36) (and .cse50 .cse0 .cse32 .cse2 .cse24 .cse51 .cse33 .cse34 .cse5 .cse6 .cse8 .cse35 .cse11 .cse12 .cse13 .cse36 .cse14 .cse38 .cse16 .cse39 .cse52 .cse53 .cse20 .cse37 .cse30) (and .cse0 .cse44 .cse32 .cse2 .cse24 .cse33 .cse34 .cse5 .cse6 .cse35 .cse11 .cse48 .cse12 .cse13 .cse36 .cse42 .cse14 .cse43 .cse16 .cse18 .cse28 .cse46 .cse37 .cse30) (and .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse35 .cse25 .cse10 .cse11 .cse12 .cse13 .cse36 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse34 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30 .cse21) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse34 .cse5 .cse7 .cse8 .cse9 .cse25 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse2 .cse1 .cse24 .cse3 .cse34 .cse5 .cse6 .cse7 .cse35 .cse12 .cse13 .cse36 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse34 .cse5 .cse7 .cse8 .cse35 .cse25 .cse11 .cse12 .cse13 .cse36 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse2 .cse24 (= ~e_wl~0 ~e_f~0) .cse33 .cse34 .cse5 .cse14 .cse16 .cse19 .cse10 .cse30 .cse12 .cse13) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse9 .cse25 .cse10 .cse13 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse21 .cse22) (and .cse50 .cse0 .cse40 .cse32 .cse2 (<= .cse54 ~d~0) .cse51 .cse4 .cse33 .cse41 .cse34 .cse5 .cse6 .cse8 .cse35 .cse11 .cse12 .cse13 .cse36 (<= ~d~0 .cse54) .cse14 .cse38 .cse16 .cse18 .cse39 .cse52 .cse53 .cse20 .cse30)))) [2019-11-15 23:40:22,958 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 183) no Hoare annotation was computed. [2019-11-15 23:40:22,958 INFO L439 ceAbstractionStarter]: At program point L14(lines 55 125) the Hoare annotation is: (let ((.cse12 (= ~c2_st~0 0)) (.cse19 (<= 2 ~c1_st~0)) (.cse6 (<= 2 ~wb_st~0)) (.cse5 (= ~c2_pc~0 1)) (.cse11 (= ~c1_i~0 1)) (.cse7 (not (= ~e_f~0 1))) (.cse13 (<= 2 ~r_st~0)) (.cse21 (= ~c1_st~0 0)) (.cse14 (and (and (and (not (= ~e_g~0 0)) (= ~c2_i~0 1) (<= ~r_i~0 0)) (not (= ~e_e~0 0))) (not (= ~e_c~0 0)))) (.cse15 (= ~wb_i~0 1)) (.cse9 (= ~c1_pc~0 1)) (.cse16 (not (= ~e_e~0 1))) (.cse17 (not (= ~e_g~0 1))) (.cse20 (= 1 ~wb_pc~0)) (.cse22 (<= 2 ~c2_st~0))) (let ((.cse1 (= 2 ~wl_pc~0)) (.cse2 (or (and .cse6 (and .cse5 .cse11 .cse7 .cse12 .cse13 .cse21 .cse14 .cse15 .cse9 .cse16 .cse17 .cse20)) (and .cse6 (and .cse5 .cse11 .cse7 .cse12 .cse13 .cse14 .cse15 .cse9 .cse16 .cse17 .cse20) .cse19) (and .cse6 (and .cse5 .cse11 .cse7 .cse13 .cse14 .cse15 .cse9 .cse16 .cse17 .cse20) .cse22 .cse19) (and .cse6 (and .cse5 .cse11 .cse7 .cse13 .cse21 .cse14 .cse15 .cse9 .cse16 .cse17 .cse20) .cse22))) (.cse3 (not (= ~e_f~0 0)))) (or (let ((.cse0 (+ ~t_b~0 2))) (and (<= .cse0 ~data~0) (<= ~data~0 .cse0) .cse1 .cse2 .cse3)) (let ((.cse4 (+ ~t_b~0 1))) (and (<= ~data~0 .cse4) .cse1 (<= .cse4 ~data~0) .cse2 .cse3)) (and (let ((.cse8 (<= ~c_req_up~0 0)) (.cse10 (= ~e_e~0 ~e_c~0)) (.cse18 (= 1 ~wl_pc~0))) (or (and .cse5 .cse6 (and .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) .cse18 .cse19 .cse20) (and .cse5 (and .cse7 .cse8 (and .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17) .cse9) .cse6 .cse18 .cse20) (and .cse5 .cse6 (and .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17)) .cse18 .cse22 .cse20) (and .cse5 .cse6 (and .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17)) .cse18 .cse22 .cse19 .cse20))) (<= ~t_b~0 ~data~0) .cse3 (<= ~data~0 ~t_b~0))))) [2019-11-15 23:40:22,959 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 548) no Hoare annotation was computed. [2019-11-15 23:40:22,959 INFO L443 ceAbstractionStarter]: For program point L477(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,959 INFO L443 ceAbstractionStarter]: For program point L543-2(lines 543 548) no Hoare annotation was computed. [2019-11-15 23:40:22,959 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,959 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 352) no Hoare annotation was computed. [2019-11-15 23:40:22,960 INFO L439 ceAbstractionStarter]: At program point L180(lines 175 215) the Hoare annotation is: (let ((.cse22 (+ ~t_b~0 1))) (let ((.cse1 (not (= ~e_f~0 1))) (.cse6 (not (= ~e_f~0 0))) (.cse9 (= 1 ~wl_pc~0)) (.cse15 (<= 2 ~e_wl~0)) (.cse21 (<= 2 ~wb_st~0)) (.cse27 (= ~c1_st~0 0)) (.cse0 (= ~c2_pc~0 1)) (.cse23 (= 2 ~wl_pc~0)) (.cse24 (<= .cse22 ~data~0)) (.cse2 (= ~wb_i~0 1)) (.cse3 (= ~processed~0 0)) (.cse4 (<= 2 ~wl_st~0)) (.cse5 (not (= ~e_c~0 0))) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse10 (<= 2 ~c1_st~0)) (.cse11 (not (= ~e_g~0 0))) (.cse25 (<= ~data~0 .cse22)) (.cse12 (= ~c1_i~0 1)) (.cse13 (<= 2 ~r_st~0)) (.cse14 (= 0 ~wb_st~0)) (.cse16 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_e~0 1))) (.cse26 (= ~e_f~0 ~wl_st~0)) (.cse18 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0)) (.cse20 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12 .cse21 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 (<= .cse22 ~c_t~0) .cse23 .cse2 .cse4 .cse5 .cse7 .cse8 .cse10 .cse21 .cse16 (= ~c_req_up~0 1) .cse18 .cse19 .cse20 .cse24 .cse11 .cse25 .cse12 .cse13 (<= ~c_t~0 .cse22) .cse26 .cse17) (and .cse2 .cse4 (= ~e_wl~0 ~e_f~0) .cse5 .cse7 .cse8 .cse11 .cse12 (= 0 ~wl_pc~0) .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12 .cse21 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse23 .cse2 .cse3 .cse4 (<= ~t_b~0 ~data~0) .cse5 .cse7 .cse8 (<= ~data~0 ~t_b~0) .cse21 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse16 .cse18 .cse19 .cse20 .cse11 .cse12 .cse13 .cse27 .cse26 .cse17) (and .cse0 .cse23 .cse24 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse16 .cse17 .cse26 .cse18 .cse19 .cse20)))) [2019-11-15 23:40:22,960 INFO L439 ceAbstractionStarter]: At program point L676(lines 393 681) the Hoare annotation is: (= ~c2_i~0 1) [2019-11-15 23:40:22,960 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-15 23:40:22,960 INFO L443 ceAbstractionStarter]: For program point L644-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,961 INFO L439 ceAbstractionStarter]: At program point L149-1(lines 130 170) the Hoare annotation is: (let ((.cse40 (+ ~t_b~0 1)) (.cse41 (+ ~t_b~0 2)) (.cse9 (= 1 ~wl_pc~0)) (.cse13 (= ~e_e~0 ~e_f~0)) (.cse21 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse5 (= ~wb_i~0 1)) (.cse6 (<= 2 ~wl_st~0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse24 (<= 2 ~c2_st~0)) (.cse10 (not (= ~e_g~0 0))) (.cse11 (= ~e_e~0 ~e_c~0)) (.cse12 (= ~c1_i~0 1)) (.cse33 (<= 2 ~wb_st~0)) (.cse14 (<= 2 ~r_st~0)) (.cse16 (<= ~c_req_up~0 0)) (.cse27 (= ~c1_pc~0 1)) (.cse28 (= ~e_f~0 ~wl_st~0)) (.cse17 (not (= ~e_e~0 1))) (.cse19 (not (= ~e_g~0 1))) (.cse20 (<= ~r_i~0 0)) (.cse29 (= 1 ~wb_pc~0))) (let ((.cse30 (or (and .cse1 .cse24 (and .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29)) (and .cse21 .cse1 .cse5 .cse6 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse33 .cse14 .cse16 .cse27 .cse28 .cse17 .cse19 .cse20 .cse29))) (.cse25 (<= .cse41 ~data~0)) (.cse26 (<= ~data~0 .cse41)) (.cse22 (= 2 ~wl_pc~0)) (.cse36 (<= .cse40 ~data~0)) (.cse37 (<= ~data~0 .cse40)) (.cse4 (= ~c2_st~0 0)) (.cse2 (<= ~t_b~0 ~data~0)) (.cse32 (= 0 ~wl_st~0)) (.cse3 (<= ~data~0 ~t_b~0)) (.cse15 (= 0 ~wb_st~0)) (.cse0 (= ~c2_pc~0 0)) (.cse34 (= 0 ~wl_pc~0)) (.cse18 (= 0 ~wb_pc~0)) (.cse35 (= ~e_wl~0 ~e_c~0)) (.cse38 (not (= ~e_f~0 1))) (.cse23 (not (= ~e_c~0 0))) (.cse39 (not (= ~e_f~0 0))) (.cse31 (<= 2 ~e_wl~0))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (and .cse21 .cse22 .cse5 .cse1 .cse6 .cse23 .cse7 .cse8 .cse24 .cse10 .cse12 .cse25 .cse14 .cse26 .cse15 .cse27 .cse17 .cse28 .cse19 .cse20 .cse29) (and .cse22 .cse30) (and .cse0 .cse1 .cse31 .cse2 (and .cse4 .cse5 .cse32 .cse8 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse34 .cse16 .cse19 .cse20 .cse35 .cse29) .cse3) (and .cse2 .cse30 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse33 .cse0 .cse19 .cse20 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (and .cse21 .cse4 .cse22 .cse36 .cse5 .cse1 .cse6 .cse23 .cse7 .cse8 .cse10 .cse37 .cse12 .cse14 .cse15 .cse27 .cse17 .cse28 .cse19 .cse20 .cse29) (and .cse21 .cse38 .cse4 .cse5 .cse1 .cse6 .cse23 .cse39 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse31 .cse27 .cse17 .cse19 .cse20 .cse29) (and .cse21 .cse1 .cse5 .cse2 .cse32 .cse8 .cse24 .cse3 .cse33 .cse31 .cse19 .cse20 .cse29 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34 .cse16 .cse35) (and .cse21 .cse38 .cse5 .cse1 .cse6 .cse23 .cse39 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse14 .cse15 .cse31 .cse27 .cse17 .cse19 .cse20 .cse29) (and .cse21 .cse38 .cse4 .cse5 .cse1 .cse6 .cse23 .cse39 .cse9 .cse7 .cse8 .cse10 .cse12 .cse33 .cse14 .cse31 .cse27 .cse17 .cse19 .cse20 .cse29) (and .cse31 .cse30) (and .cse1 .cse31 .cse2 (and .cse21 .cse5 .cse32 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse18 .cse19 .cse20 .cse35) .cse24 .cse3) (and (<= .cse40 ~c_t~0) (or (and .cse21 .cse22 .cse5 .cse6 .cse23 .cse7 .cse8 .cse24 .cse10 .cse25 .cse12 .cse33 .cse26 .cse14 .cse27 .cse28 .cse17 .cse19 .cse20 .cse29) (and .cse21 .cse22 .cse36 .cse5 .cse6 .cse23 .cse7 .cse8 .cse24 .cse10 .cse37 .cse12 .cse33 .cse14 .cse27 .cse28 .cse17 .cse19 .cse20 .cse29)) (<= ~c_t~0 .cse40) (= ~c_req_up~0 1)) (and .cse5 .cse6 (= ~e_wl~0 ~e_f~0) .cse23 .cse7 .cse8 .cse10 .cse12 .cse34 .cse31 .cse17 .cse19 .cse20) (and (and .cse21 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse1 .cse2 .cse39 .cse24 .cse3) (and .cse4 .cse1 .cse5 .cse2 .cse32 .cse8 .cse3 .cse15 .cse0 .cse31 .cse19 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34 .cse16 .cse18 .cse35) (and .cse21 .cse38 .cse5 .cse6 .cse23 .cse39 .cse9 .cse7 .cse8 .cse24 .cse10 .cse12 .cse33 .cse14 .cse31 .cse27 .cse17 .cse19 .cse20 .cse29)))) [2019-11-15 23:40:22,961 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-15 23:40:22,961 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 77 120) no Hoare annotation was computed. [2019-11-15 23:40:22,961 INFO L443 ceAbstractionStarter]: For program point L414-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,961 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 322) no Hoare annotation was computed. [2019-11-15 23:40:22,962 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-15 23:40:22,962 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 584) no Hoare annotation was computed. [2019-11-15 23:40:22,962 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,962 INFO L443 ceAbstractionStarter]: For program point L449-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,962 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:40:22,962 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2019-11-15 23:40:22,962 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 152 160) no Hoare annotation was computed. [2019-11-15 23:40:22,963 INFO L443 ceAbstractionStarter]: For program point L615(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,963 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 157) no Hoare annotation was computed. [2019-11-15 23:40:22,963 INFO L443 ceAbstractionStarter]: For program point L616(lines 616 620) no Hoare annotation was computed. [2019-11-15 23:40:22,963 INFO L443 ceAbstractionStarter]: For program point L649-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,963 INFO L443 ceAbstractionStarter]: For program point L419-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,963 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 229) no Hoare annotation was computed. [2019-11-15 23:40:22,963 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-15 23:40:22,963 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 68) no Hoare annotation was computed. [2019-11-15 23:40:22,964 INFO L443 ceAbstractionStarter]: For program point L486(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,964 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,964 INFO L439 ceAbstractionStarter]: At program point L387(lines 279 392) the Hoare annotation is: (let ((.cse29 (+ ~t_b~0 2)) (.cse33 (= 1 ~wl_pc~0)) (.cse5 (= ~c2_pc~0 1)) (.cse7 (= ~wb_i~0 1)) (.cse8 (<= 2 ~wl_st~0)) (.cse10 (not (= ~e_e~0 0))) (.cse11 (= ~c2_i~0 1)) (.cse12 (<= 2 ~c2_st~0)) (.cse13 (<= 2 ~c1_st~0)) (.cse14 (not (= ~e_g~0 0))) (.cse16 (= ~c1_i~0 1)) (.cse17 (<= 2 ~wb_st~0)) (.cse32 (<= 2 ~r_st~0)) (.cse19 (<= ~c_req_up~0 0)) (.cse20 (= ~c1_pc~0 1)) (.cse21 (= ~e_f~0 ~wl_st~0)) (.cse22 (not (= ~e_e~0 1))) (.cse23 (not (= ~e_g~0 1))) (.cse24 (<= ~r_i~0 0)) (.cse25 (= 1 ~wb_pc~0)) (.cse3 (+ ~t_b~0 1))) (let ((.cse2 (<= .cse3 ~c_t~0)) (.cse4 (<= ~c_t~0 .cse3)) (.cse26 (<= .cse3 ~data~0)) (.cse27 (<= ~data~0 .cse3)) (.cse1 (let ((.cse34 (= ~processed~0 0)) (.cse35 (= ~e_e~0 ~e_c~0))) (or (and .cse5 .cse7 .cse34 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse20 .cse23 .cse24 .cse25 .cse33 .cse14 .cse35 .cse16 (= ~e_e~0 ~e_f~0) .cse32 .cse19 .cse22) (and .cse5 .cse34 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse35 .cse16 .cse17 .cse32 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) (.cse0 (<= 2 ~e_wl~0)) (.cse28 (<= .cse29 ~c_t~0)) (.cse6 (= 2 ~wl_pc~0)) (.cse9 (not (= ~e_c~0 0))) (.cse31 (= ~c_req_up~0 1)) (.cse15 (<= .cse29 ~data~0)) (.cse18 (<= ~data~0 .cse29)) (.cse30 (<= ~c_t~0 .cse29))) (or (and .cse0 .cse1) (and .cse2 (<= .cse3 ~c~0) .cse4 (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)) (<= ~c~0 .cse3)) (and .cse28 .cse5 .cse6 .cse7 .cse8 (<= .cse29 ~c~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse20 .cse23 .cse24 .cse25 .cse14 .cse15 .cse16 .cse18 .cse30 (<= ~c~0 .cse29) .cse19 .cse21 .cse22) (and (<= ~t_b~0 ~data~0) .cse1 (<= ~data~0 ~t_b~0)) (and .cse7 .cse8 (= ~e_wl~0 ~e_f~0) .cse9 .cse10 .cse11 .cse14 .cse16 (= 0 ~wl_pc~0) .cse0 .cse22 .cse23 .cse24) (and .cse31 (and .cse2 .cse4 (or (and .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) (and .cse6 .cse1) (and .cse5 (not (= ~e_f~0 1)) .cse7 .cse8 .cse9 (not (= ~e_f~0 0)) .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse0 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse20 .cse31 .cse23 .cse24 .cse25 .cse14 .cse15 .cse16 .cse18 .cse32 .cse30 .cse21 .cse22)))) [2019-11-15 23:40:22,965 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 272) no Hoare annotation was computed. [2019-11-15 23:40:22,965 INFO L439 ceAbstractionStarter]: At program point L586(lines 579 596) the Hoare annotation is: (let ((.cse23 (+ ~t_b~0 2))) (let ((.cse17 (= 2 ~wl_pc~0)) (.cse19 (<= .cse23 ~data~0)) (.cse20 (<= ~data~0 .cse23)) (.cse21 (<= ~c_req_up~0 0)) (.cse22 (= ~e_f~0 ~wl_st~0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (not (= ~e_f~0 1))) (.cse2 (= ~wb_i~0 1)) (.cse3 (<= 2 ~wl_st~0)) (.cse18 (not (= ~e_c~0 0))) (.cse4 (not (= ~e_e~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse6 (<= 2 ~c2_st~0)) (.cse7 (<= 2 ~c1_st~0)) (.cse8 (not (= ~e_g~0 0))) (.cse9 (= ~c1_i~0 1)) (.cse10 (<= 2 ~wb_st~0)) (.cse24 (<= 2 ~e_wl~0)) (.cse11 (= ~c1_pc~0 1)) (.cse12 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_g~0 1))) (.cse14 (<= ~r_i~0 0)) (.cse15 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~e_e~0 ~e_c~0) .cse9 .cse10 (<= 2 ~r_st~0) .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ ~t_b~0 1))) (and (<= .cse16 ~c_t~0) (<= .cse16 ~c~0) (<= ~c_t~0 .cse16) (or (and .cse0 .cse17 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse20 .cse21 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse17 (<= .cse16 ~data~0) .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~data~0 .cse16) .cse9 .cse10 .cse21 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15)) (<= ~c~0 .cse16))) (and (<= .cse23 ~c_t~0) .cse0 .cse17 .cse2 .cse3 (<= .cse23 ~c~0) .cse18 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse8 .cse19 .cse9 .cse20 (<= ~c_t~0 .cse23) (<= ~c~0 .cse23) .cse21 .cse22 .cse12) (and .cse2 .cse3 (= ~e_wl~0 ~e_f~0) .cse18 .cse4 .cse5 .cse8 .cse9 (= 0 ~wl_pc~0) .cse24 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 (not (= ~e_f~0 0)) (= 1 ~wl_pc~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2019-11-15 23:40:22,965 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-15 23:40:22,965 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,966 INFO L443 ceAbstractionStarter]: For program point L289(lines 288 386) no Hoare annotation was computed. [2019-11-15 23:40:22,966 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:40:22,966 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 260) no Hoare annotation was computed. [2019-11-15 23:40:22,966 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2019-11-15 23:40:22,966 INFO L443 ceAbstractionStarter]: For program point L587(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,966 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-15 23:40:22,966 INFO L443 ceAbstractionStarter]: For program point L554-2(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,968 INFO L439 ceAbstractionStarter]: At program point L356(lines 288 386) the Hoare annotation is: (let ((.cse26 (= 1 ~wl_pc~0)) (.cse17 (= ~e_e~0 ~e_f~0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse24 (<= 2 ~wl_st~0)) (.cse36 (not (= ~e_e~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse6 (<= 2 ~c2_st~0)) (.cse8 (<= 2 ~c1_st~0)) (.cse14 (not (= ~e_g~0 0))) (.cse15 (= ~e_e~0 ~e_c~0)) (.cse16 (= ~c1_i~0 1)) (.cse32 (<= 2 ~wb_st~0)) (.cse18 (<= 2 ~r_st~0)) (.cse20 (<= ~c_req_up~0 0)) (.cse11 (= ~c1_pc~0 1)) (.cse41 (= ~e_f~0 ~wl_st~0)) (.cse30 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_g~0 1))) (.cse13 (<= ~r_i~0 0)) (.cse33 (= 1 ~wb_pc~0)) (.cse55 (+ ~t_b~0 1)) (.cse53 (+ ~t_b~0 2))) (let ((.cse50 (<= .cse53 ~c~0)) (.cse52 (<= ~c~0 .cse53)) (.cse42 (<= .cse55 ~c_t~0)) (.cse43 (<= .cse55 ~c~0)) (.cse44 (<= ~c_t~0 .cse55)) (.cse34 (not (= ~e_f~0 1))) (.cse39 (<= .cse55 ~data~0)) (.cse35 (not (= ~e_f~0 0))) (.cse40 (<= ~data~0 .cse55)) (.cse47 (<= ~c~0 .cse55)) (.cse54 (or (and .cse0 .cse2 .cse1 .cse24 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse0 .cse1 .cse2 .cse24 .cse36 .cse5 .cse6 .cse8 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33))) (.cse23 (= ~c2_st~0 0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse4 (= 0 ~wl_st~0)) (.cse7 (<= ~data~0 ~t_b~0)) (.cse9 (= 0 ~wb_st~0)) (.cse25 (= ~c2_pc~0 0)) (.cse10 (<= 2 ~e_wl~0)) (.cse27 (= ~c1_pc~0 0)) (.cse28 (= ~c1_st~0 0)) (.cse19 (= 0 ~wl_pc~0)) (.cse29 (= ~e_c~0 ~e_g~0)) (.cse31 (= ~e_g~0 ~e_f~0)) (.cse21 (= 0 ~wb_pc~0)) (.cse22 (= ~e_wl~0 ~e_c~0)) (.cse49 (<= .cse53 ~c_t~0)) (.cse38 (= 2 ~wl_pc~0)) (.cse37 (not (= ~e_c~0 0))) (.cse48 (= ~c_req_up~0 1)) (.cse45 (<= .cse53 ~data~0)) (.cse46 (<= ~data~0 .cse53)) (.cse51 (<= ~c_t~0 .cse53))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse9 .cse25 .cse13 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse10 .cse12 .cse13 .cse33 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse22) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse34 .cse2 .cse3 .cse4 .cse35 .cse36 .cse5 .cse26 .cse6 .cse8 .cse7 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse6 .cse14 .cse16 .cse32 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse6 .cse8 .cse14 .cse16 .cse32 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse38 .cse39 .cse2 .cse1 .cse24 .cse37 .cse36 .cse5 .cse8 .cse14 .cse40 .cse16 .cse18 .cse9 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse32 .cse25 .cse13 .cse33 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse34 .cse23 .cse2 .cse1 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse42 .cse43 .cse44 (or (and .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse46 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse39 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33)) .cse47) (and .cse0 .cse42 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse39 .cse14 .cse40 .cse16 .cse18 .cse28 .cse44 .cse41 .cse30) (and .cse0 .cse34 .cse23 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse8 .cse14 .cse16 .cse32 .cse18 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse49 .cse0 .cse38 .cse2 .cse24 .cse50 .cse37 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 .cse14 .cse45 .cse16 .cse46 .cse51 .cse52 .cse20 .cse41 .cse30) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse7 .cse8 .cse9 .cse25 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse32 .cse12 .cse13 .cse33 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30) (and .cse49 .cse0 .cse34 .cse38 .cse2 (<= .cse53 ~d~0) .cse50 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 (<= ~d~0 .cse53) .cse14 .cse45 .cse16 .cse18 .cse46 .cse51 .cse52 .cse20 .cse30) (and .cse10 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse38 .cse2 .cse1 .cse24 .cse3 .cse37 .cse36 .cse5 .cse7 .cse32 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse11 .cse12 .cse13 .cse33 .cse14 .cse16 .cse18 .cse28 .cse41 .cse30) (and .cse0 .cse38 .cse2 .cse1 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse16 .cse45 .cse18 .cse46 .cse9 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse1 .cse2 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse6 .cse14 .cse16 .cse18 .cse9 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse48 (and .cse42 .cse44 (or (and .cse0 .cse38 .cse39 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse18 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse46 .cse18 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33)))) (and .cse38 .cse54) (and .cse0 .cse34 .cse23 .cse2 .cse1 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse14 .cse16 .cse32 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse39 .cse1 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse14 .cse40 .cse16 .cse18 .cse9 .cse28 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse32 .cse25 .cse10 .cse13 .cse33 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse22) (and .cse0 .cse23 .cse42 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse8 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse39 .cse14 .cse40 .cse16 .cse18 .cse44 .cse41 .cse30) (and .cse0 .cse34 .cse2 .cse1 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse6 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and (<= ~d~0 .cse55) (<= .cse55 ~d~0) .cse42 .cse43 .cse44 (or (and .cse0 .cse34 .cse38 .cse2 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse18 .cse46 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse38 .cse39 .cse2 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33)) .cse47) (and .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse32 .cse25 .cse10 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30 .cse21) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse7 .cse8 .cse32 .cse25 .cse11 .cse12 .cse13 .cse33 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse3 .cse54 .cse7) (and .cse2 .cse24 (= ~e_wl~0 ~e_f~0) .cse37 .cse36 .cse5 .cse14 .cse16 .cse19 .cse10 .cse30 .cse12 .cse13) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse9 .cse25 .cse10 .cse13 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse21 .cse22) (and .cse49 .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse14 .cse45 .cse16 .cse46 .cse18 .cse51 .cse41 .cse30)))) [2019-11-15 23:40:22,968 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 228) no Hoare annotation was computed. [2019-11-15 23:40:22,968 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 100) no Hoare annotation was computed. [2019-11-15 23:40:22,968 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 67) no Hoare annotation was computed. [2019-11-15 23:40:22,968 INFO L443 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-11-15 23:40:22,969 INFO L439 ceAbstractionStarter]: At program point L225(lines 220 247) the Hoare annotation is: (let ((.cse28 (+ ~t_b~0 1))) (let ((.cse24 (= ~c1_st~0 0)) (.cse22 (<= .cse28 ~data~0)) (.cse23 (<= ~data~0 .cse28)) (.cse21 (= 2 ~wl_pc~0)) (.cse10 (<= 2 ~c2_st~0)) (.cse25 (= ~e_f~0 ~wl_st~0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (not (= ~e_f~0 1))) (.cse26 (= ~c2_st~0 0)) (.cse3 (= ~processed~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse4 (<= 2 ~wl_st~0)) (.cse5 (not (= ~e_c~0 0))) (.cse6 (not (= ~e_f~0 0))) (.cse9 (= 1 ~wl_pc~0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse11 (<= 2 ~c1_st~0)) (.cse12 (not (= ~e_g~0 0))) (.cse13 (= ~c1_i~0 1)) (.cse14 (<= 2 ~r_st~0)) (.cse15 (<= 2 ~e_wl~0)) (.cse16 (= ~c1_pc~0 1)) (.cse17 (not (= ~e_e~0 1))) (.cse18 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0)) (.cse20 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse21 .cse22 .cse3 .cse2 .cse4 .cse5 .cse7 .cse8 .cse10 .cse12 .cse23 .cse13 .cse14 .cse24 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse26 .cse21 .cse22 .cse3 .cse2 .cse4 .cse5 .cse7 .cse8 .cse11 .cse12 .cse23 .cse13 .cse14 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20) (let ((.cse27 (+ ~t_b~0 2))) (and .cse0 .cse21 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (<= .cse27 ~data~0) .cse14 (<= ~data~0 .cse27) .cse16 .cse17 .cse25 .cse18 .cse19 .cse20)) (and .cse2 .cse4 (= ~e_wl~0 ~e_f~0) .cse5 .cse7 .cse8 .cse12 .cse13 (= 0 ~wl_pc~0) .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse26 .cse3 .cse2 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2019-11-15 23:40:22,969 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-11-15 23:40:22,969 INFO L439 ceAbstractionStarter]: At program point L60(lines 55 125) the Hoare annotation is: (let ((.cse0 (+ ~t_b~0 2))) (let ((.cse1 (<= .cse0 ~data~0)) (.cse2 (<= ~data~0 .cse0)) (.cse3 (= 2 ~wl_pc~0)) (.cse4 (not (= ~e_f~0 0))) (.cse5 (let ((.cse11 (<= 2 ~c2_st~0)) (.cse21 (= ~c1_st~0 0)) (.cse7 (= ~c2_pc~0 1)) (.cse8 (not (= ~e_f~0 1))) (.cse22 (= ~c2_st~0 0)) (.cse9 (and (and (and (not (= ~e_g~0 0)) (= ~c2_i~0 1) (<= ~r_i~0 0)) (not (= ~e_e~0 0))) (not (= ~e_c~0 0)))) (.cse10 (= ~wb_i~0 1)) (.cse12 (<= 2 ~c1_st~0)) (.cse13 (= ~c1_i~0 1)) (.cse14 (<= 2 ~wb_st~0)) (.cse15 (<= 2 ~r_st~0)) (.cse16 (<= ~c_req_up~0 0)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~e_e~0 1))) (.cse19 (not (= ~e_g~0 1))) (.cse20 (= 1 ~wb_pc~0))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse8 .cse22 .cse9 .cse10 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse8 .cse22 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))))) (or (and (<= .cse0 ~c_t~0) .cse1 .cse2 (<= ~c_t~0 .cse0) .cse3 (<= ~d~0 .cse0) (<= ~c~0 .cse0) (<= .cse0 ~d~0) (<= .cse0 ~c~0) .cse4 .cse5) (let ((.cse6 (+ ~t_b~0 1))) (and (<= ~d~0 .cse6) (<= .cse6 ~d~0) (<= .cse6 ~c_t~0) (<= .cse6 ~c~0) (<= ~c_t~0 .cse6) (or (and .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ~data~0 .cse6) .cse3 (<= .cse6 ~data~0) .cse4 .cse5)) (<= ~c~0 .cse6)))))) [2019-11-15 23:40:22,970 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,970 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:40:22,970 INFO L443 ceAbstractionStarter]: For program point L524-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,971 INFO L439 ceAbstractionStarter]: At program point L326(lines 288 386) the Hoare annotation is: (let ((.cse26 (= 1 ~wl_pc~0)) (.cse17 (= ~e_e~0 ~e_f~0)) (.cse0 (= ~c2_pc~0 1)) (.cse1 (= ~processed~0 0)) (.cse2 (= ~wb_i~0 1)) (.cse24 (<= 2 ~wl_st~0)) (.cse36 (not (= ~e_e~0 0))) (.cse5 (= ~c2_i~0 1)) (.cse6 (<= 2 ~c2_st~0)) (.cse8 (<= 2 ~c1_st~0)) (.cse14 (not (= ~e_g~0 0))) (.cse15 (= ~e_e~0 ~e_c~0)) (.cse16 (= ~c1_i~0 1)) (.cse32 (<= 2 ~wb_st~0)) (.cse18 (<= 2 ~r_st~0)) (.cse20 (<= ~c_req_up~0 0)) (.cse11 (= ~c1_pc~0 1)) (.cse41 (= ~e_f~0 ~wl_st~0)) (.cse30 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_g~0 1))) (.cse13 (<= ~r_i~0 0)) (.cse33 (= 1 ~wb_pc~0)) (.cse55 (+ ~t_b~0 1)) (.cse53 (+ ~t_b~0 2))) (let ((.cse49 (<= .cse53 ~c_t~0)) (.cse50 (<= .cse53 ~c~0)) (.cse51 (<= ~c_t~0 .cse53)) (.cse52 (<= ~c~0 .cse53)) (.cse48 (= ~c_req_up~0 1)) (.cse42 (<= .cse55 ~c_t~0)) (.cse43 (<= .cse55 ~c~0)) (.cse44 (<= ~c_t~0 .cse55)) (.cse45 (<= .cse53 ~data~0)) (.cse46 (<= ~data~0 .cse53)) (.cse34 (not (= ~e_f~0 1))) (.cse38 (= 2 ~wl_pc~0)) (.cse39 (<= .cse55 ~data~0)) (.cse35 (not (= ~e_f~0 0))) (.cse40 (<= ~data~0 .cse55)) (.cse47 (<= ~c~0 .cse55)) (.cse54 (or (and .cse0 .cse2 .cse1 .cse24 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse0 .cse1 .cse2 .cse24 .cse36 .cse5 .cse6 .cse8 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33))) (.cse37 (not (= ~e_c~0 0))) (.cse23 (= ~c2_st~0 0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse4 (= 0 ~wl_st~0)) (.cse7 (<= ~data~0 ~t_b~0)) (.cse9 (= 0 ~wb_st~0)) (.cse25 (= ~c2_pc~0 0)) (.cse10 (<= 2 ~e_wl~0)) (.cse27 (= ~c1_pc~0 0)) (.cse28 (= ~c1_st~0 0)) (.cse19 (= 0 ~wl_pc~0)) (.cse29 (= ~e_c~0 ~e_g~0)) (.cse31 (= ~e_g~0 ~e_f~0)) (.cse21 (= 0 ~wb_pc~0)) (.cse22 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse9 .cse25 .cse13 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse10 .cse12 .cse13 .cse33 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse22) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse34 .cse2 .cse3 .cse4 .cse35 .cse36 .cse5 .cse26 .cse6 .cse8 .cse7 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse6 .cse14 .cse16 .cse32 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse6 .cse8 .cse14 .cse16 .cse32 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse38 .cse39 .cse2 .cse1 .cse24 .cse37 .cse36 .cse5 .cse8 .cse14 .cse40 .cse16 .cse18 .cse9 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse5 .cse7 .cse32 .cse25 .cse13 .cse33 .cse26 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse31) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse34 .cse23 .cse2 .cse1 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse42 .cse43 .cse44 (or (and .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse46 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse39 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse20 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33)) .cse47) (and .cse0 .cse42 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse39 .cse14 .cse40 .cse16 .cse18 .cse28 .cse44 .cse41 .cse30) (and .cse0 .cse34 .cse23 .cse2 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse8 .cse14 .cse16 .cse32 .cse18 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse49 .cse0 .cse38 .cse2 .cse24 .cse50 .cse37 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 .cse14 .cse45 .cse16 .cse46 .cse51 .cse52 .cse20 .cse41 .cse30) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse7 .cse8 .cse9 .cse25 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21) (and .cse0 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse32 .cse12 .cse13 .cse33 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30) (and .cse49 .cse0 .cse34 .cse38 .cse2 (<= .cse53 ~d~0) .cse50 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse32 .cse11 .cse12 .cse13 .cse33 (<= ~d~0 .cse53) .cse14 .cse45 .cse16 .cse18 .cse46 .cse51 .cse52 .cse20 .cse30) (and .cse10 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse38 .cse2 .cse1 .cse24 .cse3 .cse37 .cse36 .cse5 .cse7 .cse32 (<= ~data~0 ULTIMATE.start_write_loop_~t~0) (<= ULTIMATE.start_write_loop_~t~0 ~data~0) .cse11 .cse12 .cse13 .cse33 .cse14 .cse16 .cse18 .cse28 .cse41 .cse30) (and .cse0 .cse38 .cse2 .cse1 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse16 .cse45 .cse18 .cse46 .cse9 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse1 .cse2 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse6 .cse14 .cse16 .cse18 .cse9 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse48 (and .cse42 .cse44 (or (and .cse0 .cse38 .cse39 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse18 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse46 .cse18 .cse11 .cse41 .cse30 .cse12 .cse13 .cse33)))) (and .cse38 .cse54) (and .cse0 .cse34 .cse23 .cse2 .cse1 .cse24 .cse37 .cse35 .cse26 .cse36 .cse5 .cse14 .cse16 .cse32 .cse18 .cse28 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse38 .cse39 .cse1 .cse2 .cse24 .cse37 .cse36 .cse5 .cse6 .cse14 .cse40 .cse16 .cse18 .cse9 .cse28 .cse11 .cse30 .cse41 .cse12 .cse13 .cse33) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse32 .cse25 .cse10 .cse13 .cse33 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse22) (and .cse0 .cse23 .cse42 .cse38 .cse2 .cse24 .cse37 .cse36 .cse5 .cse8 .cse32 .cse11 .cse48 .cse12 .cse13 .cse33 .cse39 .cse14 .cse40 .cse16 .cse18 .cse44 .cse41 .cse30) (and .cse0 .cse34 .cse2 .cse1 .cse24 .cse37 .cse35 .cse36 .cse5 .cse26 .cse6 .cse8 .cse14 .cse16 .cse18 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse33) (and (<= ~d~0 .cse55) (<= .cse55 ~d~0) .cse42 .cse43 .cse44 (or (and .cse0 .cse34 .cse38 .cse2 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse14 .cse45 .cse16 .cse32 .cse18 .cse46 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33) (and .cse0 .cse34 .cse38 .cse39 .cse2 .cse4 .cse37 .cse35 .cse36 .cse5 .cse6 .cse8 .cse14 .cse40 .cse16 .cse32 .cse18 .cse20 .cse11 .cse30 .cse12 .cse13 .cse33)) .cse47) (and .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse32 .cse25 .cse10 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse36 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse26 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30 .cse21) (and .cse23 .cse2 .cse1 .cse24 .cse3 .cse36 .cse5 .cse7 .cse8 .cse32 .cse25 .cse11 .cse12 .cse13 .cse33 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse3 .cse54 .cse7) (and .cse2 .cse24 (= ~e_wl~0 ~e_f~0) .cse37 .cse36 .cse5 .cse14 .cse16 .cse19 .cse10 .cse30 .cse12 .cse13) (and .cse23 .cse2 .cse1 .cse3 .cse4 .cse5 .cse7 .cse9 .cse25 .cse10 .cse13 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse20 .cse31 .cse21 .cse22)))) [2019-11-15 23:40:22,971 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 309) no Hoare annotation was computed. [2019-11-15 23:40:22,972 INFO L439 ceAbstractionStarter]: At program point L194-1(lines 175 215) the Hoare annotation is: (let ((.cse43 (+ ~t_b~0 2)) (.cse42 (+ ~t_b~0 1)) (.cse9 (= 1 ~wl_pc~0)) (.cse29 (= ~e_e~0 ~e_f~0)) (.cse0 (= ~c2_pc~0 1)) (.cse2 (= ~processed~0 0)) (.cse3 (= ~wb_i~0 1)) (.cse4 (<= 2 ~wl_st~0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~c2_i~0 1)) (.cse23 (<= 2 ~c1_st~0)) (.cse10 (not (= ~e_g~0 0))) (.cse33 (= ~e_e~0 ~e_c~0)) (.cse11 (= ~c1_i~0 1)) (.cse28 (<= 2 ~wb_st~0)) (.cse12 (<= 2 ~r_st~0)) (.cse31 (<= ~c_req_up~0 0)) (.cse16 (= ~c1_pc~0 1)) (.cse26 (= ~e_f~0 ~wl_st~0)) (.cse17 (not (= ~e_e~0 1))) (.cse18 (not (= ~e_g~0 1))) (.cse19 (<= ~r_i~0 0)) (.cse20 (= 1 ~wb_pc~0))) (let ((.cse21 (or (and .cse2 (and .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse33 .cse11 .cse28 .cse29 .cse12 .cse31 .cse16 .cse17 .cse18 .cse19 .cse20) .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse23 .cse10 .cse33 .cse11 .cse28 .cse12 .cse31 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20))) (.cse1 (not (= ~e_f~0 1))) (.cse6 (not (= ~e_f~0 0))) (.cse27 (<= ~t_b~0 ~data~0)) (.cse37 (= 0 ~wl_st~0)) (.cse13 (= 0 ~wb_st~0)) (.cse15 (<= 2 ~e_wl~0)) (.cse14 (= ~c1_st~0 0)) (.cse38 (= 0 ~wl_pc~0)) (.cse30 (= ~e_c~0 ~e_g~0)) (.cse32 (= ~e_g~0 ~e_f~0)) (.cse36 (= 0 ~wb_pc~0)) (.cse39 (= ~e_wl~0 ~e_c~0)) (.cse34 (= ~c1_pc~0 0)) (.cse35 (<= ~data~0 ~t_b~0)) (.cse40 (<= .cse42 ~data~0)) (.cse41 (<= ~data~0 .cse42)) (.cse22 (= 2 ~wl_pc~0)) (.cse5 (not (= ~e_c~0 0))) (.cse24 (<= .cse43 ~data~0)) (.cse25 (<= ~data~0 .cse43))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse22 .cse3 .cse2 .cse4 .cse5 .cse7 .cse8 .cse23 .cse10 .cse11 .cse24 .cse12 .cse25 .cse13 .cse16 .cse17 .cse26 .cse18 .cse19 .cse20) (and .cse2 .cse27 (and (or (and .cse3 .cse4 .cse8 .cse9 .cse11 .cse28 .cse29 .cse12 .cse14 .cse30 .cse31 .cse32 .cse18 .cse19 .cse20) (and .cse0 .cse3 .cse4 .cse9 .cse8 .cse10 .cse33 .cse11 .cse29 .cse28 .cse12 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20)) .cse34) .cse6 .cse35) (and .cse2 .cse27 (and (or (and .cse0 .cse3 .cse4 .cse9 .cse7 .cse8 .cse10 .cse33 .cse11 .cse29 .cse12 .cse13 .cse14 .cse31 .cse17 .cse36 .cse18 .cse19) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse30 .cse31 .cse32 .cse36 .cse18 .cse19)) .cse34) .cse35) (and .cse21 .cse15) (and .cse2 .cse15 .cse27 (and .cse3 .cse37 .cse8 .cse10 .cse33 .cse11 .cse29 .cse12 .cse13 .cse38 .cse31 .cse16 .cse36 .cse18 .cse19 .cse39) .cse35 .cse23) (and (and .cse34 (or (and .cse0 .cse3 .cse37 .cse8 .cse10 .cse33 .cse11 .cse29 .cse28 .cse12 .cse14 .cse38 .cse31 .cse18 .cse19 .cse39 .cse20) (and .cse3 .cse37 .cse8 .cse11 .cse28 .cse29 .cse12 .cse14 .cse38 .cse30 .cse31 .cse32 .cse19 .cse39 .cse20))) .cse2 .cse15 .cse27 .cse35) (and .cse0 .cse22 .cse40 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse41 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse26 .cse18 .cse19 .cse20) (and .cse21 .cse27 .cse35) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse23 .cse10 .cse11 .cse28 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse3 .cse4 (= ~e_wl~0 ~e_f~0) .cse5 .cse7 .cse8 .cse10 .cse11 .cse38 .cse15 .cse17 .cse18 .cse19) (and .cse2 .cse3 .cse4 .cse27 .cse7 .cse8 .cse35 .cse23 .cse13 .cse16 .cse18 .cse19 .cse9 .cse10 .cse33 .cse11 .cse29 .cse12 .cse31 .cse17 .cse36) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse28 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (and .cse3 .cse37 .cse8 .cse10 .cse33 .cse11 .cse28 .cse29 .cse12 .cse38 .cse31 .cse16 .cse18 .cse19 .cse39 .cse20) .cse2 .cse15 .cse27 .cse35 .cse23) (and .cse2 .cse27 (and (or (and .cse0 .cse3 .cse37 .cse8 .cse10 .cse33 .cse11 .cse29 .cse12 .cse13 .cse14 .cse38 .cse15 .cse31 .cse36 .cse18 .cse19 .cse39) (and .cse3 .cse37 .cse8 .cse13 .cse15 .cse19 .cse11 .cse29 .cse12 .cse14 .cse38 .cse30 .cse31 .cse32 .cse36 .cse39)) .cse34) .cse35) (and (<= .cse42 ~c_t~0) (or (and .cse0 .cse22 .cse40 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse10 .cse41 .cse11 .cse28 .cse12 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse22 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse10 .cse11 .cse24 .cse28 .cse12 .cse25 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20)) (<= ~c_t~0 .cse42) (= ~c_req_up~0 1))))) [2019-11-15 23:40:22,972 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 66) no Hoare annotation was computed. [2019-11-15 23:40:22,972 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 673) no Hoare annotation was computed. [2019-11-15 23:40:22,973 INFO L443 ceAbstractionStarter]: For program point L624-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,973 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 367) no Hoare annotation was computed. [2019-11-15 23:40:22,973 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,973 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 464) no Hoare annotation was computed. [2019-11-15 23:40:22,974 INFO L439 ceAbstractionStarter]: At program point L262(lines 255 272) the Hoare annotation is: (let ((.cse19 (+ ~t_b~0 2))) (let ((.cse12 (= 0 ~wb_st~0)) (.cse22 (<= .cse19 ~data~0)) (.cse23 (<= ~data~0 .cse19)) (.cse20 (= 2 ~wl_pc~0)) (.cse8 (<= 2 ~c2_st~0)) (.cse24 (<= ~c_req_up~0 0)) (.cse9 (<= 2 ~c1_st~0)) (.cse0 (= ~c2_pc~0 1)) (.cse26 (= ~c2_st~0 0)) (.cse1 (= ~wb_i~0 1)) (.cse2 (= ~processed~0 0)) (.cse3 (<= 2 ~wl_st~0)) (.cse4 (not (= ~e_c~0 0))) (.cse7 (= 1 ~wl_pc~0)) (.cse5 (not (= ~e_e~0 0))) (.cse6 (= ~c2_i~0 1)) (.cse10 (not (= ~e_g~0 0))) (.cse11 (= ~c1_i~0 1)) (.cse21 (<= 2 ~wb_st~0)) (.cse25 (= ~c1_st~0 0)) (.cse13 (<= 2 ~e_wl~0)) (.cse14 (= ~c1_pc~0 1)) (.cse15 (= ~e_f~0 ~wl_st~0)) (.cse16 (not (= ~e_g~0 1))) (.cse17 (<= ~r_i~0 0)) (.cse18 (= 1 ~wb_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (<= .cse19 ~c_t~0) .cse0 .cse20 .cse1 (<= .cse19 ~d~0) .cse3 (<= .cse19 ~c~0) .cse4 .cse5 .cse6 .cse8 .cse9 .cse21 .cse14 .cse16 .cse17 .cse18 (<= ~d~0 .cse19) .cse10 .cse22 .cse11 .cse23 (<= ~c_t~0 .cse19) (<= ~c~0 .cse19) .cse24 .cse15) (and .cse10 .cse11 (= 0 ~wl_pc~0) .cse1 .cse3 .cse13 (= ~e_wl~0 ~e_f~0) .cse4 .cse5 .cse6 .cse16 .cse17) (and .cse0 (not (= ~e_f~0 1)) .cse1 .cse3 .cse4 (not (= ~e_f~0 0)) .cse7 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse21 .cse13 .cse14 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5 .cse6 .cse8 .cse10 .cse11 .cse21 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse26 .cse2 .cse1 .cse3 .cse4 .cse7 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse27 (+ ~t_b~0 1))) (and (<= ~d~0 .cse27) (<= .cse27 ~d~0) (<= .cse27 ~c_t~0) (<= .cse27 ~c~0) (<= ~c_t~0 .cse27) (or (and .cse0 .cse20 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse22 .cse11 .cse21 .cse23 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse20 (<= .cse27 ~data~0) .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (<= ~data~0 .cse27) .cse11 .cse21 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18)) (<= ~c~0 .cse27))) (and .cse0 .cse26 .cse1 .cse3 .cse4 .cse7 .cse5 .cse6 .cse9 .cse10 .cse11 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6 .cse10 .cse11 .cse21 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2019-11-15 23:40:22,974 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 308) no Hoare annotation was computed. [2019-11-15 23:40:22,974 INFO L443 ceAbstractionStarter]: For program point L263(lines 255 272) no Hoare annotation was computed. [2019-11-15 23:40:22,974 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2019-11-15 23:40:22,974 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 197 205) no Hoare annotation was computed. [2019-11-15 23:40:22,974 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 139) no Hoare annotation was computed. [2019-11-15 23:40:22,974 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:40:22,975 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 672) no Hoare annotation was computed. [2019-11-15 23:40:22,975 INFO L443 ceAbstractionStarter]: For program point L495(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,975 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,975 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 337) no Hoare annotation was computed. [2019-11-15 23:40:22,975 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 268) no Hoare annotation was computed. [2019-11-15 23:40:22,975 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 202) no Hoare annotation was computed. [2019-11-15 23:40:22,975 INFO L443 ceAbstractionStarter]: For program point L496(lines 496 500) no Hoare annotation was computed. [2019-11-15 23:40:22,976 INFO L439 ceAbstractionStarter]: At program point L232-1(lines 220 247) the Hoare annotation is: (let ((.cse44 (+ ~t_b~0 1))) (let ((.cse16 (= ~e_c~0 ~e_g~0)) (.cse18 (= ~e_g~0 ~e_f~0)) (.cse40 (not (= ~e_f~0 1))) (.cse41 (not (= ~e_f~0 0))) (.cse10 (= ~c1_pc~0 0)) (.cse21 (= ~c2_pc~0 1)) (.cse22 (<= .cse44 ~c_t~0)) (.cse23 (= 2 ~wl_pc~0)) (.cse25 (not (= ~e_c~0 0))) (.cse38 (<= 2 ~c2_st~0)) (.cse29 (= ~c_req_up~0 1)) (.cse31 (= 1 ~wb_pc~0)) (.cse32 (<= .cse44 ~data~0)) (.cse34 (<= ~data~0 .cse44)) (.cse14 (= ~c1_st~0 0)) (.cse35 (<= ~c_t~0 .cse44)) (.cse36 (= ~e_f~0 ~wl_st~0)) (.cse24 (<= 2 ~wl_st~0)) (.cse26 (not (= ~e_e~0 0))) (.cse42 (= 1 ~wl_pc~0)) (.cse37 (not (= ~e_e~0 1))) (.cse0 (= ~c2_st~0 0)) (.cse1 (= ~wb_i~0 1)) (.cse2 (= ~processed~0 0)) (.cse3 (<= ~t_b~0 ~data~0)) (.cse4 (= 0 ~wl_st~0)) (.cse5 (= ~c2_i~0 1)) (.cse6 (<= ~data~0 ~t_b~0)) (.cse27 (<= 2 ~c1_st~0)) (.cse7 (= ~c2_pc~0 0)) (.cse8 (<= 2 ~e_wl~0)) (.cse28 (= ~c1_pc~0 1)) (.cse30 (not (= ~e_g~0 1))) (.cse9 (<= ~r_i~0 0)) (.cse33 (not (= ~e_g~0 0))) (.cse39 (= ~e_e~0 ~e_c~0)) (.cse11 (= ~c1_i~0 1)) (.cse12 (= ~e_e~0 ~e_f~0)) (.cse13 (<= 2 ~r_st~0)) (.cse15 (= 0 ~wl_pc~0)) (.cse17 (<= ~c_req_up~0 0)) (.cse19 (= 0 ~wb_pc~0)) (.cse20 (= ~e_wl~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse22 .cse23 .cse1 .cse24 .cse25 .cse26 .cse5 .cse27 .cse28 .cse29 .cse30 .cse9 .cse31 .cse32 .cse33 .cse34 .cse11 .cse13 .cse35 .cse36 .cse37) (and .cse21 .cse2 .cse1 .cse3 .cse4 .cse5 .cse38 .cse6 .cse27 .cse8 .cse28 .cse30 .cse9 .cse33 .cse39 .cse11 .cse12 .cse13 .cse15 .cse17 .cse19 .cse20) (and .cse21 .cse40 .cse1 .cse24 .cse25 .cse41 .cse42 .cse26 .cse5 .cse38 .cse27 .cse33 .cse11 .cse13 .cse8 .cse28 .cse37 .cse30 .cse9 .cse31) (and .cse21 .cse1 .cse2 .cse24 .cse3 .cse26 .cse5 .cse38 .cse6 .cse30 .cse9 .cse42 .cse10 .cse33 .cse39 .cse11 .cse12 .cse13 .cse14 .cse17 .cse37 .cse19) (let ((.cse43 (+ ~t_b~0 2))) (and .cse21 (<= .cse43 ~c_t~0) .cse23 .cse1 .cse24 .cse25 .cse26 .cse5 .cse38 .cse27 .cse28 .cse29 .cse30 .cse9 .cse31 .cse33 .cse11 (<= .cse43 ~data~0) .cse13 (<= ~data~0 .cse43) (<= ~c_t~0 .cse43) .cse36 .cse37)) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse7 .cse9 .cse42 .cse10 .cse33 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse37 .cse18 .cse19) (and .cse21 .cse40 .cse0 .cse1 .cse24 .cse25 .cse41 .cse42 .cse26 .cse5 .cse27 .cse33 .cse11 .cse13 .cse8 .cse28 .cse37 .cse30 .cse9 .cse31) (and .cse21 .cse40 .cse1 .cse24 .cse25 .cse41 .cse42 .cse26 .cse5 .cse38 .cse33 .cse11 .cse13 .cse14 .cse8 .cse28 .cse37 .cse30 .cse9 .cse31) (and .cse1 .cse24 (= ~e_wl~0 ~e_f~0) .cse25 .cse26 .cse5 .cse33 .cse11 .cse15 .cse8 .cse37 .cse30 .cse9) (and .cse21 .cse2 .cse1 .cse24 .cse3 .cse26 .cse5 .cse38 .cse6 .cse27 .cse28 .cse30 .cse9 .cse42 .cse33 .cse39 .cse11 .cse12 .cse13 .cse17 .cse37 .cse19) (and .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse38 .cse6 .cse8 .cse30 .cse9 .cse10 .cse33 .cse39 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse1 .cse24 .cse25 .cse26 .cse5 .cse38 .cse28 .cse29 .cse30 .cse9 .cse31 .cse32 .cse33 .cse34 .cse11 .cse13 .cse14 .cse35 .cse36 .cse37) (and .cse0 .cse2 .cse1 .cse24 .cse3 .cse26 .cse5 .cse6 .cse27 .cse7 .cse28 .cse30 .cse9 .cse42 .cse33 .cse39 .cse11 .cse12 .cse13 .cse17 .cse37 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse28 .cse30 .cse9 .cse33 .cse39 .cse11 .cse12 .cse13 .cse15 .cse17 .cse19 .cse20)))) [2019-11-15 23:40:22,976 INFO L443 ceAbstractionStarter]: For program point L629-1(lines 535 675) no Hoare annotation was computed. [2019-11-15 23:40:22,976 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 408) no Hoare annotation was computed. [2019-11-15 23:40:22,977 INFO L443 ceAbstractionStarter]: For program point L398-2(lines 396 680) no Hoare annotation was computed. [2019-11-15 23:40:22,977 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 307) no Hoare annotation was computed. [2019-11-15 23:40:22,977 INFO L443 ceAbstractionStarter]: For program point L233(line 233) no Hoare annotation was computed. [2019-11-15 23:40:22,977 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 138) no Hoare annotation was computed. [2019-11-15 23:40:23,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:40:23 BoogieIcfgContainer [2019-11-15 23:40:23,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:40:23,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:40:23,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:40:23,160 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:40:23,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:39:13" (3/4) ... [2019-11-15 23:40:23,164 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:40:23,179 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 23:40:23,180 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:40:23,335 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_43d89778-842e-4ca4-ae5b-d25fe69b6dc6/bin/uautomizer/witness.graphml [2019-11-15 23:40:23,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:40:23,336 INFO L168 Benchmark]: Toolchain (without parser) took 70793.47 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 946.1 MB in the beginning and 1.4 GB in the end (delta: -462.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-11-15 23:40:23,337 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:40:23,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:40:23,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.86 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-15 23:40:23,338 INFO L168 Benchmark]: Boogie Preprocessor took 46.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:40:23,338 INFO L168 Benchmark]: RCFGBuilder took 591.16 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:40:23,339 INFO L168 Benchmark]: TraceAbstraction took 69489.14 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -421.5 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-15 23:40:23,339 INFO L168 Benchmark]: Witness Printer took 175.66 ms. Allocated memory is still 4.2 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 86.4 MB). Peak memory consumption was 86.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:40:23,341 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 443.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.86 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 46.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 591.16 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: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69489.14 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -421.5 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 175.66 ms. Allocated memory is still 4.2 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 86.4 MB). Peak memory consumption was 86.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1))) || (2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (c_req_up == 1 && (t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (2 == wl_pc && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1))) || ((t_b <= data && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && 2 <= r_st) && c_t <= t_b + 2) && e_f == wl_st) && !(e_e == 1)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && r_i <= 0) && !(e_g == 1)) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1))) || (((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && r_i <= 0) && !(e_g == 1)) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && 2 <= e_wl) && r_i <= 0) && !(e_g == 1)) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && r_i <= 0) && !(e_g == 1)) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && !(e_e == 1)) && 0 == wb_pc) - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))) || ((t_b <= data && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (c_req_up == 1 && (t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (2 == wl_pc && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && 2 <= r_st) && c_t <= t_b + 2) && e_f == wl_st) && !(e_e == 1)) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || (((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st)) || (((((((((((!(e_g == 0) && c1_i == 1) && 0 == wl_pc) && wb_i == 1) && 2 <= wl_st) && 2 <= e_wl) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((c2_pc == 1 && c2_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || (((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || (((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((c2_pc == 1 && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && e_wl == e_c)) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((t_b + 2 <= c_t && t_b + 2 <= data) && data <= t_b + 2) && c_t <= t_b + 2) && 2 == wl_pc) && d <= t_b + 2) && c <= t_b + 2) && t_b + 2 <= d) && t_b + 2 <= c) && !(e_f == 0)) && ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && 2 <= c2_st) && 2 <= c1_st) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && 2 <= c2_st) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && 2 <= c1_st) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc))) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((t_b + 2 <= data && data <= t_b + 2) && 2 == wl_pc) && !(e_f == 0)) && ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && 2 <= c2_st) && 2 <= c1_st) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && 2 <= c2_st) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && 2 <= c1_st) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc))) || ((((data <= t_b + 1 && 2 == wl_pc) && t_b + 1 <= data) && !(e_f == 0)) && ((((((((((((((((c2_pc == 1 && !(e_f == 1)) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && 2 <= c2_st) && 2 <= c1_st) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && 2 <= c2_st) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc)) || (((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && 2 <= c1_st) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc))))) && c <= t_b + 1) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && e_wl == e_c) || ((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 2 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && c2_pc == 0) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1))) || (2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (c_req_up == 1 && (t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (2 == wl_pc && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1))) || ((t_b <= data && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && e_wl == e_c) - InvariantResult [Line: 579]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c2_pc == 0 && processed == 0) && t_b <= data) && data <= t_b) && (((((((((((((((c2_st == 0 && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (2 == wl_pc && (((processed == 0 && 2 <= c2_st) && (((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((c2_pc == 0 && processed == 0) && 2 <= e_wl) && t_b <= data) && ((((((((((((((c2_st == 0 && wb_i == 1) && 0 == wl_st) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && 1 == wb_pc) && data <= t_b)) || ((t_b <= data && (((processed == 0 && 2 <= c2_st) && (((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || ((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (2 <= e_wl && (((processed == 0 && 2 <= c2_st) && (((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((processed == 0 && 2 <= e_wl) && t_b <= data) && ((((((((((((((c2_pc == 1 && wb_i == 1) && 0 == wl_st) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && 2 <= c2_st) && data <= t_b)) || (((t_b + 1 <= c_t && ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || (((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c_t <= t_b + 1) && c_req_up == 1)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && processed == 0) && t_b <= data) && !(e_f == 0)) && 2 <= c2_st) && data <= t_b)) || ((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1))) || (2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (c_req_up == 1 && (t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (2 == wl_pc && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1))) || ((t_b <= data && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && 2 <= r_st) && c_t <= t_b + 2) && e_f == wl_st) && !(e_e == 1)) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: (((((((((((((c2_st == 0 && wb_i == 1) && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && c2_i == 1) && c1_i == 1) && e_e == e_f) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && e_g == e_f) && r_i <= 0) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && e_wl == e_c) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((processed == 0 && (((((((((((((((wb_i == 1 && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 2 <= c1_st) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && 2 == wl_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((processed == 0 && t_b <= data) && (((((((((((((((wb_i == 1 && 2 <= wl_st) && c2_i == 1) && 1 == wl_pc) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && 1 == wl_pc) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && c1_pc == 0) && !(e_f == 0)) && data <= t_b)) || (((processed == 0 && t_b <= data) && ((((((((((((((((((c2_pc == 1 && wb_i == 1) && 2 <= wl_st) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) || (((((((((((((((wb_i == 1 && 2 <= wl_st) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0)) && c1_pc == 0) && data <= t_b)) || ((((processed == 0 && (((((((((((((((wb_i == 1 && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 2 <= c1_st) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && 2 <= e_wl)) || (((((processed == 0 && 2 <= e_wl) && t_b <= data) && ((((((((((((((wb_i == 1 && 0 == wl_st) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && 0 == wl_pc) && c_req_up <= 0) && c1_pc == 1) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && data <= t_b) && 2 <= c1_st)) || (((((c1_pc == 0 && (((((((((((((((((c2_pc == 1 && wb_i == 1) && 0 == wl_st) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && 1 == wb_pc) || ((((((((((((((wb_i == 1 && 0 == wl_st) && c2_i == 1) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && r_i <= 0) && e_wl == e_c) && 1 == wb_pc))) && processed == 0) && 2 <= e_wl) && t_b <= data) && data <= t_b)) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((processed == 0 && (((((((((((((((wb_i == 1 && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 2 <= c1_st) || ((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) && t_b <= data) && data <= t_b)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((processed == 0 && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((wb_i == 1 && 0 == wl_st) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) && 1 == wb_pc) && processed == 0) && 2 <= e_wl) && t_b <= data) && data <= t_b) && 2 <= c1_st)) || (((processed == 0 && t_b <= data) && ((((((((((((((((((c2_pc == 1 && wb_i == 1) && 0 == wl_st) && c2_i == 1) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 0 == wl_pc) && 2 <= e_wl) && c_req_up <= 0) && 0 == wb_pc) && !(e_g == 1)) && r_i <= 0) && e_wl == e_c) || (((((((((((((((wb_i == 1 && 0 == wl_st) && c2_i == 1) && 0 == wb_st) && 2 <= e_wl) && r_i <= 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && e_wl == e_c)) && c1_pc == 0) && data <= t_b)) || (((t_b + 1 <= c_t && ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || (((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c_t <= t_b + 1) && c_req_up == 1) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && t_b <= data) && 0 == wl_st) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && data <= t_b) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && e_c == e_g) && c_req_up <= 0) && !(e_e == 1)) && e_g == e_f)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((t_b + 1 <= c_t && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || (((((((((((((((((((((((c2_pc == 1 && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && t_b + 2 <= c) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && e_f == wl_st) && !(e_e == 1))) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 0 == wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 2 <= wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1))) || ((((((((((((((((((((((((((((t_b + 2 <= c_t && c2_pc == 1) && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && t_b + 2 <= d) && t_b + 2 <= c) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && d <= t_b + 2) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= r_st) && data <= t_b + 2) && c_t <= t_b + 2) && c <= t_b + 2) && c_req_up <= 0) && !(e_e == 1))) || (2 <= e_wl && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && 2 <= e_wl) && !(e_g == 1)) && r_i <= 0) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && c_req_up <= 0) && 0 == wb_pc) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && data <= t) && t <= data) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && c1_st == 0) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && t_b + 2 <= data) && 2 <= r_st) && data <= t_b + 2) && 0 == wb_st) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (c_req_up == 1 && (t_b + 1 <= c_t && c_t <= t_b + 1) && (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && data <= t_b + 2) && 2 <= r_st) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (2 == wl_pc && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && c2_st == 0) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && 1 == wl_pc) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c1_st == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_pc == 1 && 2 == wl_pc) && t_b + 1 <= data) && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && c1_st == 0) && c1_pc == 1) && !(e_e == 1)) && e_f == wl_st) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && 1 == wb_pc) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && e_wl == e_c)) || (((((((((((((((((((((((c2_pc == 1 && c2_st == 0) && t_b + 1 <= c_t) && 2 == wl_pc) && wb_i == 1) && 2 <= wl_st) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && c_req_up == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && t_b + 1 <= data) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= r_st) && c_t <= t_b + 1) && e_f == wl_st) && !(e_e == 1))) || (((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && c1_i == 1) && 2 <= r_st) && 0 == wb_st) && 2 <= e_wl) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc)) || ((((((d <= t_b + 1 && t_b + 1 <= d) && t_b + 1 <= c_t) && t_b + 1 <= c) && c_t <= t_b + 1) && (((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && t_b + 2 <= data) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && data <= t_b + 2) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) || ((((((((((((((((((((((c2_pc == 1 && !(e_f == 1)) && 2 == wl_pc) && t_b + 1 <= data) && wb_i == 1) && 0 == wl_st) && !(e_c == 0)) && !(e_f == 0)) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && data <= t_b + 1) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && c <= t_b + 1)) || ((((((((((((((((((((((c2_st == 0 && processed == 0) && wb_i == 1) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && 2 <= e_wl) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && 0 == wl_pc) && c_req_up <= 0) && e_wl == e_c)) || ((((((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && data <= t_b) && 0 == wb_st) && !(e_g == 1)) && r_i <= 0) && 1 == wl_pc) && c1_pc == 0) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && c_req_up <= 0) && !(e_e == 1)) && 0 == wb_pc)) || ((((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && 2 <= wl_st) && t_b <= data) && !(e_e == 0)) && c2_i == 1) && data <= t_b) && 2 <= c1_st) && 2 <= wb_st) && c2_pc == 0) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1))) || ((t_b <= data && (((((((((((((((((((((c2_pc == 1 && wb_i == 1) && processed == 0) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && 2 <= wb_st) && c1_pc == 1) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc) && 1 == wl_pc) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c_req_up <= 0) && !(e_e == 1)) || (((((((((((((((((((c2_pc == 1 && processed == 0) && wb_i == 1) && 2 <= wl_st) && !(e_e == 0)) && c2_i == 1) && 2 <= c2_st) && 2 <= c1_st) && !(e_g == 0)) && e_e == e_c) && c1_i == 1) && 2 <= wb_st) && 2 <= r_st) && c_req_up <= 0) && c1_pc == 1) && e_f == wl_st) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0) && 1 == wb_pc))) && data <= t_b)) || ((((((((((((wb_i == 1 && 2 <= wl_st) && e_wl == e_f) && !(e_c == 0)) && !(e_e == 0)) && c2_i == 1) && !(e_g == 0)) && c1_i == 1) && 0 == wl_pc) && 2 <= e_wl) && !(e_e == 1)) && !(e_g == 1)) && r_i <= 0)) || (((((((((((((((((((((c2_st == 0 && wb_i == 1) && processed == 0) && t_b <= data) && 0 == wl_st) && c2_i == 1) && data <= t_b) && 0 == wb_st) && c2_pc == 0) && 2 <= e_wl) && r_i <= 0) && c1_pc == 0) && c1_i == 1) && e_e == e_f) && 2 <= r_st) && c1_st == 0) && 0 == wl_pc) && e_c == e_g) && c_req_up <= 0) && e_g == e_f) && 0 == wb_pc) && e_wl == e_c) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((t_b + 2 <= data && data <= t_b + 2) && 2 == wl_pc) && ((((2 <= wb_st && ((((((((((c2_pc == 1 && c1_i == 1) && !(e_f == 1)) && c2_st == 0) && 2 <= r_st) && c1_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) || ((2 <= wb_st && (((((((((c2_pc == 1 && c1_i == 1) && !(e_f == 1)) && c2_st == 0) && 2 <= r_st) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) && 2 <= c1_st)) || (((2 <= wb_st && ((((((((c2_pc == 1 && c1_i == 1) && !(e_f == 1)) && 2 <= r_st) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) && 2 <= c2_st) && 2 <= c1_st)) || ((2 <= wb_st && (((((((((c2_pc == 1 && c1_i == 1) && !(e_f == 1)) && 2 <= r_st) && c1_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) && 2 <= c2_st))) && !(e_f == 0)) || ((((data <= t_b + 1 && 2 == wl_pc) && t_b + 1 <= data) && ((((2 <= wb_st && ((((((((((c2_pc == 1 && c1_i == 1) && !(e_f == 1)) && c2_st == 0) && 2 <= r_st) && c1_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) || ((2 <= wb_st && (((((((((c2_pc == 1 && c1_i == 1) && !(e_f == 1)) && c2_st == 0) && 2 <= r_st) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) && 2 <= c1_st)) || (((2 <= wb_st && ((((((((c2_pc == 1 && c1_i == 1) && !(e_f == 1)) && 2 <= r_st) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) && 2 <= c2_st) && 2 <= c1_st)) || ((2 <= wb_st && (((((((((c2_pc == 1 && c1_i == 1) && !(e_f == 1)) && 2 <= r_st) && c1_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && c1_pc == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wb_pc) && 2 <= c2_st))) && !(e_f == 0))) || (((((((((((c2_pc == 1 && 2 <= wb_st) && ((!(e_f == 1) && c_req_up <= 0) && c1_pc == 1) && ((((((e_e == e_c && c1_i == 1) && c2_st == 0) && 2 <= r_st) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wl_pc) && 2 <= c1_st) && 1 == wb_pc) || ((((c2_pc == 1 && ((!(e_f == 1) && c_req_up <= 0) && (((((((e_e == e_c && c1_i == 1) && c2_st == 0) && 2 <= r_st) && c1_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && !(e_e == 1)) && !(e_g == 1)) && c1_pc == 1) && 2 <= wb_st) && 1 == wl_pc) && 1 == wb_pc)) || (((((c2_pc == 1 && 2 <= wb_st) && ((!(e_f == 1) && c_req_up <= 0) && c1_pc == 1) && ((((((e_e == e_c && c1_i == 1) && 2 <= r_st) && c1_st == 0) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wl_pc) && 2 <= c2_st) && 1 == wb_pc)) || ((((((c2_pc == 1 && 2 <= wb_st) && ((!(e_f == 1) && c_req_up <= 0) && c1_pc == 1) && (((((e_e == e_c && c1_i == 1) && 2 <= r_st) && (((!(e_g == 0) && c2_i == 1) && r_i <= 0) && !(e_e == 0)) && !(e_c == 0)) && wb_i == 1) && !(e_e == 1)) && !(e_g == 1)) && 1 == wl_pc) && 2 <= c2_st) && 2 <= c1_st) && 1 == wb_pc)) && t_b <= data) && !(e_f == 0)) && data <= t_b) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Result: SAFE, OverallTime: 69.2s, OverallIterations: 39, TraceHistogramMax: 9, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 44.8s, HoareTripleCheckerStatistics: 8551 SDtfs, 7312 SDslu, 8889 SDs, 0 SdLazy, 1078 SolverSat, 238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 565 GetRequests, 470 SyntacticMatches, 7 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16773occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 10550 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 1179 NumberOfFragments, 26610 HoareAnnotationTreeSize, 20 FomulaSimplifications, 367998 FormulaSimplificationTreeSizeReduction, 5.7s HoareSimplificationTime, 20 FomulaSimplificationsInter, 392496 FormulaSimplificationTreeSizeReductionInter, 39.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 4305 NumberOfCodeBlocks, 4305 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4264 ConstructedInterpolants, 0 QuantifiedInterpolants, 1525572 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1001 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 41 InterpolantComputations, 37 PerfectInterpolantSequences, 2029/2119 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...