./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/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 bb52621d262b2a79ebd79f9601fb8103d2f4f11e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:33:40,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:33:40,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:33:40,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:33:40,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:33:40,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:33:40,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:33:40,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:33:40,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:33:40,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:33:40,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:33:40,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:33:40,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:33:40,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:33:40,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:33:40,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:33:40,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:33:40,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:33:40,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:33:40,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:33:40,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:33:40,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:33:40,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:33:40,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:33:40,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:33:40,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:33:40,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:33:40,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:33:40,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:33:40,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:33:40,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:33:40,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:33:40,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:33:40,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:33:40,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:33:40,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:33:40,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:33:40,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:33:40,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:33:40,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:33:40,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:33:40,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:33:40,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:33:40,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:33:40,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:33:40,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:33:40,527 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:33:40,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:33:40,527 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:33:40,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:33:40,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:33:40,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:33:40,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:33:40,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:33:40,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:33:40,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:33:40,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:33:40,529 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:33:40,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:33:40,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:33:40,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:33:40,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:33:40,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:33:40,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:33:40,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:33:40,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:33:40,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:33:40,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:33:40,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:33:40,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:33:40,531 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_497ad1b5-86bc-4f4f-b7c5-4b286705573b/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 -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2019-11-20 03:33:40,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:33:40,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:33:40,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:33:40,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:33:40,685 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:33:40,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2019-11-20 03:33:40,737 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/data/6d30ae7bb/ef34868feaa94b38ab88a9e4a1c9cdea/FLAG0801745d0 [2019-11-20 03:33:41,151 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:33:41,151 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/sv-benchmarks/c/systemc/bist_cell.cil.c [2019-11-20 03:33:41,159 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/data/6d30ae7bb/ef34868feaa94b38ab88a9e4a1c9cdea/FLAG0801745d0 [2019-11-20 03:33:41,171 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/data/6d30ae7bb/ef34868feaa94b38ab88a9e4a1c9cdea [2019-11-20 03:33:41,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:33:41,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:33:41,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:33:41,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:33:41,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:33:41,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67969385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41, skipping insertion in model container [2019-11-20 03:33:41,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,188 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:33:41,214 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:33:41,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:33:41,504 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:33:41,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:33:41,584 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:33:41,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41 WrapperNode [2019-11-20 03:33:41,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:33:41,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:33:41,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:33:41,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:33:41,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:33:41,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:33:41,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:33:41,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:33:41,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... [2019-11-20 03:33:41,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:33:41,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:33:41,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:33:41,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:33:41,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:33:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:33:41,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:33:42,403 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:33:42,404 INFO L285 CfgBuilder]: Removed 64 assume(true) statements. [2019-11-20 03:33:42,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:33:42 BoogieIcfgContainer [2019-11-20 03:33:42,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:33:42,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:33:42,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:33:42,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:33:42,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:33:41" (1/3) ... [2019-11-20 03:33:42,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f47450b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:33:42, skipping insertion in model container [2019-11-20 03:33:42,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:41" (2/3) ... [2019-11-20 03:33:42,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f47450b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:33:42, skipping insertion in model container [2019-11-20 03:33:42,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:33:42" (3/3) ... [2019-11-20 03:33:42,413 INFO L109 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2019-11-20 03:33:42,421 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:33:42,428 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:33:42,439 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:33:42,468 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:33:42,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:33:42,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:33:42,469 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:33:42,469 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:33:42,469 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:33:42,469 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:33:42,469 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:33:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-20 03:33:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 03:33:42,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:42,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:42,496 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2019-11-20 03:33:42,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:42,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704895498] [2019-11-20 03:33:42,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:42,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704895498] [2019-11-20 03:33:42,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:42,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:42,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203626254] [2019-11-20 03:33:42,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:42,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:42,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:42,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:42,672 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2019-11-20 03:33:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:42,743 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2019-11-20 03:33:42,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:42,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 03:33:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:42,758 INFO L225 Difference]: With dead ends: 210 [2019-11-20 03:33:42,758 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 03:33:42,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 03:33:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 03:33:42,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 03:33:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2019-11-20 03:33:42,799 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2019-11-20 03:33:42,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:42,799 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2019-11-20 03:33:42,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2019-11-20 03:33:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 03:33:42,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:42,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:42,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2019-11-20 03:33:42,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:42,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232734290] [2019-11-20 03:33:42,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:42,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232734290] [2019-11-20 03:33:42,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:42,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:42,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269173746] [2019-11-20 03:33:42,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:42,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:42,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:42,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:42,894 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2019-11-20 03:33:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:42,926 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2019-11-20 03:33:42,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:42,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-20 03:33:42,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:42,929 INFO L225 Difference]: With dead ends: 199 [2019-11-20 03:33:42,929 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 03:33:42,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 03:33:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 03:33:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 03:33:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-11-20 03:33:42,943 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2019-11-20 03:33:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:42,943 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-11-20 03:33:42,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-11-20 03:33:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 03:33:42,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:42,946 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:42,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2019-11-20 03:33:42,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:42,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067562234] [2019-11-20 03:33:42,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:43,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067562234] [2019-11-20 03:33:43,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:43,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:43,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587285480] [2019-11-20 03:33:43,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:43,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:43,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:43,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,045 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-11-20 03:33:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:43,065 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2019-11-20 03:33:43,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:43,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-20 03:33:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:43,067 INFO L225 Difference]: With dead ends: 196 [2019-11-20 03:33:43,068 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 03:33:43,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 03:33:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 03:33:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 03:33:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2019-11-20 03:33:43,078 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2019-11-20 03:33:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:43,079 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2019-11-20 03:33:43,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2019-11-20 03:33:43,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-20 03:33:43,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:43,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:43,081 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:43,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2019-11-20 03:33:43,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:43,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593190441] [2019-11-20 03:33:43,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:43,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593190441] [2019-11-20 03:33:43,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:43,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:43,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87009789] [2019-11-20 03:33:43,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:43,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:43,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:43,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,130 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2019-11-20 03:33:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:43,158 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-11-20 03:33:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:43,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-20 03:33:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:43,160 INFO L225 Difference]: With dead ends: 193 [2019-11-20 03:33:43,160 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 03:33:43,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 03:33:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 03:33:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 03:33:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2019-11-20 03:33:43,170 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2019-11-20 03:33:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:43,171 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2019-11-20 03:33:43,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2019-11-20 03:33:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 03:33:43,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:43,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:43,173 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:43,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:43,173 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2019-11-20 03:33:43,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:43,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888828376] [2019-11-20 03:33:43,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:43,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888828376] [2019-11-20 03:33:43,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:43,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:43,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982686801] [2019-11-20 03:33:43,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:43,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:43,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,257 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2019-11-20 03:33:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:43,300 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2019-11-20 03:33:43,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:43,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 03:33:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:43,303 INFO L225 Difference]: With dead ends: 271 [2019-11-20 03:33:43,303 INFO L226 Difference]: Without dead ends: 191 [2019-11-20 03:33:43,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-20 03:33:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-11-20 03:33:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-20 03:33:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2019-11-20 03:33:43,336 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2019-11-20 03:33:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:43,337 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2019-11-20 03:33:43,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2019-11-20 03:33:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 03:33:43,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:43,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:43,343 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:43,344 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2019-11-20 03:33:43,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:43,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557901277] [2019-11-20 03:33:43,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:43,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557901277] [2019-11-20 03:33:43,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:43,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:43,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272930772] [2019-11-20 03:33:43,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:43,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:43,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:43,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,414 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 3 states. [2019-11-20 03:33:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:43,486 INFO L93 Difference]: Finished difference Result 536 states and 876 transitions. [2019-11-20 03:33:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:43,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 03:33:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:43,489 INFO L225 Difference]: With dead ends: 536 [2019-11-20 03:33:43,490 INFO L226 Difference]: Without dead ends: 371 [2019-11-20 03:33:43,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-20 03:33:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-11-20 03:33:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-20 03:33:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 590 transitions. [2019-11-20 03:33:43,518 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 590 transitions. Word has length 72 [2019-11-20 03:33:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:43,519 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 590 transitions. [2019-11-20 03:33:43,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 590 transitions. [2019-11-20 03:33:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 03:33:43,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:43,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:43,523 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:43,523 INFO L82 PathProgramCache]: Analyzing trace with hash 954019814, now seen corresponding path program 1 times [2019-11-20 03:33:43,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:43,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578632305] [2019-11-20 03:33:43,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:43,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578632305] [2019-11-20 03:33:43,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:43,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:43,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438465729] [2019-11-20 03:33:43,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:43,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:43,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:43,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,566 INFO L87 Difference]: Start difference. First operand 368 states and 590 transitions. Second operand 3 states. [2019-11-20 03:33:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:43,631 INFO L93 Difference]: Finished difference Result 697 states and 1126 transitions. [2019-11-20 03:33:43,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:43,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 03:33:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:43,635 INFO L225 Difference]: With dead ends: 697 [2019-11-20 03:33:43,635 INFO L226 Difference]: Without dead ends: 408 [2019-11-20 03:33:43,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-20 03:33:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-11-20 03:33:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 03:33:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 648 transitions. [2019-11-20 03:33:43,662 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 648 transitions. Word has length 72 [2019-11-20 03:33:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:43,664 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 648 transitions. [2019-11-20 03:33:43,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 648 transitions. [2019-11-20 03:33:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 03:33:43,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:43,667 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:43,668 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:43,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1501854766, now seen corresponding path program 1 times [2019-11-20 03:33:43,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:43,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999895535] [2019-11-20 03:33:43,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:43,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999895535] [2019-11-20 03:33:43,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:43,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:43,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933602082] [2019-11-20 03:33:43,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:43,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:43,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,767 INFO L87 Difference]: Start difference. First operand 408 states and 648 transitions. Second operand 3 states. [2019-11-20 03:33:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:43,844 INFO L93 Difference]: Finished difference Result 1166 states and 1860 transitions. [2019-11-20 03:33:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:43,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 03:33:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:43,852 INFO L225 Difference]: With dead ends: 1166 [2019-11-20 03:33:43,852 INFO L226 Difference]: Without dead ends: 805 [2019-11-20 03:33:43,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-20 03:33:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 802. [2019-11-20 03:33:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-11-20 03:33:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1252 transitions. [2019-11-20 03:33:43,891 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1252 transitions. Word has length 73 [2019-11-20 03:33:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:43,891 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1252 transitions. [2019-11-20 03:33:43,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1252 transitions. [2019-11-20 03:33:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 03:33:43,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:43,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:43,895 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:43,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:43,896 INFO L82 PathProgramCache]: Analyzing trace with hash -608368428, now seen corresponding path program 1 times [2019-11-20 03:33:43,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:43,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422006482] [2019-11-20 03:33:43,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:43,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422006482] [2019-11-20 03:33:43,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:43,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:43,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426554243] [2019-11-20 03:33:43,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:43,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:43,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:43,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:43,960 INFO L87 Difference]: Start difference. First operand 802 states and 1252 transitions. Second operand 3 states. [2019-11-20 03:33:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:44,032 INFO L93 Difference]: Finished difference Result 1533 states and 2406 transitions. [2019-11-20 03:33:44,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:44,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 03:33:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:44,039 INFO L225 Difference]: With dead ends: 1533 [2019-11-20 03:33:44,039 INFO L226 Difference]: Without dead ends: 926 [2019-11-20 03:33:44,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-20 03:33:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-20 03:33:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-20 03:33:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1426 transitions. [2019-11-20 03:33:44,079 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1426 transitions. Word has length 73 [2019-11-20 03:33:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:44,080 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1426 transitions. [2019-11-20 03:33:44,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1426 transitions. [2019-11-20 03:33:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 03:33:44,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:44,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:44,083 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash 778416982, now seen corresponding path program 1 times [2019-11-20 03:33:44,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:44,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078113442] [2019-11-20 03:33:44,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:44,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078113442] [2019-11-20 03:33:44,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:44,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:44,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013106060] [2019-11-20 03:33:44,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:44,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:44,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:44,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,128 INFO L87 Difference]: Start difference. First operand 926 states and 1426 transitions. Second operand 3 states. [2019-11-20 03:33:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:44,178 INFO L93 Difference]: Finished difference Result 1353 states and 2078 transitions. [2019-11-20 03:33:44,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:44,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 03:33:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:44,183 INFO L225 Difference]: With dead ends: 1353 [2019-11-20 03:33:44,183 INFO L226 Difference]: Without dead ends: 622 [2019-11-20 03:33:44,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-11-20 03:33:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-11-20 03:33:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-11-20 03:33:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2019-11-20 03:33:44,211 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 73 [2019-11-20 03:33:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:44,211 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2019-11-20 03:33:44,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2019-11-20 03:33:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 03:33:44,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:44,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:44,214 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash -936880108, now seen corresponding path program 1 times [2019-11-20 03:33:44,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:44,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119084437] [2019-11-20 03:33:44,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:44,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119084437] [2019-11-20 03:33:44,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:44,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:44,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077649287] [2019-11-20 03:33:44,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:44,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:44,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:44,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,252 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 3 states. [2019-11-20 03:33:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:44,299 INFO L93 Difference]: Finished difference Result 921 states and 1366 transitions. [2019-11-20 03:33:44,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:44,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 03:33:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:44,302 INFO L225 Difference]: With dead ends: 921 [2019-11-20 03:33:44,302 INFO L226 Difference]: Without dead ends: 442 [2019-11-20 03:33:44,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-20 03:33:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2019-11-20 03:33:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-11-20 03:33:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2019-11-20 03:33:44,324 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 73 [2019-11-20 03:33:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:44,324 INFO L462 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2019-11-20 03:33:44,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2019-11-20 03:33:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 03:33:44,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:44,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:44,327 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1482058010, now seen corresponding path program 1 times [2019-11-20 03:33:44,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:44,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424602384] [2019-11-20 03:33:44,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:44,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424602384] [2019-11-20 03:33:44,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:44,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:44,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529313601] [2019-11-20 03:33:44,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:44,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:44,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,377 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand 3 states. [2019-11-20 03:33:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:44,416 INFO L93 Difference]: Finished difference Result 617 states and 897 transitions. [2019-11-20 03:33:44,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:44,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-20 03:33:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:44,419 INFO L225 Difference]: With dead ends: 617 [2019-11-20 03:33:44,419 INFO L226 Difference]: Without dead ends: 344 [2019-11-20 03:33:44,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-20 03:33:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-11-20 03:33:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-20 03:33:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2019-11-20 03:33:44,435 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 74 [2019-11-20 03:33:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:44,436 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2019-11-20 03:33:44,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2019-11-20 03:33:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 03:33:44,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:44,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:44,438 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1686276329, now seen corresponding path program 1 times [2019-11-20 03:33:44,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:44,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083902424] [2019-11-20 03:33:44,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:44,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083902424] [2019-11-20 03:33:44,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:44,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:44,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151204281] [2019-11-20 03:33:44,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:44,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:44,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,474 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand 3 states. [2019-11-20 03:33:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:44,532 INFO L93 Difference]: Finished difference Result 922 states and 1324 transitions. [2019-11-20 03:33:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:44,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-20 03:33:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:44,536 INFO L225 Difference]: With dead ends: 922 [2019-11-20 03:33:44,536 INFO L226 Difference]: Without dead ends: 665 [2019-11-20 03:33:44,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-11-20 03:33:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2019-11-20 03:33:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-11-20 03:33:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 932 transitions. [2019-11-20 03:33:44,566 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 932 transitions. Word has length 74 [2019-11-20 03:33:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:44,566 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 932 transitions. [2019-11-20 03:33:44,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 932 transitions. [2019-11-20 03:33:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 03:33:44,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:44,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:44,573 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1715204629, now seen corresponding path program 1 times [2019-11-20 03:33:44,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:44,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078318239] [2019-11-20 03:33:44,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:44,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078318239] [2019-11-20 03:33:44,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:44,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:44,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268522165] [2019-11-20 03:33:44,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:44,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:44,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:44,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,604 INFO L87 Difference]: Start difference. First operand 662 states and 932 transitions. Second operand 3 states. [2019-11-20 03:33:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:44,663 INFO L93 Difference]: Finished difference Result 1151 states and 1632 transitions. [2019-11-20 03:33:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:44,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-20 03:33:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:44,668 INFO L225 Difference]: With dead ends: 1151 [2019-11-20 03:33:44,669 INFO L226 Difference]: Without dead ends: 782 [2019-11-20 03:33:44,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-11-20 03:33:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-11-20 03:33:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-11-20 03:33:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1082 transitions. [2019-11-20 03:33:44,708 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1082 transitions. Word has length 74 [2019-11-20 03:33:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:44,708 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1082 transitions. [2019-11-20 03:33:44,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1082 transitions. [2019-11-20 03:33:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 03:33:44,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:44,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:44,711 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:44,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash -328419219, now seen corresponding path program 1 times [2019-11-20 03:33:44,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:44,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323650766] [2019-11-20 03:33:44,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:44,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323650766] [2019-11-20 03:33:44,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:44,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:44,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048237757] [2019-11-20 03:33:44,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:44,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:44,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,753 INFO L87 Difference]: Start difference. First operand 782 states and 1082 transitions. Second operand 3 states. [2019-11-20 03:33:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:44,812 INFO L93 Difference]: Finished difference Result 1061 states and 1472 transitions. [2019-11-20 03:33:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:44,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-20 03:33:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:44,816 INFO L225 Difference]: With dead ends: 1061 [2019-11-20 03:33:44,816 INFO L226 Difference]: Without dead ends: 572 [2019-11-20 03:33:44,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-11-20 03:33:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-11-20 03:33:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-11-20 03:33:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 766 transitions. [2019-11-20 03:33:44,846 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 766 transitions. Word has length 74 [2019-11-20 03:33:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:44,846 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 766 transitions. [2019-11-20 03:33:44,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 766 transitions. [2019-11-20 03:33:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 03:33:44,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:44,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:44,848 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash -524997684, now seen corresponding path program 1 times [2019-11-20 03:33:44,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:44,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922985978] [2019-11-20 03:33:44,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:44,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922985978] [2019-11-20 03:33:44,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:44,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:44,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093838274] [2019-11-20 03:33:44,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:44,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,887 INFO L87 Difference]: Start difference. First operand 572 states and 766 transitions. Second operand 3 states. [2019-11-20 03:33:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:44,913 INFO L93 Difference]: Finished difference Result 741 states and 1005 transitions. [2019-11-20 03:33:44,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:44,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-20 03:33:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:44,916 INFO L225 Difference]: With dead ends: 741 [2019-11-20 03:33:44,916 INFO L226 Difference]: Without dead ends: 478 [2019-11-20 03:33:44,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-20 03:33:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2019-11-20 03:33:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-20 03:33:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 638 transitions. [2019-11-20 03:33:44,938 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 638 transitions. Word has length 75 [2019-11-20 03:33:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:44,939 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 638 transitions. [2019-11-20 03:33:44,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 638 transitions. [2019-11-20 03:33:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 03:33:44,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:44,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:44,941 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1795209225, now seen corresponding path program 1 times [2019-11-20 03:33:44,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:44,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819445080] [2019-11-20 03:33:44,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:44,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819445080] [2019-11-20 03:33:44,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:44,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:44,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623204032] [2019-11-20 03:33:44,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:44,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:44,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:44,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:44,974 INFO L87 Difference]: Start difference. First operand 478 states and 638 transitions. Second operand 3 states. [2019-11-20 03:33:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:45,070 INFO L93 Difference]: Finished difference Result 1220 states and 1622 transitions. [2019-11-20 03:33:45,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:45,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-20 03:33:45,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:45,077 INFO L225 Difference]: With dead ends: 1220 [2019-11-20 03:33:45,077 INFO L226 Difference]: Without dead ends: 909 [2019-11-20 03:33:45,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-20 03:33:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 906. [2019-11-20 03:33:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-20 03:33:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1184 transitions. [2019-11-20 03:33:45,122 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1184 transitions. Word has length 75 [2019-11-20 03:33:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:45,123 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1184 transitions. [2019-11-20 03:33:45,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1184 transitions. [2019-11-20 03:33:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 03:33:45,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:45,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:45,126 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash 810814329, now seen corresponding path program 1 times [2019-11-20 03:33:45,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:45,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715085488] [2019-11-20 03:33:45,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:45,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715085488] [2019-11-20 03:33:45,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:45,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:45,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107374564] [2019-11-20 03:33:45,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:45,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:45,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:45,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:45,163 INFO L87 Difference]: Start difference. First operand 906 states and 1184 transitions. Second operand 3 states. [2019-11-20 03:33:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:45,211 INFO L93 Difference]: Finished difference Result 1075 states and 1414 transitions. [2019-11-20 03:33:45,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:45,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-20 03:33:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:45,218 INFO L225 Difference]: With dead ends: 1075 [2019-11-20 03:33:45,218 INFO L226 Difference]: Without dead ends: 1072 [2019-11-20 03:33:45,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-11-20 03:33:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2019-11-20 03:33:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2019-11-20 03:33:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1410 transitions. [2019-11-20 03:33:45,266 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1410 transitions. Word has length 75 [2019-11-20 03:33:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:45,267 INFO L462 AbstractCegarLoop]: Abstraction has 1072 states and 1410 transitions. [2019-11-20 03:33:45,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1410 transitions. [2019-11-20 03:33:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 03:33:45,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:45,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:45,270 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:45,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:45,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1383852991, now seen corresponding path program 1 times [2019-11-20 03:33:45,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:45,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842185425] [2019-11-20 03:33:45,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:45,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-20 03:33:45,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842185425] [2019-11-20 03:33:45,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:45,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:45,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969025648] [2019-11-20 03:33:45,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:45,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:45,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:45,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:45,301 INFO L87 Difference]: Start difference. First operand 1072 states and 1410 transitions. Second operand 3 states. [2019-11-20 03:33:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:45,362 INFO L93 Difference]: Finished difference Result 1999 states and 2700 transitions. [2019-11-20 03:33:45,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:45,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-20 03:33:45,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:45,368 INFO L225 Difference]: With dead ends: 1999 [2019-11-20 03:33:45,368 INFO L226 Difference]: Without dead ends: 1006 [2019-11-20 03:33:45,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-20 03:33:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 940. [2019-11-20 03:33:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-20 03:33:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1246 transitions. [2019-11-20 03:33:45,419 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1246 transitions. Word has length 77 [2019-11-20 03:33:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:45,420 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1246 transitions. [2019-11-20 03:33:45,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1246 transitions. [2019-11-20 03:33:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 03:33:45,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:45,422 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 03:33:45,422 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1984147797, now seen corresponding path program 1 times [2019-11-20 03:33:45,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:45,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697063932] [2019-11-20 03:33:45,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:45,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697063932] [2019-11-20 03:33:45,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:45,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:33:45,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327569978] [2019-11-20 03:33:45,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:33:45,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:45,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:33:45,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:33:45,463 INFO L87 Difference]: Start difference. First operand 940 states and 1246 transitions. Second operand 4 states. [2019-11-20 03:33:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:45,530 INFO L93 Difference]: Finished difference Result 1579 states and 2134 transitions. [2019-11-20 03:33:45,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:33:45,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 03:33:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:45,535 INFO L225 Difference]: With dead ends: 1579 [2019-11-20 03:33:45,536 INFO L226 Difference]: Without dead ends: 940 [2019-11-20 03:33:45,537 INFO L630 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-20 03:33:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-20 03:33:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-20 03:33:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-20 03:33:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1240 transitions. [2019-11-20 03:33:45,597 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1240 transitions. Word has length 91 [2019-11-20 03:33:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:45,597 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1240 transitions. [2019-11-20 03:33:45,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:33:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1240 transitions. [2019-11-20 03:33:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 03:33:45,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:45,600 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 03:33:45,600 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:45,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:45,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1157899978, now seen corresponding path program 1 times [2019-11-20 03:33:45,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:45,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808846867] [2019-11-20 03:33:45,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:45,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808846867] [2019-11-20 03:33:45,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:45,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:33:45,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161857555] [2019-11-20 03:33:45,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:33:45,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:45,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:33:45,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:33:45,657 INFO L87 Difference]: Start difference. First operand 940 states and 1240 transitions. Second operand 4 states. [2019-11-20 03:33:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:45,744 INFO L93 Difference]: Finished difference Result 1579 states and 2122 transitions. [2019-11-20 03:33:45,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:33:45,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-20 03:33:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:45,750 INFO L225 Difference]: With dead ends: 1579 [2019-11-20 03:33:45,750 INFO L226 Difference]: Without dead ends: 940 [2019-11-20 03:33:45,751 INFO L630 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-20 03:33:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-20 03:33:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-20 03:33:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-20 03:33:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1234 transitions. [2019-11-20 03:33:45,829 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1234 transitions. Word has length 92 [2019-11-20 03:33:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:45,830 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1234 transitions. [2019-11-20 03:33:45,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:33:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1234 transitions. [2019-11-20 03:33:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 03:33:45,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:45,832 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 03:33:45,832 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:45,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:45,832 INFO L82 PathProgramCache]: Analyzing trace with hash 433852849, now seen corresponding path program 1 times [2019-11-20 03:33:45,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:45,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528209082] [2019-11-20 03:33:45,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:45,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528209082] [2019-11-20 03:33:45,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:45,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:45,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572731580] [2019-11-20 03:33:45,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:45,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:45,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:45,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:45,862 INFO L87 Difference]: Start difference. First operand 940 states and 1234 transitions. Second operand 3 states. [2019-11-20 03:33:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:45,964 INFO L93 Difference]: Finished difference Result 2176 states and 2914 transitions. [2019-11-20 03:33:45,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:45,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-20 03:33:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:45,972 INFO L225 Difference]: With dead ends: 2176 [2019-11-20 03:33:45,973 INFO L226 Difference]: Without dead ends: 1537 [2019-11-20 03:33:45,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2019-11-20 03:33:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 958. [2019-11-20 03:33:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-20 03:33:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1252 transitions. [2019-11-20 03:33:46,041 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1252 transitions. Word has length 93 [2019-11-20 03:33:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:46,042 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1252 transitions. [2019-11-20 03:33:46,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1252 transitions. [2019-11-20 03:33:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 03:33:46,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:46,044 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 03:33:46,044 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash 124550695, now seen corresponding path program 1 times [2019-11-20 03:33:46,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:46,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306952809] [2019-11-20 03:33:46,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:46,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306952809] [2019-11-20 03:33:46,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:46,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:33:46,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932683964] [2019-11-20 03:33:46,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:33:46,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:33:46,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:33:46,082 INFO L87 Difference]: Start difference. First operand 958 states and 1252 transitions. Second operand 4 states. [2019-11-20 03:33:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:46,156 INFO L93 Difference]: Finished difference Result 1591 states and 2098 transitions. [2019-11-20 03:33:46,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:33:46,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-20 03:33:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:46,161 INFO L225 Difference]: With dead ends: 1591 [2019-11-20 03:33:46,161 INFO L226 Difference]: Without dead ends: 934 [2019-11-20 03:33:46,162 INFO L630 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-20 03:33:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-20 03:33:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-11-20 03:33:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-11-20 03:33:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1198 transitions. [2019-11-20 03:33:46,224 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1198 transitions. Word has length 94 [2019-11-20 03:33:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:46,225 INFO L462 AbstractCegarLoop]: Abstraction has 934 states and 1198 transitions. [2019-11-20 03:33:46,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:33:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1198 transitions. [2019-11-20 03:33:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 03:33:46,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:46,227 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 03:33:46,227 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:46,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2108597088, now seen corresponding path program 1 times [2019-11-20 03:33:46,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:46,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701430920] [2019-11-20 03:33:46,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:46,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701430920] [2019-11-20 03:33:46,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:46,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:46,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580865231] [2019-11-20 03:33:46,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:46,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:46,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:46,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:46,254 INFO L87 Difference]: Start difference. First operand 934 states and 1198 transitions. Second operand 3 states. [2019-11-20 03:33:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:46,364 INFO L93 Difference]: Finished difference Result 2188 states and 2860 transitions. [2019-11-20 03:33:46,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:46,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-20 03:33:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:46,373 INFO L225 Difference]: With dead ends: 2188 [2019-11-20 03:33:46,373 INFO L226 Difference]: Without dead ends: 1555 [2019-11-20 03:33:46,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:46,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-20 03:33:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 958. [2019-11-20 03:33:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-20 03:33:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1222 transitions. [2019-11-20 03:33:46,448 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1222 transitions. Word has length 95 [2019-11-20 03:33:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:46,448 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1222 transitions. [2019-11-20 03:33:46,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1222 transitions. [2019-11-20 03:33:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 03:33:46,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:46,451 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 03:33:46,451 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:46,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:46,451 INFO L82 PathProgramCache]: Analyzing trace with hash -169435042, now seen corresponding path program 1 times [2019-11-20 03:33:46,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:46,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445842064] [2019-11-20 03:33:46,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:46,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445842064] [2019-11-20 03:33:46,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:46,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:46,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690871401] [2019-11-20 03:33:46,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:46,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:46,481 INFO L87 Difference]: Start difference. First operand 958 states and 1222 transitions. Second operand 3 states. [2019-11-20 03:33:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:46,614 INFO L93 Difference]: Finished difference Result 2220 states and 2810 transitions. [2019-11-20 03:33:46,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:46,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-20 03:33:46,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:46,622 INFO L225 Difference]: With dead ends: 2220 [2019-11-20 03:33:46,622 INFO L226 Difference]: Without dead ends: 1563 [2019-11-20 03:33:46,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-11-20 03:33:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2019-11-20 03:33:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-11-20 03:33:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1914 transitions. [2019-11-20 03:33:46,726 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1914 transitions. Word has length 95 [2019-11-20 03:33:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:46,726 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 1914 transitions. [2019-11-20 03:33:46,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2019-11-20 03:33:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 03:33:46,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:46,729 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:46,729 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2019-11-20 03:33:46,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:46,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108521405] [2019-11-20 03:33:46,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:46,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108521405] [2019-11-20 03:33:46,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644282307] [2019-11-20 03:33:46,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:33:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:46,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:33:46,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:33:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:46,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:33:46,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-20 03:33:47,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704097573] [2019-11-20 03:33:47,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:33:47,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:47,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:33:47,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:33:47,001 INFO L87 Difference]: Start difference. First operand 1560 states and 1914 transitions. Second operand 4 states. [2019-11-20 03:33:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:47,244 INFO L93 Difference]: Finished difference Result 2609 states and 3234 transitions. [2019-11-20 03:33:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:33:47,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 03:33:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:47,253 INFO L225 Difference]: With dead ends: 2609 [2019-11-20 03:33:47,253 INFO L226 Difference]: Without dead ends: 1906 [2019-11-20 03:33:47,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:33:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-11-20 03:33:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1610. [2019-11-20 03:33:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2019-11-20 03:33:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1982 transitions. [2019-11-20 03:33:47,410 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1982 transitions. Word has length 95 [2019-11-20 03:33:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:47,411 INFO L462 AbstractCegarLoop]: Abstraction has 1610 states and 1982 transitions. [2019-11-20 03:33:47,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:33:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1982 transitions. [2019-11-20 03:33:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 03:33:47,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:47,414 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:47,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:33:47,619 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2019-11-20 03:33:47,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:47,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603369312] [2019-11-20 03:33:47,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:47,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603369312] [2019-11-20 03:33:47,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:47,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:33:47,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938006368] [2019-11-20 03:33:47,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:33:47,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:33:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:47,650 INFO L87 Difference]: Start difference. First operand 1610 states and 1982 transitions. Second operand 3 states. [2019-11-20 03:33:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:47,821 INFO L93 Difference]: Finished difference Result 3706 states and 4622 transitions. [2019-11-20 03:33:47,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:33:47,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-20 03:33:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:47,835 INFO L225 Difference]: With dead ends: 3706 [2019-11-20 03:33:47,835 INFO L226 Difference]: Without dead ends: 2603 [2019-11-20 03:33:47,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:33:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-11-20 03:33:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1628. [2019-11-20 03:33:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-11-20 03:33:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2000 transitions. [2019-11-20 03:33:47,958 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2000 transitions. Word has length 95 [2019-11-20 03:33:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:47,958 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 2000 transitions. [2019-11-20 03:33:47,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:33:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2000 transitions. [2019-11-20 03:33:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 03:33:47,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:33:47,961 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:33:47,961 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:33:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:33:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2019-11-20 03:33:47,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:33:47,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777240553] [2019-11-20 03:33:47,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:33:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:33:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:33:47,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777240553] [2019-11-20 03:33:47,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:33:47,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:33:47,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396275582] [2019-11-20 03:33:47,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:33:48,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:33:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:33:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:33:48,000 INFO L87 Difference]: Start difference. First operand 1628 states and 2000 transitions. Second operand 4 states. [2019-11-20 03:33:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:33:48,083 INFO L93 Difference]: Finished difference Result 1970 states and 2418 transitions. [2019-11-20 03:33:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:33:48,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 03:33:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:33:48,084 INFO L225 Difference]: With dead ends: 1970 [2019-11-20 03:33:48,084 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:33:48,086 INFO L630 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-20 03:33:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:33:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:33:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:33:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:33:48,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-20 03:33:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:33:48,087 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:33:48,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:33:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:33:48,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:33:48,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:33:48,203 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-20 03:33:48,596 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-20 03:33:49,126 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-20 03:33:49,850 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-20 03:33:50,601 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-20 03:33:51,581 WARN L191 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-20 03:33:52,216 WARN L191 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-20 03:33:52,673 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-20 03:33:52,897 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-20 03:33:53,806 WARN L191 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-20 03:33:54,052 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-20 03:33:54,408 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-20 03:33:55,016 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-20 03:33:55,201 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-20 03:33:55,450 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-20 03:33:55,592 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-20 03:33:55,932 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-20 03:33:56,264 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-20 03:33:56,515 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-20 03:33:57,022 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-20 03:33:57,175 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-20 03:33:57,711 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-20 03:33:57,996 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-20 03:33:58,364 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-20 03:33:58,652 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-20 03:33:58,848 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-20 03:33:59,403 WARN L191 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-20 03:33:59,536 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-20 03:34:00,066 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-20 03:34:00,383 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-20 03:34:00,889 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-20 03:34:01,400 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-20 03:34:02,025 WARN L191 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-20 03:34:02,028 INFO L444 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2019-11-20 03:34:02,028 INFO L447 ceAbstractionStarter]: At program point L499(lines 483 501) the Hoare annotation is: true [2019-11-20 03:34:02,028 INFO L440 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-20 03:34:02,028 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 208) no Hoare annotation was computed. [2019-11-20 03:34:02,029 INFO L440 ceAbstractionStarter]: At program point L202-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (= 1 ~d1_req_up~0)) (.cse3 (<= 2 ~d0_ev~0)) (.cse4 (not (= ~z_req_up~0 1))) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (<= 2 ~b1_ev~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse14 (= 1 ~b1_req_up~0)) (.cse15 (= 1 ~d0_req_up~0)) (.cse16 (<= 2 ~z_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~b0_ev~0 0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~b0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2019-11-20 03:34:02,029 INFO L444 ceAbstractionStarter]: For program point L202-2(lines 202 208) no Hoare annotation was computed. [2019-11-20 03:34:02,029 INFO L440 ceAbstractionStarter]: At program point L202-3(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-20 03:34:02,029 INFO L444 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2019-11-20 03:34:02,029 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2019-11-20 03:34:02,029 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 105 115) no Hoare annotation was computed. [2019-11-20 03:34:02,029 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 177) no Hoare annotation was computed. [2019-11-20 03:34:02,030 INFO L444 ceAbstractionStarter]: For program point L172-2(lines 172 177) no Hoare annotation was computed. [2019-11-20 03:34:02,030 INFO L444 ceAbstractionStarter]: For program point L172-3(lines 172 177) no Hoare annotation was computed. [2019-11-20 03:34:02,030 INFO L444 ceAbstractionStarter]: For program point L172-5(lines 172 177) no Hoare annotation was computed. [2019-11-20 03:34:02,030 INFO L440 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-20 03:34:02,030 INFO L440 ceAbstractionStarter]: At program point L405(lines 389 407) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-20 03:34:02,030 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-11-20 03:34:02,030 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2019-11-20 03:34:02,031 INFO L444 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-20 03:34:02,031 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-11-20 03:34:02,031 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 147) no Hoare annotation was computed. [2019-11-20 03:34:02,031 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-11-20 03:34:02,031 INFO L444 ceAbstractionStarter]: For program point L142-2(lines 142 147) no Hoare annotation was computed. [2019-11-20 03:34:02,031 INFO L444 ceAbstractionStarter]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-11-20 03:34:02,031 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-20 03:34:02,031 INFO L444 ceAbstractionStarter]: For program point L142-3(lines 142 147) no Hoare annotation was computed. [2019-11-20 03:34:02,031 INFO L444 ceAbstractionStarter]: For program point L142-5(lines 142 147) no Hoare annotation was computed. [2019-11-20 03:34:02,032 INFO L440 ceAbstractionStarter]: At program point L209(lines 201 239) the Hoare annotation is: (let ((.cse12 (= ~b0_ev~0 0)) (.cse9 (<= 2 ~b1_ev~0)) (.cse19 (= ~b1_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (= 1 ~d1_req_up~0)) (.cse3 (<= 2 ~d0_ev~0)) (.cse4 (not (= ~z_req_up~0 1))) (.cse5 (<= 1 ~b0_val_t~0)) (.cse20 (<= 2 ~b0_ev~0)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (= 1 ~d0_req_up~0)) (.cse16 (<= ~b1_req_up~0 0)) (.cse17 (<= 2 ~z_ev~0)) (.cse18 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-11-20 03:34:02,032 INFO L440 ceAbstractionStarter]: At program point L209-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-20 03:34:02,032 INFO L444 ceAbstractionStarter]: For program point L276(line 276) no Hoare annotation was computed. [2019-11-20 03:34:02,032 INFO L444 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2019-11-20 03:34:02,032 INFO L444 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2019-11-20 03:34:02,032 INFO L444 ceAbstractionStarter]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2019-11-20 03:34:02,032 INFO L444 ceAbstractionStarter]: For program point L344-3(lines 343 371) no Hoare annotation was computed. [2019-11-20 03:34:02,033 INFO L440 ceAbstractionStarter]: At program point L245-1(lines 311 315) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 0)) (.cse11 (= ~b0_ev~0 0)) (.cse8 (= 0 ~d0_ev~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse7 (<= 1 ~d1_val~0)) (.cse9 (= 0 ~z_val_t~0)) (.cse10 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-20 03:34:02,033 INFO L444 ceAbstractionStarter]: For program point L311-4(lines 310 338) no Hoare annotation was computed. [2019-11-20 03:34:02,033 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-20 03:34:02,033 INFO L444 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2019-11-20 03:34:02,033 INFO L440 ceAbstractionStarter]: At program point L445(lines 491 497) the Hoare annotation is: (and (= ~z_val~0 0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0)) [2019-11-20 03:34:02,033 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-11-20 03:34:02,033 INFO L444 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2019-11-20 03:34:02,034 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2019-11-20 03:34:02,034 INFO L440 ceAbstractionStarter]: At program point L380-2(lines 344 348) the Hoare annotation is: (let ((.cse4 (<= 2 ~b0_ev~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse19 (= ~b0_ev~0 1)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (= 1 ~d0_ev~0)) (.cse8 (= 1 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-20 03:34:02,034 INFO L444 ceAbstractionStarter]: For program point L380-3(lines 380 384) no Hoare annotation was computed. [2019-11-20 03:34:02,034 INFO L440 ceAbstractionStarter]: At program point L380-5(lines 344 348) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~d0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-20 03:34:02,034 INFO L440 ceAbstractionStarter]: At program point L480(lines 451 482) the Hoare annotation is: (and (<= 0 ~z_val~0) (= 1 ~d1_req_up~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 2 ~d1_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (= 0 ~z_val_t~0) (<= ~z_val~0 0) (= 1 ~b0_req_up~0) (<= 1 ~d0_val_t~0) (= 1 ~b1_req_up~0) (= 1 ~d0_req_up~0) (<= 2 ~z_ev~0)) [2019-11-20 03:34:02,035 INFO L440 ceAbstractionStarter]: At program point L216(lines 201 239) the Hoare annotation is: (let ((.cse21 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b0_ev~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse19 (= ~b1_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (= 1 ~d1_req_up~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~d1_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse9 (= 0 ~d0_ev~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (= ~b0_ev~0 0)) (.cse13 (<= 1 ~d0_val~0)) (.cse14 (<= 1 ~d0_val_t~0)) (.cse15 (<= ~b0_req_up~0 0)) (.cse16 (<= ~b1_req_up~0 0)) (.cse17 (<= 2 ~z_ev~0)) (.cse18 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-11-20 03:34:02,035 INFO L440 ceAbstractionStarter]: At program point L216-1(lines 201 239) the Hoare annotation is: (let ((.cse8 (= 0 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse17 (<= 2 ~comp_m1_st~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse16 (<= 1 ~d1_val~0)) (.cse18 (= 0 ~z_val_t~0)) (.cse7 (<= ~z_val~0 0)) (.cse9 (<= 1 ~d0_val~0)) (.cse10 (<= 1 ~d0_val_t~0)) (.cse11 (<= ~b0_req_up~0 0)) (.cse12 (<= ~b1_req_up~0 0)) (.cse13 (<= 2 ~z_ev~0)) (.cse14 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse19 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-11-20 03:34:02,035 INFO L444 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2019-11-20 03:34:02,035 INFO L444 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2019-11-20 03:34:02,035 INFO L444 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2019-11-20 03:34:02,035 INFO L444 ceAbstractionStarter]: For program point L349-3(lines 343 371) no Hoare annotation was computed. [2019-11-20 03:34:02,036 INFO L444 ceAbstractionStarter]: For program point L316-3(lines 310 338) no Hoare annotation was computed. [2019-11-20 03:34:02,036 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-20 03:34:02,036 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:34:02,036 INFO L440 ceAbstractionStarter]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse4 (<= 2 ~b0_ev~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse19 (= ~b0_ev~0 1)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (= 1 ~d0_ev~0)) (.cse8 (= 1 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-20 03:34:02,036 INFO L440 ceAbstractionStarter]: At program point L119-1(lines 96 121) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~d0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-20 03:34:02,036 INFO L440 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-20 03:34:02,037 INFO L440 ceAbstractionStarter]: At program point L120(lines 93 122) the Hoare annotation is: (let ((.cse4 (<= 2 ~b0_ev~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse19 (= ~b0_ev~0 1)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (= 1 ~d0_ev~0)) (.cse8 (= 1 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-20 03:34:02,037 INFO L440 ceAbstractionStarter]: At program point L120-1(lines 93 122) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~d0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-20 03:34:02,037 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 192) no Hoare annotation was computed. [2019-11-20 03:34:02,037 INFO L444 ceAbstractionStarter]: For program point L187-2(lines 187 192) no Hoare annotation was computed. [2019-11-20 03:34:02,037 INFO L444 ceAbstractionStarter]: For program point L187-3(lines 187 192) no Hoare annotation was computed. [2019-11-20 03:34:02,037 INFO L444 ceAbstractionStarter]: For program point L187-5(lines 187 192) no Hoare annotation was computed. [2019-11-20 03:34:02,038 INFO L444 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2019-11-20 03:34:02,038 INFO L444 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2019-11-20 03:34:02,038 INFO L444 ceAbstractionStarter]: For program point L354-3(lines 343 371) no Hoare annotation was computed. [2019-11-20 03:34:02,038 INFO L444 ceAbstractionStarter]: For program point L321-3(lines 310 338) no Hoare annotation was computed. [2019-11-20 03:34:02,038 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2019-11-20 03:34:02,038 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:34:02,038 INFO L440 ceAbstractionStarter]: At program point L223(lines 201 239) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 0)) (.cse11 (= ~b0_ev~0 0)) (.cse8 (= 0 ~d0_ev~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse7 (<= 1 ~d1_val~0)) (.cse9 (= 0 ~z_val_t~0)) (.cse10 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-20 03:34:02,039 INFO L440 ceAbstractionStarter]: At program point L223-1(lines 201 239) the Hoare annotation is: (let ((.cse8 (= 0 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse17 (<= 2 ~comp_m1_st~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse16 (<= 1 ~d1_val~0)) (.cse18 (= 0 ~z_val_t~0)) (.cse7 (<= ~z_val~0 0)) (.cse9 (<= 1 ~d0_val~0)) (.cse10 (<= 1 ~d0_val_t~0)) (.cse11 (<= ~b0_req_up~0 0)) (.cse12 (<= ~b1_req_up~0 0)) (.cse13 (<= 2 ~z_ev~0)) (.cse14 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse19 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-11-20 03:34:02,039 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-11-20 03:34:02,039 INFO L444 ceAbstractionStarter]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-11-20 03:34:02,039 INFO L444 ceAbstractionStarter]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-11-20 03:34:02,039 INFO L444 ceAbstractionStarter]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-11-20 03:34:02,039 INFO L440 ceAbstractionStarter]: At program point L422-1(lines 340 444) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-20 03:34:02,039 INFO L444 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2019-11-20 03:34:02,039 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2019-11-20 03:34:02,039 INFO L444 ceAbstractionStarter]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2019-11-20 03:34:02,040 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 132) no Hoare annotation was computed. [2019-11-20 03:34:02,040 INFO L444 ceAbstractionStarter]: For program point L127-2(lines 127 132) no Hoare annotation was computed. [2019-11-20 03:34:02,040 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:34:02,040 INFO L444 ceAbstractionStarter]: For program point L127-3(lines 127 132) no Hoare annotation was computed. [2019-11-20 03:34:02,040 INFO L444 ceAbstractionStarter]: For program point L127-5(lines 127 132) no Hoare annotation was computed. [2019-11-20 03:34:02,040 INFO L447 ceAbstractionStarter]: At program point L491(lines 491 497) the Hoare annotation is: true [2019-11-20 03:34:02,040 INFO L444 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2019-11-20 03:34:02,040 INFO L444 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2019-11-20 03:34:02,040 INFO L444 ceAbstractionStarter]: For program point L359-3(lines 343 371) no Hoare annotation was computed. [2019-11-20 03:34:02,040 INFO L444 ceAbstractionStarter]: For program point L326-3(lines 310 338) no Hoare annotation was computed. [2019-11-20 03:34:02,041 INFO L444 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-11-20 03:34:02,041 INFO L444 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2019-11-20 03:34:02,041 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2019-11-20 03:34:02,041 INFO L444 ceAbstractionStarter]: For program point L97-1(lines 97 117) no Hoare annotation was computed. [2019-11-20 03:34:02,041 INFO L440 ceAbstractionStarter]: At program point L230(lines 245 249) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 0)) (.cse11 (= ~b0_ev~0 0)) (.cse8 (= 0 ~d0_ev~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse7 (<= 1 ~d1_val~0)) (.cse9 (= 0 ~z_val_t~0)) (.cse10 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-20 03:34:02,044 INFO L440 ceAbstractionStarter]: At program point L230-1(lines 198 240) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-20 03:34:02,044 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 03:34:02,045 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-20 03:34:02,045 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2019-11-20 03:34:02,045 INFO L440 ceAbstractionStarter]: At program point L331-1(lines 307 339) the Hoare annotation is: (let ((.cse4 (<= 2 ~b0_ev~0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse19 (= ~b0_ev~0 1)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (= 1 ~d0_ev~0)) (.cse8 (= 1 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse19 .cse5 .cse6 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-20 03:34:02,046 INFO L440 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-20 03:34:02,046 INFO L440 ceAbstractionStarter]: At program point L364-3(lines 340 372) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-20 03:34:02,046 INFO L440 ceAbstractionStarter]: At program point L331-3(lines 307 339) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ~d0_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2019-11-20 03:34:02,046 INFO L440 ceAbstractionStarter]: At program point L265-1(lines 257 267) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-20 03:34:02,047 INFO L440 ceAbstractionStarter]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse15 (<= 1 ~d1_val~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0))) (or (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 (= 0 ~z_val_t~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-20 03:34:02,047 INFO L440 ceAbstractionStarter]: At program point L266-1(lines 254 268) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-20 03:34:02,047 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2019-11-20 03:34:02,047 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 101 116) no Hoare annotation was computed. [2019-11-20 03:34:02,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:34:02 BoogieIcfgContainer [2019-11-20 03:34:02,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:34:02,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:34:02,123 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:34:02,124 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:34:02,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:33:42" (3/4) ... [2019-11-20 03:34:02,127 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:34:02,142 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 03:34:02,142 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:34:02,241 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_497ad1b5-86bc-4f4f-b7c5-4b286705573b/bin/uautomizer/witness.graphml [2019-11-20 03:34:02,241 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:34:02,243 INFO L168 Benchmark]: Toolchain (without parser) took 21068.23 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 582.5 MB). Free memory was 946.1 MB in the beginning and 1.5 GB in the end (delta: -537.5 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:34:02,243 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:34:02,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:34:02,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.29 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:34:02,244 INFO L168 Benchmark]: Boogie Preprocessor took 69.61 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:34:02,244 INFO L168 Benchmark]: RCFGBuilder took 676.12 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:34:02,245 INFO L168 Benchmark]: TraceAbstraction took 19716.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 444.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -434.2 MB). Peak memory consumption was 648.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:34:02,245 INFO L168 Benchmark]: Witness Printer took 118.20 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:34:02,247 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.29 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.61 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 676.12 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19716.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 444.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -434.2 MB). Peak memory consumption was 648.1 MB. Max. memory is 11.5 GB. * Witness Printer took 118.20 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && 1 == b0_req_up) && 1 <= d0_val_t) && 1 == b1_req_up) && 1 == d0_req_up) && 2 <= z_ev - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 483]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == d0_req_up) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == d0_req_up) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == d0_req_up) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == d0_req_up) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 1 == d0_req_up) && 2 <= z_ev) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 1 == d0_req_up) && 2 <= z_ev) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (z_val == 0 && b0_req_up <= 0) && b1_req_up <= 0 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 == b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 1 == d1_req_up) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 1 == d1_req_up) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Result: SAFE, OverallTime: 19.5s, OverallIterations: 28, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.9s, HoareTripleCheckerStatistics: 4818 SDtfs, 2658 SDslu, 3080 SDs, 0 SdLazy, 294 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1628occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 2531 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 366 NumberOfFragments, 5998 HoareAnnotationTreeSize, 33 FomulaSimplifications, 62407 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 33 FomulaSimplificationsInter, 32509 FormulaSimplificationTreeSizeReductionInter, 12.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2277 NumberOfCodeBlocks, 2277 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2248 ConstructedInterpolants, 0 QuantifiedInterpolants, 343948 SizeOfPredicates, 1 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 29 InterpolantComputations, 28 PerfectInterpolantSequences, 54/60 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...