java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyArrayStore.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:44,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:44,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:44,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:44,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:44,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:44,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:44,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:44,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:44,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:44,542 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:44,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:44,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:44,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:44,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:44,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:44,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:44,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:44,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:44,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:44,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:44,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:44,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:44,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:44,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:44,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:44,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:44,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:44,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:44,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:44,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:44,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:44,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:44,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:44,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:44,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:44,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:44,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:44,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:44,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:44,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:44,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:44,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:44,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:44,611 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:44,611 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:44,612 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyArrayStore.bpl [2019-08-05 11:14:44,612 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyArrayStore.bpl' [2019-08-05 11:14:44,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:44,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:44,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:44,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:44,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:44,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/1) ... [2019-08-05 11:14:44,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/1) ... [2019-08-05 11:14:44,676 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:44,677 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:44,677 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:44,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:44,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:44,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:44,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:44,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/1) ... [2019-08-05 11:14:44,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/1) ... [2019-08-05 11:14:44,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/1) ... [2019-08-05 11:14:44,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/1) ... [2019-08-05 11:14:44,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/1) ... [2019-08-05 11:14:44,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/1) ... [2019-08-05 11:14:44,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/1) ... [2019-08-05 11:14:44,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:44,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:44,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:44,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:44,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:14:44,761 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:14:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:14:44,762 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:14:45,071 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:45,071 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:45,072 INFO L202 PluginConnector]: Adding new model EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:45 BoogieIcfgContainer [2019-08-05 11:14:45,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:45,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:45,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:45,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:45,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:44" (1/2) ... [2019-08-05 11:14:45,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df6db9 and model type EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:45, skipping insertion in model container [2019-08-05 11:14:45,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:45" (2/2) ... [2019-08-05 11:14:45,080 INFO L109 eAbstractionObserver]: Analyzing ICFG EasyArrayStore.bpl [2019-08-05 11:14:45,088 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:45,094 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:14:45,107 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:14:45,130 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:45,131 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:45,131 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:45,132 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:45,132 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:45,132 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:45,132 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:45,132 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:45,132 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:14:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:14:45,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:45,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:14:45,157 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash 929608, now seen corresponding path program 1 times [2019-08-05 11:14:45,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:45,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:45,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:45,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:45,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:14:45,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:45,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:45,312 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 11:14:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:45,496 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 11:14:45,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:45,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:14:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:45,512 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:14:45,512 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:14:45,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:14:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2019-08-05 11:14:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:14:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 11:14:45,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 4 [2019-08-05 11:14:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:45,540 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 11:14:45,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 11:14:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:14:45,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:45,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:14:45,541 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash 28754402, now seen corresponding path program 1 times [2019-08-05 11:14:45,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:45,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:45,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:45,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:45,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:14:45,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:45,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:45,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:45,628 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-08-05 11:14:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:45,729 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 11:14:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:45,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:14:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:45,730 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:14:45,730 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:14:45,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:14:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 9. [2019-08-05 11:14:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:14:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:14:45,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-08-05 11:14:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:45,734 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:14:45,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:14:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:14:45,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:45,735 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:14:45,736 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash 891323016, now seen corresponding path program 2 times [2019-08-05 11:14:45,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:45,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:45,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:45,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:45,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:45,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:45,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:45,835 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 11:14:46,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:46,010 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 11:14:46,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:46,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:14:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:46,011 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:14:46,011 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:14:46,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:46,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:14:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 10. [2019-08-05 11:14:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:14:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 11:14:46,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-08-05 11:14:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:46,015 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 11:14:46,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 11:14:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:14:46,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:46,016 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 11:14:46,016 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146274, now seen corresponding path program 3 times [2019-08-05 11:14:46,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:46,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:46,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:46,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:46,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:46,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:46,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:46,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:46,140 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2019-08-05 11:14:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:46,388 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 11:14:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:46,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:14:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:46,389 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:14:46,389 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:14:46,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:14:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 11. [2019-08-05 11:14:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:14:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:14:46,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 7 [2019-08-05 11:14:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:46,393 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:14:46,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:14:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:14:46,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:46,394 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 11:14:46,394 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1860896200, now seen corresponding path program 4 times [2019-08-05 11:14:46,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:46,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:46,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:46,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:46,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:46,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:46,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:46,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:46,512 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2019-08-05 11:14:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:46,718 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 11:14:46,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:46,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:14:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:46,725 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:14:46,725 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:14:46,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:14:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 12. [2019-08-05 11:14:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:14:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 11:14:46,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2019-08-05 11:14:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:46,730 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 11:14:46,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 11:14:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:14:46,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:46,733 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 11:14:46,733 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:46,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1853143906, now seen corresponding path program 5 times [2019-08-05 11:14:46,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:46,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:46,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:46,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:46,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:46,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:46,856 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2019-08-05 11:14:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:47,110 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 11:14:47,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:47,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:14:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:47,112 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:14:47,112 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:14:47,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:14:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 13. [2019-08-05 11:14:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:14:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:14:47,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2019-08-05 11:14:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:47,122 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:14:47,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:14:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:14:47,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:47,123 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 11:14:47,124 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:47,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1612822792, now seen corresponding path program 6 times [2019-08-05 11:14:47,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:47,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:47,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:47,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:47,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:47,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:47,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:47,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:47,394 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2019-08-05 11:14:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:47,666 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 11:14:47,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:47,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 11:14:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:47,668 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:14:47,668 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:14:47,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:14:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 14. [2019-08-05 11:14:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:14:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 11:14:47,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-08-05 11:14:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:47,679 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 11:14:47,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 11:14:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:14:47,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:47,681 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 11:14:47,681 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1542164446, now seen corresponding path program 7 times [2019-08-05 11:14:47,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:47,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:47,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:47,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:47,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:47,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:47,877 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 10 states. [2019-08-05 11:14:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:48,300 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 11:14:48,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:48,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 11:14:48,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:48,303 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:14:48,303 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:14:48,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:14:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 15. [2019-08-05 11:14:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:14:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:14:48,310 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2019-08-05 11:14:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:48,310 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:14:48,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:14:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:14:48,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:48,312 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 11:14:48,312 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash -562521016, now seen corresponding path program 8 times [2019-08-05 11:14:48,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:48,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:14:48,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:48,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:48,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:14:48,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:14:48,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:14:48,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:48,539 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2019-08-05 11:14:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:48,745 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-05 11:14:48,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:48,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-08-05 11:14:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:48,746 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:14:48,746 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:14:48,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:14:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 16. [2019-08-05 11:14:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:14:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 11:14:48,750 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-08-05 11:14:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:48,751 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 11:14:48,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:14:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 11:14:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:14:48,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:48,752 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 11:14:48,752 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:48,752 INFO L82 PathProgramCache]: Analyzing trace with hash -258345758, now seen corresponding path program 9 times [2019-08-05 11:14:48,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:48,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:14:48,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:48,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:48,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:14:48,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:14:48,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:14:48,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:48,893 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 12 states. [2019-08-05 11:14:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:49,014 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 11:14:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:14:49,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-08-05 11:14:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:49,015 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:14:49,016 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:14:49,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:14:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 17. [2019-08-05 11:14:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:14:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:14:49,020 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2019-08-05 11:14:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:49,020 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:14:49,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:14:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:14:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:14:49,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:49,021 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 11:14:49,022 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash 581152648, now seen corresponding path program 10 times [2019-08-05 11:14:49,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:49,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:14:49,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:49,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:49,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:14:49,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:14:49,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:14:49,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:49,163 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 13 states. [2019-08-05 11:14:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:49,313 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-05 11:14:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:14:49,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-08-05 11:14:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:49,314 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:14:49,315 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:14:49,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:14:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 18. [2019-08-05 11:14:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:14:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 11:14:49,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-08-05 11:14:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:49,319 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 11:14:49,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:14:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 11:14:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:14:49,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:49,320 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 11:14:49,320 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:49,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:49,321 INFO L82 PathProgramCache]: Analyzing trace with hash 835799458, now seen corresponding path program 11 times [2019-08-05 11:14:49,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:49,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:14:49,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:49,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:14:49,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:49,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:49,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:49,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:14:49,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:49,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:14:49,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:49,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:49,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:49,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-08-05 11:14:49,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:49,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:49,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2019-08-05 11:14:49,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:49,679 INFO L567 ElimStorePlain]: treesize reduction 28, result has 46.2 percent of original size [2019-08-05 11:14:49,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:49,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-08-05 11:14:49,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:49,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:49,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:14:49,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:50,052 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-08-05 11:14:50,053 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:14:50,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:50,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:50,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:50,185 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:50,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:14:50,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:50,258 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:14:50,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:50,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:50,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:50,354 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:50,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:14:50,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:50,399 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:14:50,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:50,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:50,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:50,483 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:50,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:14:50,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:50,551 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:14:50,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:50,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:50,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:50,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:50,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:14:50,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:50,733 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:14:50,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:50,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:50,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:50,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:50,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:14:50,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:51,034 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:14:51,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:51,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:51,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:51,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:51,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:14:51,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:51,227 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:14:51,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:51,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:51,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:14:51,329 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:51,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:14:51,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:51,408 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:14:51,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:51,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 11:14:51,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:51,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:51,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:51,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:51,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:51,510 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-08-05 11:14:51,681 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:14:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:51,768 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 11:14:51,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:51,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-08-05 11:14:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:51,769 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:14:51,769 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:14:51,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 8 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:14:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 11:14:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-08-05 11:14:51,772 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2019-08-05 11:14:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:51,772 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-08-05 11:14:51,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-08-05 11:14:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:14:51,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:51,773 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-08-05 11:14:51,774 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash 139979466, now seen corresponding path program 1 times [2019-08-05 11:14:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:51,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:51,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:51,848 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:51,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 31 [2019-08-05 11:14:51,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:51,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:51,873 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-08-05 11:14:51,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:51,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-08-05 11:14:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-08-05 11:14:51,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:51,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:51,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:51,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:51,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:51,885 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2019-08-05 11:14:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:51,938 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 11:14:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:51,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-08-05 11:14:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:51,939 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:14:51,940 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:14:51,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:14:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:14:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:14:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 11:14:51,944 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-08-05 11:14:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:51,944 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 11:14:51,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 11:14:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:14:51,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:51,945 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1, 1] [2019-08-05 11:14:51,946 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:51,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1376281932, now seen corresponding path program 1 times [2019-08-05 11:14:51,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:51,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:14:51,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:52,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:14:52,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:14:52,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:14:52,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 11:14:52,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:14:52,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2019-08-05 11:14:52,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:14:52,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2019-08-05 11:14:52,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:14:52,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2019-08-05 11:14:52,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-08-05 11:14:52,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,438 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 11:14:52,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:52,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2019-08-05 11:14:52,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2019-08-05 11:14:52,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2019-08-05 11:14:52,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2019-08-05 11:14:52,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2019-08-05 11:14:52,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:49 [2019-08-05 11:14:52,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2019-08-05 11:14:52,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:52,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:52,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2019-08-05 11:14:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:52,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:52,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:14:52,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:14:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:14:52,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:14:52,934 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2019-08-05 11:14:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:54,262 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:14:54,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:54,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-08-05 11:14:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:54,264 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:14:54,264 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:14:54,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:14:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:14:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:14:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:14:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:14:54,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-08-05 11:14:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:54,267 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:14:54,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:14:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:14:54,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:14:54,273 INFO L202 PluginConnector]: Adding new model EasyArrayStore.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:14:54 BoogieIcfgContainer [2019-08-05 11:14:54,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:14:54,275 INFO L168 Benchmark]: Toolchain (without parser) took 9630.00 ms. Allocated memory was 141.6 MB in the beginning and 277.3 MB in the end (delta: 135.8 MB). Free memory was 111.1 MB in the beginning and 168.5 MB in the end (delta: -57.4 MB). Peak memory consumption was 78.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:54,276 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:14:54,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.50 ms. Allocated memory is still 141.6 MB. Free memory was 111.1 MB in the beginning and 109.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:54,277 INFO L168 Benchmark]: Boogie Preprocessor took 20.81 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:54,278 INFO L168 Benchmark]: RCFGBuilder took 371.98 ms. Allocated memory is still 141.6 MB. Free memory was 107.9 MB in the beginning and 98.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:54,279 INFO L168 Benchmark]: TraceAbstraction took 9199.33 ms. Allocated memory was 141.6 MB in the beginning and 277.3 MB in the end (delta: 135.8 MB). Free memory was 97.8 MB in the beginning and 168.5 MB in the end (delta: -70.6 MB). Peak memory consumption was 65.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:54,282 INFO L335 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.21 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.50 ms. Allocated memory is still 141.6 MB. Free memory was 111.1 MB in the beginning and 109.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.81 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 371.98 ms. Allocated memory is still 141.6 MB. Free memory was 107.9 MB in the beginning and 98.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9199.33 ms. Allocated memory was 141.6 MB in the beginning and 277.3 MB in the end (delta: 135.8 MB). Free memory was 97.8 MB in the beginning and 168.5 MB in the end (delta: -70.6 MB). Peak memory consumption was 65.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 27]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 2 error locations. SAFE Result, 9.1s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 482 SDslu, 2 SDs, 0 SdLazy, 1038 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=12, 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.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 324 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 134 ConstructedInterpolants, 12 QuantifiedInterpolants, 17189 SizeOfPredicates, 1 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 111/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...