java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:49:39,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:49:39,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:49:39,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:49:39,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:49:39,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:49:39,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:49:39,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:49:39,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:49:39,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:49:39,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:49:39,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:49:39,399 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:49:39,400 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:49:39,401 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:49:39,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:49:39,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:49:39,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:49:39,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:49:39,408 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:49:39,409 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:49:39,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:49:39,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:49:39,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:49:39,413 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:49:39,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:49:39,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:49:39,416 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:49:39,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:49:39,418 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:49:39,418 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:49:39,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:49:39,419 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:49:39,419 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:49:39,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:49:39,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:49:39,421 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:49:39,436 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:49:39,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:49:39,437 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:49:39,438 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:49:39,438 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:49:39,438 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:49:39,439 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:49:39,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:49:39,439 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:49:39,439 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:49:39,439 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:49:39,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:49:39,440 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:49:39,440 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:49:39,440 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:49:39,440 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:49:39,441 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:49:39,441 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:49:39,441 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:49:39,441 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:49:39,442 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:49:39,442 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:49:39,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:49:39,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:49:39,442 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:49:39,443 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:49:39,443 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:49:39,443 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:49:39,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:49:39,443 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:49:39,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:49:39,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:49:39,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:49:39,512 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:49:39,513 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:49:39,514 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-10-02 11:49:39,514 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-10-02 11:49:39,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:49:39,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:49:39,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:39,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:49:39,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:49:39,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... [2018-10-02 11:49:39,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... [2018-10-02 11:49:39,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:39,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:49:39,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:49:39,648 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:49:39,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... [2018-10-02 11:49:39,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... [2018-10-02 11:49:39,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... [2018-10-02 11:49:39,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... [2018-10-02 11:49:39,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... [2018-10-02 11:49:39,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... [2018-10-02 11:49:39,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... [2018-10-02 11:49:39,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:49:39,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:49:39,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:49:39,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:49:39,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:49:39,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:49:39,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:49:40,439 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:49:40,439 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:40 BoogieIcfgContainer [2018-10-02 11:49:40,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:49:40,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:49:40,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:49:40,446 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:49:40,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:39" (1/2) ... [2018-10-02 11:49:40,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adb974b and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:49:40, skipping insertion in model container [2018-10-02 11:49:40,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:40" (2/2) ... [2018-10-02 11:49:40,449 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-10-02 11:49:40,456 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:49:40,463 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:49:40,508 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:49:40,509 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:49:40,509 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:49:40,509 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:49:40,509 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:49:40,509 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:49:40,510 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:49:40,510 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:49:40,510 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:49:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-10-02 11:49:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:49:40,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:40,533 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:40,534 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:40,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:40,540 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-10-02 11:49:40,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:40,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:40,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:40,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:40,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:40,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:40,738 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-10-02 11:49:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:40,838 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-10-02 11:49:40,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:40,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-02 11:49:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:40,854 INFO L225 Difference]: With dead ends: 82 [2018-10-02 11:49:40,854 INFO L226 Difference]: Without dead ends: 47 [2018-10-02 11:49:40,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-02 11:49:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-02 11:49:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-02 11:49:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-10-02 11:49:40,901 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-10-02 11:49:40,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:40,902 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-10-02 11:49:40,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-10-02 11:49:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:49:40,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:40,903 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:40,904 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:40,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:40,904 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-10-02 11:49:40,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:40,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:40,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:40,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:40,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:40,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:40,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:40,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:40,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:40,967 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-10-02 11:49:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:41,039 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-10-02 11:49:41,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:41,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 11:49:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:41,041 INFO L225 Difference]: With dead ends: 98 [2018-10-02 11:49:41,041 INFO L226 Difference]: Without dead ends: 53 [2018-10-02 11:49:41,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-02 11:49:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-02 11:49:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-02 11:49:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-10-02 11:49:41,052 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-10-02 11:49:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:41,053 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-10-02 11:49:41,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-10-02 11:49:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:49:41,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:41,054 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:41,055 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:41,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:41,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-10-02 11:49:41,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:41,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:41,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:41,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:41,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:41,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:41,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:41,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:41,135 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-10-02 11:49:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:41,242 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-10-02 11:49:41,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:41,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 11:49:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:41,250 INFO L225 Difference]: With dead ends: 105 [2018-10-02 11:49:41,251 INFO L226 Difference]: Without dead ends: 59 [2018-10-02 11:49:41,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-02 11:49:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-02 11:49:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 11:49:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-10-02 11:49:41,272 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-10-02 11:49:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:41,272 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-10-02 11:49:41,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-10-02 11:49:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:49:41,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:41,277 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:41,277 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:41,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:41,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-10-02 11:49:41,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:41,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:41,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:41,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:41,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:41,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:41,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:41,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:41,393 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-10-02 11:49:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:41,519 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-10-02 11:49:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:41,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-02 11:49:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:41,521 INFO L225 Difference]: With dead ends: 122 [2018-10-02 11:49:41,521 INFO L226 Difference]: Without dead ends: 73 [2018-10-02 11:49:41,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-02 11:49:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-02 11:49:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-02 11:49:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-10-02 11:49:41,535 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-10-02 11:49:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:41,536 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-10-02 11:49:41,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-10-02 11:49:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:49:41,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:41,537 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:41,538 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:41,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-10-02 11:49:41,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:41,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:41,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:41,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:41,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:41,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:41,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:41,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:41,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:41,622 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-10-02 11:49:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:41,694 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-10-02 11:49:41,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:41,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-02 11:49:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:41,698 INFO L225 Difference]: With dead ends: 145 [2018-10-02 11:49:41,698 INFO L226 Difference]: Without dead ends: 104 [2018-10-02 11:49:41,699 INFO L605 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 [2018-10-02 11:49:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-02 11:49:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-02 11:49:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-02 11:49:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-10-02 11:49:41,722 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-10-02 11:49:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:41,723 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-10-02 11:49:41,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-10-02 11:49:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:49:41,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:41,724 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:41,725 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:41,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-10-02 11:49:41,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:41,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:41,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:41,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:41,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:41,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:41,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:41,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:41,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:41,781 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-10-02 11:49:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:41,922 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-10-02 11:49:41,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:41,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-02 11:49:41,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:41,924 INFO L225 Difference]: With dead ends: 235 [2018-10-02 11:49:41,925 INFO L226 Difference]: Without dead ends: 163 [2018-10-02 11:49:41,926 INFO L605 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 [2018-10-02 11:49:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-02 11:49:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-10-02 11:49:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-02 11:49:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-10-02 11:49:41,952 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-10-02 11:49:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:41,953 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-10-02 11:49:41,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-10-02 11:49:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 11:49:41,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:41,956 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:41,956 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:41,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-10-02 11:49:41,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:41,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 11:49:42,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:42,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:42,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:42,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:42,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:42,048 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-10-02 11:49:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:42,111 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-10-02 11:49:42,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:42,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-02 11:49:42,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:42,114 INFO L225 Difference]: With dead ends: 288 [2018-10-02 11:49:42,114 INFO L226 Difference]: Without dead ends: 164 [2018-10-02 11:49:42,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-02 11:49:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-02 11:49:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-02 11:49:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-10-02 11:49:42,136 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-10-02 11:49:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:42,136 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-10-02 11:49:42,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-10-02 11:49:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 11:49:42,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:42,139 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:42,139 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:42,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:42,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-10-02 11:49:42,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:42,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:42,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:42,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:42,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 11:49:42,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:42,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:42,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:42,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:42,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:42,200 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-10-02 11:49:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:42,286 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-10-02 11:49:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:42,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-02 11:49:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:42,288 INFO L225 Difference]: With dead ends: 312 [2018-10-02 11:49:42,289 INFO L226 Difference]: Without dead ends: 182 [2018-10-02 11:49:42,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-02 11:49:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-02 11:49:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-02 11:49:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-10-02 11:49:42,329 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-10-02 11:49:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:42,329 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-10-02 11:49:42,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-10-02 11:49:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 11:49:42,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:42,338 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:42,338 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:42,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-10-02 11:49:42,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:42,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:42,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:42,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:42,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:49:42,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:42,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:42,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:42,452 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-10-02 11:49:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:42,537 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-10-02 11:49:42,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:42,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-02 11:49:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:42,540 INFO L225 Difference]: With dead ends: 345 [2018-10-02 11:49:42,540 INFO L226 Difference]: Without dead ends: 177 [2018-10-02 11:49:42,541 INFO L605 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 [2018-10-02 11:49:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-02 11:49:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-02 11:49:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-02 11:49:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-10-02 11:49:42,560 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-10-02 11:49:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:42,561 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-10-02 11:49:42,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-10-02 11:49:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 11:49:42,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:42,564 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:42,564 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:42,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-10-02 11:49:42,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:42,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:49:42,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:42,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:42,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:42,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:42,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:42,680 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-10-02 11:49:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:42,794 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-10-02 11:49:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:42,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-02 11:49:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:42,796 INFO L225 Difference]: With dead ends: 335 [2018-10-02 11:49:42,796 INFO L226 Difference]: Without dead ends: 174 [2018-10-02 11:49:42,798 INFO L605 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 [2018-10-02 11:49:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-02 11:49:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-10-02 11:49:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-02 11:49:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-10-02 11:49:42,819 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-10-02 11:49:42,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:42,819 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-10-02 11:49:42,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-10-02 11:49:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 11:49:42,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:42,821 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:42,821 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:42,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:42,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-10-02 11:49:42,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:42,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:42,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:42,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:42,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:43,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:43,003 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:49:43,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:43,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-02 11:49:43,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:49:43,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-02 11:49:43,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:49:43,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:49:43,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:49:43,249 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 5 states. [2018-10-02 11:49:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:43,712 INFO L93 Difference]: Finished difference Result 451 states and 641 transitions. [2018-10-02 11:49:43,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:49:43,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-10-02 11:49:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:43,716 INFO L225 Difference]: With dead ends: 451 [2018-10-02 11:49:43,716 INFO L226 Difference]: Without dead ends: 293 [2018-10-02 11:49:43,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:49:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-02 11:49:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2018-10-02 11:49:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-02 11:49:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 388 transitions. [2018-10-02 11:49:43,771 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 388 transitions. Word has length 52 [2018-10-02 11:49:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:43,771 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 388 transitions. [2018-10-02 11:49:43,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:49:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 388 transitions. [2018-10-02 11:49:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 11:49:43,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:43,774 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:43,775 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:43,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash -784981334, now seen corresponding path program 1 times [2018-10-02 11:49:43,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:43,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:43,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:43,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:44,042 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-02 11:49:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 11:49:44,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:44,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:44,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:44,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:44,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:44,053 INFO L87 Difference]: Start difference. First operand 284 states and 388 transitions. Second operand 3 states. [2018-10-02 11:49:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:44,184 INFO L93 Difference]: Finished difference Result 726 states and 990 transitions. [2018-10-02 11:49:44,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:44,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-02 11:49:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:44,188 INFO L225 Difference]: With dead ends: 726 [2018-10-02 11:49:44,188 INFO L226 Difference]: Without dead ends: 486 [2018-10-02 11:49:44,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-02 11:49:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 410. [2018-10-02 11:49:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-02 11:49:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2018-10-02 11:49:44,249 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 52 [2018-10-02 11:49:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:44,249 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2018-10-02 11:49:44,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2018-10-02 11:49:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 11:49:44,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:44,251 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:44,252 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:44,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:44,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1664618796, now seen corresponding path program 1 times [2018-10-02 11:49:44,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:44,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:44,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:44,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-02 11:49:44,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:44,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:44,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:44,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:44,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:44,342 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand 3 states. [2018-10-02 11:49:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:44,521 INFO L93 Difference]: Finished difference Result 782 states and 1089 transitions. [2018-10-02 11:49:44,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:44,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-02 11:49:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:44,525 INFO L225 Difference]: With dead ends: 782 [2018-10-02 11:49:44,525 INFO L226 Difference]: Without dead ends: 404 [2018-10-02 11:49:44,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-02 11:49:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-10-02 11:49:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-02 11:49:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 556 transitions. [2018-10-02 11:49:44,583 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 556 transitions. Word has length 52 [2018-10-02 11:49:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:44,584 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 556 transitions. [2018-10-02 11:49:44,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 556 transitions. [2018-10-02 11:49:44,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-02 11:49:44,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:44,585 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:44,586 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:44,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:44,586 INFO L82 PathProgramCache]: Analyzing trace with hash -232860399, now seen corresponding path program 1 times [2018-10-02 11:49:44,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:44,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:44,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:44,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-02 11:49:44,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:44,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:44,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:44,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:44,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:44,648 INFO L87 Difference]: Start difference. First operand 404 states and 556 transitions. Second operand 3 states. [2018-10-02 11:49:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:44,864 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2018-10-02 11:49:44,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:44,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-10-02 11:49:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:44,866 INFO L225 Difference]: With dead ends: 581 [2018-10-02 11:49:44,866 INFO L226 Difference]: Without dead ends: 192 [2018-10-02 11:49:44,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-02 11:49:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2018-10-02 11:49:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-02 11:49:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2018-10-02 11:49:44,895 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 61 [2018-10-02 11:49:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:44,895 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2018-10-02 11:49:44,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2018-10-02 11:49:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-02 11:49:44,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:44,896 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:44,897 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:44,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:44,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-10-02 11:49:44,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:44,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:44,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 11:49:44,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:44,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:44,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:44,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:44,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:44,998 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 3 states. [2018-10-02 11:49:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:45,152 INFO L93 Difference]: Finished difference Result 430 states and 550 transitions. [2018-10-02 11:49:45,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:45,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-10-02 11:49:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:45,154 INFO L225 Difference]: With dead ends: 430 [2018-10-02 11:49:45,155 INFO L226 Difference]: Without dead ends: 273 [2018-10-02 11:49:45,155 INFO L605 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 [2018-10-02 11:49:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-02 11:49:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-10-02 11:49:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-02 11:49:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2018-10-02 11:49:45,198 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 75 [2018-10-02 11:49:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:45,198 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2018-10-02 11:49:45,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2018-10-02 11:49:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-02 11:49:45,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:45,200 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:45,200 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:45,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-10-02 11:49:45,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:45,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:45,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-02 11:49:45,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:45,715 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:49:45,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:45,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-02 11:49:45,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:49:45,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-02 11:49:45,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:49:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:49:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:49:45,896 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 8 states. [2018-10-02 11:49:46,706 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-02 11:49:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:47,722 INFO L93 Difference]: Finished difference Result 1096 states and 1350 transitions. [2018-10-02 11:49:47,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:49:47,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-10-02 11:49:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:47,727 INFO L225 Difference]: With dead ends: 1096 [2018-10-02 11:49:47,727 INFO L226 Difference]: Without dead ends: 840 [2018-10-02 11:49:47,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:49:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-10-02 11:49:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 457. [2018-10-02 11:49:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-02 11:49:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 580 transitions. [2018-10-02 11:49:47,813 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 580 transitions. Word has length 75 [2018-10-02 11:49:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:47,813 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 580 transitions. [2018-10-02 11:49:47,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:49:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 580 transitions. [2018-10-02 11:49:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-02 11:49:47,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:47,815 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:47,815 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:47,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash 44732949, now seen corresponding path program 1 times [2018-10-02 11:49:47,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:47,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:47,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:47,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:47,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-02 11:49:47,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:47,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:47,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:47,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:47,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:47,885 INFO L87 Difference]: Start difference. First operand 457 states and 580 transitions. Second operand 3 states. [2018-10-02 11:49:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:48,045 INFO L93 Difference]: Finished difference Result 702 states and 883 transitions. [2018-10-02 11:49:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:48,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-10-02 11:49:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:48,047 INFO L225 Difference]: With dead ends: 702 [2018-10-02 11:49:48,047 INFO L226 Difference]: Without dead ends: 259 [2018-10-02 11:49:48,048 INFO L605 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 [2018-10-02 11:49:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-02 11:49:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-10-02 11:49:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-02 11:49:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2018-10-02 11:49:48,095 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 82 [2018-10-02 11:49:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:48,095 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2018-10-02 11:49:48,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2018-10-02 11:49:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-02 11:49:48,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:48,097 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:48,097 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:48,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:48,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1071152936, now seen corresponding path program 2 times [2018-10-02 11:49:48,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:48,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:48,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-02 11:49:48,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:48,333 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:49:48,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:49:48,442 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:49:48,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:49:48,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-02 11:49:48,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:49:48,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-02 11:49:48,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:49:48,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:49:48,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:49:48,522 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand 4 states. [2018-10-02 11:49:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:48,693 INFO L93 Difference]: Finished difference Result 491 states and 600 transitions. [2018-10-02 11:49:48,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:49:48,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-02 11:49:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:48,695 INFO L225 Difference]: With dead ends: 491 [2018-10-02 11:49:48,695 INFO L226 Difference]: Without dead ends: 248 [2018-10-02 11:49:48,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:49:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-02 11:49:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-10-02 11:49:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-02 11:49:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2018-10-02 11:49:48,744 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 102 [2018-10-02 11:49:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:48,745 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2018-10-02 11:49:48,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:49:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2018-10-02 11:49:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-02 11:49:48,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:48,746 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:48,746 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:48,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:48,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2108568021, now seen corresponding path program 3 times [2018-10-02 11:49:48,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:48,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:48,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:48,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:49:48,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-02 11:49:49,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:49,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:49:49,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:49:49,092 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 11:49:49,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:49:49,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-02 11:49:49,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:49:49,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-02 11:49:49,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:49:49,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:49:49,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:49:49,154 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand 4 states. [2018-10-02 11:49:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:49,307 INFO L93 Difference]: Finished difference Result 322 states and 376 transitions. [2018-10-02 11:49:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:49:49,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-02 11:49:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:49,308 INFO L225 Difference]: With dead ends: 322 [2018-10-02 11:49:49,308 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:49:49,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:49:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:49:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:49:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:49:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:49:49,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2018-10-02 11:49:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:49,310 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:49:49,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:49:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:49:49,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:49:49,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:49:49,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:49,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:49,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:49,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:49,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:49,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:49,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:51,503 WARN L178 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-10-02 11:49:51,929 WARN L178 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-10-02 11:49:52,240 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-02 11:49:52,589 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-10-02 11:49:53,068 WARN L178 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-10-02 11:49:53,308 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-02 11:49:53,473 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-02 11:49:53,577 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-02 11:49:53,845 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-10-02 11:49:54,122 WARN L178 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-10-02 11:49:54,337 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-02 11:49:54,546 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-10-02 11:49:54,668 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-10-02 11:49:54,961 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-02 11:49:55,158 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-10-02 11:49:55,365 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-10-02 11:49:55,687 WARN L178 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-10-02 11:49:55,874 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-02 11:49:56,339 WARN L178 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-10-02 11:49:56,831 WARN L178 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-10-02 11:49:57,118 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-10-02 11:49:57,275 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-02 11:49:57,807 WARN L178 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-10-02 11:49:58,117 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-02 11:49:58,340 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-02 11:49:58,343 INFO L421 ceAbstractionStarter]: At program point L192(lines 166 192) the Hoare annotation is: (let ((.cse13 (+ ~t_b 2))) (let ((.cse6 (<= 2 ~r_st)) (.cse5 (= ~wl_st 0)) (.cse10 (<= ~c_t .cse13)) (.cse3 (<= 1 ~c1_pc)) (.cse11 (<= ~c .cse13)) (.cse12 (<= .cse13 ~c_t)) (.cse7 (<= 1 ~c2_pc)) (.cse9 (<= 2 ~c2_st)) (.cse14 (<= .cse13 ~c)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse15 (<= ~data .cse13)) (.cse4 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse16 (<= .cse13 ~data)) (.cse8 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse6 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse1 .cse4 .cse5 .cse8 (< ~c (+ ~c_t 1))) (and .cse10 .cse3 .cse11 .cse6 .cse12 (<= ~d .cse13) .cse7 .cse9 .cse14 (<= .cse13 ~d) .cse1 .cse2 .cse15 .cse4 .cse5 .cse0 .cse16 .cse8) (and .cse10 .cse3 (<= 2 ~wl_st) .cse11 .cse12 .cse7 .cse9 .cse14 .cse1 .cse2 .cse15 .cse4 .cse0 .cse16 .cse8)))) [2018-10-02 11:49:58,344 INFO L421 ceAbstractionStarter]: At program point L448(lines 445 454) the Hoare annotation is: (let ((.cse4 (<= 2 ~r_st)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse9 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse8 (<= 2 ~e_wl)) (.cse7 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse8 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse9) (let ((.cse10 (+ ~t_b 2))) (and (<= ~c_t .cse10) .cse2 .cse3 (<= ~c .cse10) (<= .cse10 ~c_t) .cse5 .cse9 (<= .cse10 ~c) .cse0 .cse1 (<= ~data .cse10) .cse8 .cse7 (<= .cse10 ~data) .cse6)))) [2018-10-02 11:49:58,344 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 423) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse9 (<= ~c .cse14)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse10 (<= .cse14 ~c)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse3 .cse8 .cse9 .cse4 .cse5 .cse7 .cse10 (<= ~c_t ~c) .cse2 .cse11 .cse12 .cse0 .cse13 .cse6 (< ~c (+ ~c_t 1))) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and (<= ~c_t .cse14) .cse3 .cse8 .cse9 (<= .cse14 ~c_t) .cse5 .cse7 .cse10 .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6)))) [2018-10-02 11:49:58,344 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 53 461) no Hoare annotation was computed. [2018-10-02 11:49:58,344 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 53 461) no Hoare annotation was computed. [2018-10-02 11:49:58,345 INFO L421 ceAbstractionStarter]: At program point L408(lines 403 409) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse9 (<= ~c .cse14)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse10 (<= .cse14 ~c)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse3 .cse8 .cse9 .cse4 .cse5 .cse7 .cse10 (<= ~c_t ~c) .cse2 .cse11 .cse12 .cse0 .cse13 .cse6 (< ~c (+ ~c_t 1))) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and (<= ~c_t .cse14) .cse3 .cse8 .cse9 (<= .cse14 ~c_t) .cse5 .cse7 .cse10 .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6)))) [2018-10-02 11:49:58,345 INFO L421 ceAbstractionStarter]: At program point L342(lines 339 388) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2)) (.cse5 (<= 2 ~wl_st)) (.cse15 (not (= ~e_c 1))) (.cse10 (= ~wb_pc 1)) (.cse4 (<= 1 ~c1_pc)) (.cse7 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse13 (not (= ~e_c 0)))) (let ((.cse0 (or (and .cse15 .cse10 .cse4 .cse5 .cse7 .cse8 .cse13) (and .cse15 .cse10 (= ~wl_pc 1) .cse4 .cse7 .cse8 .cse13))) (.cse6 (<= ~c .cse14)) (.cse2 (<= 2 ~c2_st)) (.cse9 (<= .cse14 ~c)) (.cse11 (<= ~data .cse14)) (.cse3 (<= 2 ~e_wl)) (.cse1 (<= 2 ~c1_st)) (.cse12 (<= .cse14 ~data))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse3 .cse1 .cse12 .cse13 (< ~c (+ ~c_t 1))) (= ~wl_pc 0) (and (<= ~c_t .cse14) .cse4 .cse5 .cse6 (<= .cse14 ~c_t) .cse8 .cse2 .cse9 .cse15 .cse10 .cse11 .cse3 .cse1 .cse12 .cse13)))) [2018-10-02 11:49:58,345 INFO L421 ceAbstractionStarter]: At program point L334(lines 296 340) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2)) (.cse5 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse4 (<= 1 ~c1_pc)) (.cse7 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse15 (not (= ~e_c 0)))) (let ((.cse2 (or (and .cse10 .cse11 .cse4 .cse5 .cse7 .cse8 .cse15) (and .cse10 .cse11 (= ~wl_pc 1) .cse4 .cse7 .cse8 .cse15))) (.cse6 (<= ~c .cse14)) (.cse1 (<= 2 ~c2_st)) (.cse9 (<= .cse14 ~c)) (.cse12 (<= ~data .cse14)) (.cse3 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse12 .cse3 .cse0 .cse13 (< ~c (+ ~c_t 1))) (= ~wl_pc 0) (and (<= ~c_t .cse14) .cse4 .cse5 .cse6 (<= .cse14 ~c_t) .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse3 .cse0 .cse13 .cse15)))) [2018-10-02 11:49:58,346 INFO L421 ceAbstractionStarter]: At program point L425(lines 422 426) the Hoare annotation is: (let ((.cse1 (not (= ~e_c 1))) (.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse2 (= ~wb_pc 1)) (.cse0 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (let ((.cse9 (+ ~t_b 2))) (and .cse3 .cse8 (<= ~c .cse9) .cse5 .cse7 (<= .cse9 ~c) (<= ~c_t ~c) .cse2 (<= ~data .cse9) (<= 2 ~e_wl) .cse0 (<= .cse9 ~data) .cse6 (< ~c (+ ~c_t 1)))))) [2018-10-02 11:49:58,346 INFO L421 ceAbstractionStarter]: At program point L161(lines 161 167) the Hoare annotation is: (let ((.cse19 (+ ~t_b 2))) (let ((.cse1 (= ~wl_pc 1)) (.cse13 (<= ~c_t ~c)) (.cse12 (< ~c (+ ~c_t 1))) (.cse7 (<= 2 ~r_st)) (.cse6 (= ~wl_st 0)) (.cse14 (<= ~c_t .cse19)) (.cse4 (<= 1 ~c1_pc)) (.cse11 (<= 2 ~wl_st)) (.cse18 (<= ~c .cse19)) (.cse15 (<= .cse19 ~c_t)) (.cse8 (<= 1 ~c2_pc)) (.cse10 (<= 2 ~c2_st)) (.cse20 (<= .cse19 ~c)) (.cse2 (not (= ~e_c 1))) (.cse3 (= ~wb_pc 1)) (.cse16 (<= ~data .cse19)) (.cse5 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse17 (<= .cse19 ~data)) (.cse9 (not (= ~e_c 0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse7 .cse8 .cse9 .cse12 .cse13) .cse0 .cse10) (and .cse14 .cse4 .cse11 .cse7 .cse15 .cse8 .cse10 .cse2 .cse3 .cse16 .cse5 .cse0 .cse17 .cse9) (and .cse7 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse13 (= ~c2_st 0) .cse2 .cse5 .cse6 .cse9 .cse12) (and .cse14 .cse4 .cse18 .cse7 .cse15 (<= ~d .cse19) .cse8 .cse10 .cse20 (<= .cse19 ~d) .cse2 .cse3 .cse16 .cse5 .cse6 .cse0 .cse17 .cse9) (and .cse14 .cse4 .cse11 .cse18 .cse15 .cse8 .cse10 .cse20 .cse2 .cse3 .cse16 .cse5 .cse0 .cse17 .cse9)))) [2018-10-02 11:49:58,346 INFO L421 ceAbstractionStarter]: At program point L318(lines 307 343) the Hoare annotation is: (let ((.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse3 (= ~wb_st 0)) (.cse4 (not (= ~e_c 1))) (.cse6 (not (= ~c2_st 0))) (.cse7 (<= 2 ~c1_st)) (.cse8 (not (= ~e_c 0)))) (or (let ((.cse5 (+ ~t_b 2))) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~c2_pc) .cse4 (= ~wb_pc 1) (<= ~data .cse5) .cse6 (<= 2 ~e_wl) .cse7 .cse8 (<= .cse5 ~data))) (and .cse0 .cse1 .cse2 (<= ~t_b ~data) .cse3 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse4 .cse6 .cse7 .cse8 (< ~c (+ ~c_t 1))))) [2018-10-02 11:49:58,347 INFO L421 ceAbstractionStarter]: At program point L302(lines 209 302) the Hoare annotation is: (let ((.cse12 (+ ~t_b 2))) (let ((.cse5 (= ~wl_pc 1)) (.cse9 (<= ~c_t .cse12)) (.cse10 (<= ~c .cse12)) (.cse11 (<= .cse12 ~c_t)) (.cse14 (<= 2 ~c2_st)) (.cse15 (<= .cse12 ~c)) (.cse17 (<= ~data .cse12)) (.cse18 (<= .cse12 ~data)) (.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse3 (= ~wb_st 0)) (.cse13 (<= 1 ~c2_pc)) (.cse4 (= ~c2_st 0)) (.cse6 (not (= ~e_c 1))) (.cse16 (= ~wb_pc 1)) (.cse19 (<= 2 ~e_wl)) (.cse7 (<= 2 ~c1_st)) (.cse8 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 (<= ~t_b ~data) .cse3 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse4 .cse5 .cse6 .cse7 .cse8 (< ~c (+ ~c_t 1))) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse11 (<= ~d .cse12) .cse13 .cse14 .cse15 (<= .cse12 ~d) .cse5 .cse6 .cse16 .cse17 .cse7 .cse18 .cse8) (and .cse9 .cse0 .cse1 .cse10 .cse11 .cse13 .cse14 .cse15 .cse6 .cse16 .cse17 .cse19 .cse7 .cse18 .cse8) (let ((.cse20 (+ ~t_b 1))) (and .cse0 .cse1 .cse2 .cse3 .cse13 (<= ~data .cse20) .cse4 .cse6 .cse16 .cse19 .cse7 .cse8 (<= .cse20 ~data)))))) [2018-10-02 11:49:58,347 INFO L421 ceAbstractionStarter]: At program point L360(lines 353 391) the Hoare annotation is: (let ((.cse10 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse7 (<= ~c_t .cse10)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse8 (<= ~c .cse10)) (.cse9 (<= .cse10 ~c_t)) (.cse5 (<= 1 ~c2_pc)) (.cse15 (<= 2 ~c2_st)) (.cse11 (<= .cse10 ~c)) (.cse1 (not (= ~e_c 1))) (.cse16 (= ~wb_pc 1)) (.cse12 (<= ~data .cse10)) (.cse17 (<= 2 ~e_wl)) (.cse14 (<= 2 ~c1_st)) (.cse13 (<= .cse10 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and (let ((.cse0 (= ~wl_pc 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~t_b ~data) .cse5 (<= ~data ~t_b) .cse6 (= ~wb_pc 0) (< ~c (+ ~c_t 1)) (<= ~c_t ~c)) (and .cse7 .cse2 .cse3 .cse8 .cse4 .cse9 (<= ~d .cse10) .cse5 .cse11 (<= .cse10 ~d) .cse0 .cse1 .cse12 .cse6 .cse13))) .cse14 .cse15) (and .cse7 .cse2 .cse3 .cse4 .cse9 .cse5 .cse15 .cse1 .cse16 .cse12 .cse17 .cse14 .cse13 .cse6) (and .cse7 .cse2 .cse3 .cse8 .cse9 .cse5 .cse15 .cse11 .cse1 .cse16 .cse12 .cse17 .cse14 .cse13 .cse6)))) [2018-10-02 11:49:58,347 INFO L421 ceAbstractionStarter]: At program point L220(lines 220 271) the Hoare annotation is: (and (<= 2 ~c1_st) (let ((.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse3 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~e_wl)) (.cse5 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse7 (not (= ~e_c 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= .cse0 ~d) .cse1 .cse2 .cse3 .cse4 (<= ~c .cse0) .cse5 (<= ~d .cse0) .cse6 .cse7 (<= .cse0 ~c))) (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (<= 2 ~c2_st)) [2018-10-02 11:49:58,347 INFO L421 ceAbstractionStarter]: At program point L187(lines 187 218) the Hoare annotation is: (let ((.cse5 (<= 1 ~c1_pc)) (.cse0 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse4 (= ~wb_pc 1)) (.cse2 (<= 2 ~e_wl)) (.cse7 (<= 2 ~c1_st)) (.cse3 (not (= ~e_c 0)))) (or (and .cse0 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse1 .cse2 .cse3 (< ~c (+ ~c_t 1))) (and (and (= ~wl_pc 1) .cse1 .cse4 .cse5 .cse2 .cse0 .cse6 .cse3) .cse7 .cse8) (let ((.cse9 (+ ~t_b 2))) (and (<= ~c_t .cse9) .cse5 (<= ~c .cse9) .cse0 (<= .cse9 ~c_t) (<= ~d .cse9) .cse6 .cse8 (<= .cse9 ~c) (<= .cse9 ~d) .cse1 .cse4 (<= ~data .cse9) .cse2 .cse7 (<= .cse9 ~data) .cse3)))) [2018-10-02 11:49:58,348 INFO L421 ceAbstractionStarter]: At program point L270(lines 270 332) the Hoare annotation is: false [2018-10-02 11:49:58,348 INFO L421 ceAbstractionStarter]: At program point L460(lines 146 460) the Hoare annotation is: (let ((.cse6 (<= 2 ~r_st)) (.cse5 (= ~wl_st 0)) (.cse3 (<= 1 ~c1_pc)) (.cse7 (<= 1 ~c2_pc)) (.cse9 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse4 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse8 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse6 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse1 .cse4 .cse5 .cse8 (< ~c (+ ~c_t 1))) (let ((.cse10 (+ ~t_b 2))) (and (<= ~c_t .cse10) .cse3 (<= 2 ~wl_st) (<= ~c .cse10) (<= .cse10 ~c_t) .cse7 .cse9 (<= .cse10 ~c) .cse1 .cse2 (<= ~data .cse10) .cse4 .cse0 (<= .cse10 ~data) .cse8)))) [2018-10-02 11:49:58,348 INFO L421 ceAbstractionStarter]: At program point L328(lines 328 354) the Hoare annotation is: (let ((.cse6 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse6)) (.cse2 (<= ~c .cse6)) (.cse4 (<= .cse6 ~c_t)) (.cse9 (<= .cse6 ~c)) (.cse12 (= ~wb_pc 1)) (.cse13 (<= ~data .cse6)) (.cse17 (<= 2 ~e_wl)) (.cse16 (<= .cse6 ~data)) (.cse1 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse5 (<= 2 ~r_st)) (.cse7 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse10 (= ~wl_pc 1)) (.cse11 (not (= ~e_c 1))) (.cse14 (<= 2 ~c1_st)) (.cse15 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 .cse9 (<= .cse6 ~d) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse11 .cse12 .cse1 .cse13 .cse3 .cse17 .cse5 .cse14 .cse7 .cse8 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse1 .cse3 .cse5 (<= ~t_b ~data) .cse7 (<= ~data ~t_b) .cse8 (= ~wb_pc 0) (<= ~c_t ~c) .cse10 .cse11 .cse14 .cse15 (< ~c (+ ~c_t 1)))))) [2018-10-02 11:49:58,348 INFO L421 ceAbstractionStarter]: At program point L196(lines 196 226) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse8 (<= ~c_t .cse14)) (.cse3 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse10 (<= .cse14 ~c_t)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and .cse1 .cse2 (= ~wl_pc 1) .cse3 .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1)) (<= ~c_t ~c)) .cse7) (= ~wl_pc 0) (and .cse8 .cse3 .cse9 .cse4 .cse10 .cse5 .cse7 .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6) (and .cse8 .cse3 .cse9 (<= ~c .cse14) .cse10 .cse5 .cse7 (<= .cse14 ~c) .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6)))) [2018-10-02 11:49:58,349 INFO L421 ceAbstractionStarter]: At program point L172(lines 172 193) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse8 (<= ~c_t .cse14)) (.cse3 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse10 (<= .cse14 ~c_t)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1)) (<= ~c_t ~c)) .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~wl_pc 0) .cse6) (and .cse8 .cse3 .cse9 .cse4 .cse10 .cse5 .cse7 .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6) (and .cse8 .cse3 .cse9 (<= ~c .cse14) .cse10 .cse5 .cse7 (<= .cse14 ~c) .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6)))) [2018-10-02 11:49:58,349 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 333) no Hoare annotation was computed. [2018-10-02 11:49:58,349 INFO L421 ceAbstractionStarter]: At program point L206(lines 206 238) the Hoare annotation is: (let ((.cse4 (= ~c2_st 0)) (.cse5 (not (= ~e_c 1))) (.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (<= ~t_b ~data)) (.cse3 (<= ~data ~t_b)) (.cse6 (not (= ~e_c 0))) (.cse7 (not (= ~c1_st 0)))) (or (and .cse0 .cse1 .cse2 (= ~wb_st 0) .cse3 (= ~wb_pc 0) (<= ~c_t ~c) .cse4 (= ~wl_pc 1) .cse5 .cse6 .cse7 (< ~c (+ ~c_t 1))) (and .cse4 .cse5 (= ~wb_pc 1) (<= 1 ~c1_pc) (<= 2 ~e_wl) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) .cse3 .cse6 .cse7))) [2018-10-02 11:49:58,349 INFO L421 ceAbstractionStarter]: At program point L396(lines 331 396) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse9 (<= ~c_t .cse14)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse10 (<= .cse14 ~c_t)) (.cse5 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse7 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1)) (<= ~c_t ~c)) .cse7 .cse8) (and .cse9 .cse2 .cse3 .cse4 .cse10 .cse5 .cse8 .cse0 .cse1 .cse11 .cse12 .cse7 .cse13 .cse6) (and .cse9 .cse2 .cse3 (<= ~c .cse14) .cse10 .cse5 .cse8 (<= .cse14 ~c) .cse0 .cse1 .cse11 .cse12 .cse7 .cse13 .cse6)))) [2018-10-02 11:49:58,350 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 53 461) no Hoare annotation was computed. [2018-10-02 11:49:58,350 INFO L421 ceAbstractionStarter]: At program point L248(lines 237 297) the Hoare annotation is: (let ((.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (= ~wb_st 0)) (.cse3 (= ~c2_st 0)) (.cse4 (not (= ~e_c 1))) (.cse5 (not (= ~e_c 0))) (.cse6 (not (= ~c1_st 0)))) (or (and .cse0 .cse1 (<= ~t_b ~data) .cse2 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse3 (= ~wl_pc 1) .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1))) (let ((.cse7 (+ ~t_b 1))) (and (<= 1 ~c1_pc) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) (<= ~data .cse7) .cse3 .cse4 (= ~wb_pc 1) (<= 2 ~e_wl) .cse5 .cse6 (<= .cse7 ~data))))) [2018-10-02 11:49:58,350 INFO L421 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (let ((.cse1 (not (= ~e_c 1))) (.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse2 (= ~wb_pc 1)) (.cse0 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (let ((.cse9 (+ ~t_b 2))) (and .cse3 .cse8 (<= ~c .cse9) .cse5 .cse7 (<= .cse9 ~c) (<= ~c_t ~c) .cse2 (<= ~data .cse9) (<= 2 ~e_wl) .cse0 (<= .cse9 ~data) .cse6 (< ~c (+ ~c_t 1)))))) [2018-10-02 11:49:58,350 INFO L421 ceAbstractionStarter]: At program point L232(lines 225 291) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2)) (.cse5 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse4 (<= 1 ~c1_pc)) (.cse7 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse15 (not (= ~e_c 0)))) (let ((.cse2 (or (and .cse10 .cse11 .cse4 .cse5 .cse7 .cse8 .cse15) (and .cse10 .cse11 (= ~wl_pc 1) .cse4 .cse7 .cse8 .cse15))) (.cse6 (<= ~c .cse14)) (.cse1 (<= 2 ~c2_st)) (.cse9 (<= .cse14 ~c)) (.cse12 (<= ~data .cse14)) (.cse3 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse12 .cse3 .cse0 .cse13 (< ~c (+ ~c_t 1))) (= ~wl_pc 0) (and (<= ~c_t .cse14) .cse4 .cse5 .cse6 (<= .cse14 ~c_t) .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse3 .cse0 .cse13 .cse15)))) [2018-10-02 11:49:58,351 INFO L421 ceAbstractionStarter]: At program point L290(lines 177 290) the Hoare annotation is: (let ((.cse13 (+ ~t_b 2))) (let ((.cse6 (= ~wl_pc 1)) (.cse5 (= ~c2_st 0)) (.cse1 (<= 2 ~r_st)) (.cse2 (<= ~t_b ~data)) (.cse3 (= ~c1_st 0)) (.cse4 (<= ~data ~t_b)) (.cse9 (<= ~c_t .cse13)) (.cse10 (<= 1 ~c1_pc)) (.cse0 (<= 2 ~wl_st)) (.cse11 (<= ~c .cse13)) (.cse12 (<= .cse13 ~c_t)) (.cse14 (<= 1 ~c2_pc)) (.cse15 (<= 2 ~c2_st)) (.cse16 (<= .cse13 ~c)) (.cse7 (not (= ~e_c 1))) (.cse17 (= ~wb_pc 1)) (.cse18 (<= ~data .cse13)) (.cse21 (<= 2 ~e_wl)) (.cse19 (<= 2 ~c1_st)) (.cse20 (<= .cse13 ~data)) (.cse8 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~wb_st 0) .cse4 (= ~wb_pc 0) (<= ~c_t ~c) .cse5 .cse6 .cse7 .cse8 (< ~c (+ ~c_t 1))) (and .cse9 .cse10 .cse0 .cse11 .cse1 .cse12 (<= ~d .cse13) .cse14 .cse15 .cse16 (<= .cse13 ~d) .cse6 .cse7 .cse17 .cse18 .cse19 .cse20 .cse8) (and .cse5 .cse7 .cse17 .cse10 .cse21 .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse12 .cse14 .cse15 .cse16 .cse7 .cse17 .cse18 .cse21 .cse19 .cse20 .cse8)))) [2018-10-02 11:49:58,351 INFO L421 ceAbstractionStarter]: At program point L381(lines 157 381) the Hoare annotation is: (let ((.cse19 (+ ~t_b 2))) (let ((.cse1 (= ~wl_pc 1)) (.cse13 (<= ~c_t ~c)) (.cse12 (< ~c (+ ~c_t 1))) (.cse7 (<= 2 ~r_st)) (.cse6 (= ~wl_st 0)) (.cse14 (<= ~c_t .cse19)) (.cse4 (<= 1 ~c1_pc)) (.cse11 (<= 2 ~wl_st)) (.cse18 (<= ~c .cse19)) (.cse15 (<= .cse19 ~c_t)) (.cse8 (<= 1 ~c2_pc)) (.cse10 (<= 2 ~c2_st)) (.cse20 (<= .cse19 ~c)) (.cse2 (not (= ~e_c 1))) (.cse3 (= ~wb_pc 1)) (.cse16 (<= ~data .cse19)) (.cse5 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse17 (<= .cse19 ~data)) (.cse9 (not (= ~e_c 0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse7 .cse8 .cse9 .cse12 .cse13) .cse0 .cse10) (and .cse14 .cse4 .cse11 .cse7 .cse15 .cse8 .cse10 .cse2 .cse3 .cse16 .cse5 .cse0 .cse17 .cse9) (and .cse7 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse13 (= ~c2_st 0) .cse2 .cse5 .cse6 .cse9 .cse12) (and .cse14 .cse4 .cse18 .cse7 .cse15 (<= ~d .cse19) .cse8 .cse10 .cse20 (<= .cse19 ~d) .cse2 .cse3 .cse16 .cse5 .cse6 .cse0 .cse17 .cse9) (and .cse14 .cse4 .cse11 .cse18 .cse15 .cse8 .cse10 .cse20 .cse2 .cse3 .cse16 .cse5 .cse0 .cse17 .cse9)))) [2018-10-02 11:49:58,351 INFO L421 ceAbstractionStarter]: At program point L348(lines 261 348) the Hoare annotation is: (let ((.cse6 (+ ~t_b 2))) (let ((.cse10 (= ~wl_pc 1)) (.cse4 (<= 2 ~r_st)) (.cse17 (= ~wb_st 0)) (.cse0 (<= ~c_t .cse6)) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 2 ~wl_st)) (.cse3 (<= ~c .cse6)) (.cse5 (<= .cse6 ~c_t)) (.cse7 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse9 (<= .cse6 ~c)) (.cse11 (not (= ~e_c 1))) (.cse12 (= ~wb_pc 1)) (.cse13 (<= ~data .cse6)) (.cse18 (<= 2 ~e_wl)) (.cse14 (<= 2 ~c1_st)) (.cse15 (<= .cse6 ~data)) (.cse16 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 .cse9 (<= .cse6 ~d) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse4 (<= ~t_b ~data) .cse17 .cse7 (<= ~data ~t_b) .cse8 (= ~wb_pc 0) (<= ~c_t ~c) .cse10 .cse11 .cse14 .cse16 (< ~c (+ ~c_t 1))) (and .cse1 .cse2 .cse4 .cse17 .cse7 .cse8 .cse11 .cse12 .cse13 .cse18 .cse14 .cse16 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15 .cse16)))) [2018-10-02 11:49:58,352 INFO L421 ceAbstractionStarter]: At program point L439(lines 436 446) the Hoare annotation is: (let ((.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse0 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (let ((.cse9 (+ ~t_b 2))) (and (<= ~c_t .cse9) .cse3 .cse8 (<= ~c .cse9) (<= .cse9 ~c_t) .cse5 .cse7 (<= .cse9 ~c) .cse1 .cse2 (<= ~data .cse9) (<= 2 ~e_wl) .cse0 (<= .cse9 ~data) .cse6)))) [2018-10-02 11:49:58,352 INFO L421 ceAbstractionStarter]: At program point L390(lines 387 404) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2)) (.cse3 (<= 2 ~wl_st)) (.cse15 (not (= ~e_c 1))) (.cse9 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse5 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse13 (not (= ~e_c 0)))) (let ((.cse1 (or (and .cse15 .cse9 .cse2 .cse3 .cse5 .cse6 .cse13) (and .cse15 .cse9 (= ~wl_pc 1) .cse2 .cse5 .cse6 .cse13))) (.cse4 (<= ~c .cse14)) (.cse7 (<= 2 ~c2_st)) (.cse8 (<= .cse14 ~c)) (.cse10 (<= ~data .cse14)) (.cse0 (<= 2 ~e_wl)) (.cse11 (<= 2 ~c1_st)) (.cse12 (<= .cse14 ~data))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_t ~c) .cse9 .cse10 .cse0 .cse11 .cse12 .cse13 (< ~c (+ ~c_t 1))) (and .cse11 .cse1 .cse7) (= ~wl_pc 0) (and (<= ~c_t .cse14) .cse2 .cse3 .cse4 (<= .cse14 ~c_t) .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse0 .cse11 .cse12 .cse13)))) [2018-10-02 11:49:58,352 INFO L421 ceAbstractionStarter]: At program point L258(lines 258 308) the Hoare annotation is: (let ((.cse3 (not (= ~e_c 1))) (.cse4 (not (= ~c2_st 0))) (.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse5 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 (<= ~t_b ~data) (= ~wb_st 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse3 .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1))) (let ((.cse7 (+ ~t_b 1))) (and (= ~wb_pc 1) .cse3 .cse4 .cse0 (<= 2 ~e_wl) .cse1 .cse2 .cse5 (<= 1 ~c2_pc) (<= ~data .cse7) .cse6 (<= .cse7 ~data))))) [2018-10-02 11:49:58,402 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:49:58 BoogieIcfgContainer [2018-10-02 11:49:58,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:49:58,403 INFO L168 Benchmark]: Toolchain (without parser) took 18814.60 ms. Allocated memory was 1.6 GB in the beginning and 1.8 GB in the end (delta: 199.2 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -70.4 MB). Peak memory consumption was 680.0 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:58,404 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:58,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.71 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:58,405 INFO L168 Benchmark]: Boogie Preprocessor took 53.77 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:58,405 INFO L168 Benchmark]: RCFGBuilder took 737.36 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:58,406 INFO L168 Benchmark]: TraceAbstraction took 17961.75 ms. Allocated memory was 1.6 GB in the beginning and 1.8 GB in the end (delta: 199.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -102.2 MB). Peak memory consumption was 648.3 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:58,409 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.71 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.77 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 737.36 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17961.75 ms. Allocated memory was 1.6 GB in the beginning and 1.8 GB in the end (delta: 199.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -102.2 MB). Peak memory consumption was 648.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 333]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((2 <= ~c1_st && 2 <= ~c2_st) && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) || (2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && ~c < ~c_t + 1)) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) || (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~c_t <= ~c) && 2 <= ~c1_st) && 2 <= ~c2_st) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((2 <= ~c1_st && 2 <= ~c2_st) && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) || (2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && ~c < ~c_t + 1)) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && !(~c2_st == 0)) && 2 <= ~e_wl) && 2 <= ~c1_st) && !(~e_c == 0)) && ~t_b + 2 <= ~data) || (((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && !(~c2_st == 0)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0)) && ~wb_pc == 0) && ~c < ~c_t + 1) && ~c_t <= ~c) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~data <= ~t_b + 2) && !(~e_c == 0)) && ~t_b + 2 <= ~data)) && 2 <= ~c1_st) && 2 <= ~c2_st) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && !(~e_c == 0)) && ~c < ~c_t + 1) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((~c2_st == 0 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~c1_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && !(~e_c == 0)) && !(~c1_st == 0)) && ~c < ~c_t + 1) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b + 1) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && 2 <= ~e_wl) && !(~e_c == 0)) && !(~c1_st == 0)) && ~t_b + 1 <= ~data) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && !(~e_c == 0)) && !(~c1_st == 0)) && ~c < ~c_t + 1) || (((((((((((~c2_st == 0 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0)) && !(~c1_st == 0)) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && !(~e_c == 0)) && ~c < ~c_t + 1) || (((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c1_st) && 2 <= ~c2_st)) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (2 <= ~c1_st && (((((((((((~t_b + 2 <= ~d && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~t_b + 2 <= ~c) || (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) && 2 <= ~c2_st - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) && 2 <= ~c1_st) && 2 <= ~c2_st) || (2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: ((((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) || (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && !(~e_c == 0)) && ~c < ~c_t + 1)) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~wl_st) && ~t_b + 2 <= ~c_t) && 2 <= ~r_st) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~c1_st) && !(~e_c == 0)) && ~t_b + 2 <= ~data) || (((((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~data <= ~t_b + 2) && 2 <= ~wl_st) && 2 <= ~e_wl) && 2 <= ~r_st) && 2 <= ~c1_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 0)) && ~t_b + 2 <= ~data)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~wl_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && !(~e_c == 0)) && ~t_b + 2 <= ~data)) || (((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && 2 <= ~c2_st) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~c_t <= ~c) && 2 <= ~c1_st) && 2 <= ~c2_st)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && !(~e_c == 0)) && ~c < ~c_t + 1)) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~c_t <= ~c) && 2 <= ~c1_st) && 2 <= ~c2_st)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && !(~e_c == 0)) && ~c < ~c_t + 1)) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~c_t <= ~c) && 2 <= ~c2_st) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && ~wl_pc == 0) && !(~e_c == 0))) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b) && 2 <= ~c2_st) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && !(~e_c == 0)) && ~t_b + 2 <= ~data)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && !(~c2_st == 0)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1) || (((((((((((~wb_pc == 1 && !(~e_c == 1)) && !(~c2_st == 0)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~wl_st) && 2 <= ~r_st) && 2 <= ~c1_st) && 1 <= ~c2_pc) && ~data <= ~t_b + 1) && !(~e_c == 0)) && ~t_b + 1 <= ~data) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ((2 <= ~c1_st && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) && 2 <= ~c2_st)) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b + 1) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && 2 <= ~e_wl) && 2 <= ~c1_st) && !(~e_c == 0)) && ~t_b + 1 <= ~data) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((2 <= ~c1_st && (((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~c_t <= ~c) && 2 <= ~c2_st) || ~wl_pc == 0) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 17.8s OverallTime, 19 OverallIterations, 8 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 9.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1102 SDtfs, 689 SDslu, 1182 SDs, 0 SdLazy, 242 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 510 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 132 NumberOfFragments, 4954 HoareAnnotationTreeSize, 29 FomulaSimplifications, 9687 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 29 FomulaSimplificationsInter, 4647 FormulaSimplificationTreeSizeReductionInter, 8.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1292 NumberOfCodeBlocks, 1233 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1269 ConstructedInterpolants, 0 QuantifiedInterpolants, 201498 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1528 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 1220/1250 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-49-58-436.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-49-58-436.csv Received shutdown request...