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/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:34:57,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:34:57,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:34:57,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:34:57,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:34:57,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:34:57,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:34:57,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:34:57,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:34:57,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:34:57,380 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:34:57,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:34:57,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:34:57,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:34:57,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:34:57,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:34:57,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:34:57,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:34:57,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:34:57,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:34:57,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:34:57,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:34:57,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:34:57,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:34:57,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:34:57,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:34:57,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:34:57,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:34:57,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:34:57,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:34:57,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:34:57,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:34:57,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:34:57,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:34:57,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:34:57,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:34:57,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:34:57,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:34:57,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:34:57,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:34:57,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:34:57,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:34:57,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:34:57,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:34:57,457 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:34:57,457 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:34:57,458 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-08-05 10:34:57,458 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-08-05 10:34:57,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:34:57,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:34:57,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:34:57,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:34:57,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:34:57,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/1) ... [2019-08-05 10:34:57,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/1) ... [2019-08-05 10:34:57,529 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:34:57,529 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:34:57,529 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:34:57,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:34:57,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:34:57,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:34:57,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:34:57,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/1) ... [2019-08-05 10:34:57,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/1) ... [2019-08-05 10:34:57,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/1) ... [2019-08-05 10:34:57,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/1) ... [2019-08-05 10:34:57,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/1) ... [2019-08-05 10:34:57,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/1) ... [2019-08-05 10:34:57,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/1) ... [2019-08-05 10:34:57,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:34:57,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:34:57,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:34:57,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:34:57,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (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 10:34:57,632 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:34:57,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:34:57,632 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-08-05 10:34:57,950 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:34:57,950 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:34:57,952 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:34:57 BoogieIcfgContainer [2019-08-05 10:34:57,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:34:57,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:34:57,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:34:57,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:34:57,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:34:57" (1/2) ... [2019-08-05 10:34:57,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32726f67 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:34:57, skipping insertion in model container [2019-08-05 10:34:57,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:34:57" (2/2) ... [2019-08-05 10:34:57,961 INFO L109 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-08-05 10:34:57,970 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:34:57,978 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:34:58,007 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:34:58,045 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:34:58,047 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:34:58,047 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:34:58,047 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:34:58,047 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:34:58,048 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:34:58,048 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:34:58,048 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:34:58,048 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:34:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:34:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:34:58,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:58,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:34:58,081 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-08-05 10:34:58,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:58,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:34:58,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,282 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 10:34:58,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:34:58,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:34:58,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:34:58,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:34:58,368 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 10:34:58,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:34:58,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:34:58,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:34:58,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:34:58,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:34:58,388 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 10:34:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:58,439 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:34:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:34:58,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:34:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:58,450 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:34:58,451 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:34:58,453 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 10:34:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:34:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:34:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:34:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:34:58,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-08-05 10:34:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:58,489 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:34:58,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:34:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:34:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:34:58,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:58,490 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 10:34:58,490 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:58,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:58,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1864331893, now seen corresponding path program 1 times [2019-08-05 10:34:58,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:58,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:34:58,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,541 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 10:34:58,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:34:58,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:34:58,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:34:58,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:34:58,639 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 10:34:58,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:58,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:34:58,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:34:58,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:34:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:34:58,643 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-08-05 10:34:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:58,722 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:34:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:34:58,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:34:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:58,723 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:34:58,724 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:34:58,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 10:34:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:34:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:34:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:34:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:34:58,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2019-08-05 10:34:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:58,730 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:34:58,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:34:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:34:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:34:58,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:58,731 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1] [2019-08-05 10:34:58,731 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:58,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2089621766, now seen corresponding path program 2 times [2019-08-05 10:34:58,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:58,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:34:58,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,813 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 10:34:58,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:34:58,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:34:58,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:34:58,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:34:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:58,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:58,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:34:58,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:34:58,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:34:58,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:34:58,987 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2019-08-05 10:34:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:59,053 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:34:59,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:34:59,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-05 10:34:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:59,054 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:34:59,054 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:34:59,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:34:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:34:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:34:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:34:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:34:59,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2019-08-05 10:34:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:59,059 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:34:59,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:34:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:34:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:34:59,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:59,060 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1] [2019-08-05 10:34:59,060 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash 666344661, now seen corresponding path program 3 times [2019-08-05 10:34:59,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:59,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:34:59,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:59,112 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 10:34:59,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:34:59,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:34:59,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:34:59,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:34:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:59,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:59,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:34:59,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:34:59,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:34:59,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:34:59,359 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2019-08-05 10:34:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:59,403 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:34:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:34:59,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-08-05 10:34:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:59,405 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:34:59,405 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:34:59,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 10:34:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:34:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:34:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:34:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:34:59,409 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2019-08-05 10:34:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:59,409 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:34:59,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:34:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:34:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:34:59,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:59,411 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2019-08-05 10:34:59,411 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash -264744282, now seen corresponding path program 4 times [2019-08-05 10:34:59,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:59,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:34:59,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:59,480 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 10:34:59,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:34:59,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:34:59,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:34:59,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:34:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:59,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:59,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:34:59,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:34:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:34:59,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:34:59,691 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2019-08-05 10:34:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:59,787 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:34:59,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:34:59,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-08-05 10:34:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:59,789 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:34:59,789 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:34:59,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:34:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:34:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:34:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:34:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:34:59,794 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2019-08-05 10:34:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:59,795 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:34:59,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:34:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:34:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:34:59,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:59,796 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1] [2019-08-05 10:34:59,797 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1436647627, now seen corresponding path program 5 times [2019-08-05 10:34:59,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:59,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:34:59,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:59,864 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 10:34:59,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:34:59,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:34:59,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:34:59,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:00,029 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 10:35:00,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:35:00,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:35:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:35:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:00,033 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2019-08-05 10:35:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:00,109 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:35:00,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:35:00,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-08-05 10:35:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:00,111 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:35:00,112 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:35:00,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:35:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:35:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:35:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:35:00,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2019-08-05 10:35:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:00,116 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:35:00,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:35:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:35:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:35:00,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:00,117 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1] [2019-08-05 10:35:00,117 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash 179950662, now seen corresponding path program 6 times [2019-08-05 10:35:00,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:00,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:35:00,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:00,190 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 10:35:00,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:00,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:00,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:00,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:00,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:35:00,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:35:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:35:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:00,659 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-08-05 10:35:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:00,735 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:35:00,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:35:00,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-08-05 10:35:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:00,741 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:35:00,742 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:35:00,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:35:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:35:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:35:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:35:00,747 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2019-08-05 10:35:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:00,747 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:35:00,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:35:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:35:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:35:00,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:00,748 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1] [2019-08-05 10:35:00,748 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:00,749 INFO L82 PathProgramCache]: Analyzing trace with hash 791288213, now seen corresponding path program 7 times [2019-08-05 10:35:00,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:00,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:35:00,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:00,823 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 10:35:00,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:00,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:00,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:00,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:00,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:35:01,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:35:01,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:35:01,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:01,001 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2019-08-05 10:35:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:01,052 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:35:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:35:01,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-08-05 10:35:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:01,054 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:35:01,055 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:35:01,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 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 10:35:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:35:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:35:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:35:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:35:01,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2019-08-05 10:35:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:01,061 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:35:01,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:35:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:35:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:35:01,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:01,062 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1] [2019-08-05 10:35:01,062 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:01,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:01,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1808032282, now seen corresponding path program 8 times [2019-08-05 10:35:01,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:01,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:35:01,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:01,120 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 10:35:01,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:01,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:01,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:01,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:01,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:01,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:35:01,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:35:01,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:35:01,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:01,424 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2019-08-05 10:35:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:01,503 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:35:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:35:01,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-08-05 10:35:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:01,505 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:35:01,505 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:35:01,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:35:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:35:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:35:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:35:01,510 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2019-08-05 10:35:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:01,510 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:35:01,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:35:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:35:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:35:01,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:01,512 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1] [2019-08-05 10:35:01,512 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:01,512 INFO L82 PathProgramCache]: Analyzing trace with hash 95448053, now seen corresponding path program 9 times [2019-08-05 10:35:01,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:01,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:35:01,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:01,580 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 10:35:01,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:01,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:01,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:01,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:01,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:35:01,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:35:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:35:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:01,873 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 12 states. [2019-08-05 10:35:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:01,917 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:35:01,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:35:01,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-08-05 10:35:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:01,919 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:35:01,919 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:35:01,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:35:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:35:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:35:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:35:01,924 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2019-08-05 10:35:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:01,925 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:35:01,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:35:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:35:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:35:01,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:01,926 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1] [2019-08-05 10:35:01,926 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:01,927 INFO L82 PathProgramCache]: Analyzing trace with hash 224898950, now seen corresponding path program 10 times [2019-08-05 10:35:01,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:01,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:35:01,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:01,996 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 10:35:01,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:02,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:02,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:02,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:02,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:02,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:35:02,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:35:02,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:35:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:02,230 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2019-08-05 10:35:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,337 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:35:02,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:35:02,338 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-08-05 10:35:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,339 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:35:02,339 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:35:02,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 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 10:35:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:35:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:35:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:35:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:35:02,344 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2019-08-05 10:35:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,344 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:35:02,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:35:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:35:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:35:02,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,346 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1] [2019-08-05 10:35:02,347 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,347 INFO L82 PathProgramCache]: Analyzing trace with hash -184060331, now seen corresponding path program 11 times [2019-08-05 10:35:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:02,459 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 10:35:02,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:02,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:02,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:02,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:02,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:02,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:35:02,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:35:02,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:35:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:02,727 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2019-08-05 10:35:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,980 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:35:02,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:35:02,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-08-05 10:35:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,983 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:35:02,984 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:35:02,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:35:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:35:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:35:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:35:02,988 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2019-08-05 10:35:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,989 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:35:02,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:35:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:35:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:35:02,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,991 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1] [2019-08-05 10:35:02,991 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1332218150, now seen corresponding path program 12 times [2019-08-05 10:35:02,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:03,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:35:03,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:03,082 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 10:35:03,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:03,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:03,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:03,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:03,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:03,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:35:03,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:35:03,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:35:03,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:03,627 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2019-08-05 10:35:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:03,818 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:35:03,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:35:03,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-08-05 10:35:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:03,819 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:35:03,820 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:35:03,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:35:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:35:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:35:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:35:03,824 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2019-08-05 10:35:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:03,824 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:35:03,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:35:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:35:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:35:03,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:03,825 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1] [2019-08-05 10:35:03,826 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:03,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1681573707, now seen corresponding path program 13 times [2019-08-05 10:35:03,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:03,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:35:03,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:03,908 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 10:35:03,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:03,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:03,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:03,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:04,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:04,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:35:04,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:35:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:35:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:04,249 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2019-08-05 10:35:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:04,304 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:35:04,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:35:04,304 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-08-05 10:35:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:04,305 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:35:04,305 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:35:04,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:35:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:35:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:35:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:35:04,311 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2019-08-05 10:35:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:04,311 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:35:04,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:35:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:35:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:35:04,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:04,312 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1] [2019-08-05 10:35:04,312 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash 736537286, now seen corresponding path program 14 times [2019-08-05 10:35:04,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:04,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:35:04,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:04,373 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 10:35:04,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:04,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:04,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:04,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:04,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:04,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:35:04,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:35:04,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:35:04,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:04,624 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2019-08-05 10:35:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:04,747 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:35:04,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:35:04,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-08-05 10:35:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:04,748 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:35:04,748 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:35:04,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:35:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:35:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:35:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:35:04,753 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2019-08-05 10:35:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:04,753 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:35:04,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:35:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:35:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:35:04,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:04,755 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1] [2019-08-05 10:35:04,755 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:04,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash -805326059, now seen corresponding path program 15 times [2019-08-05 10:35:04,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:04,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:35:04,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:04,832 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 10:35:04,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:04,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:04,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:04,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:05,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:05,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:35:05,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:35:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:35:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:05,302 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2019-08-05 10:35:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:05,364 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:35:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:35:05,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-08-05 10:35:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:05,365 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:35:05,365 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:35:05,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:35:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:35:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:35:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:35:05,370 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2019-08-05 10:35:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:05,370 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:35:05,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:35:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:35:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:35:05,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:05,372 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1] [2019-08-05 10:35:05,372 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:05,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:05,372 INFO L82 PathProgramCache]: Analyzing trace with hash 218993766, now seen corresponding path program 16 times [2019-08-05 10:35:05,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:05,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:35:05,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:05,427 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 10:35:05,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:05,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:05,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:05,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:05,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:05,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:35:05,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:35:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:35:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:05,693 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 19 states. [2019-08-05 10:35:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:05,813 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:35:05,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:35:05,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-08-05 10:35:05,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:05,814 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:35:05,814 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:35:05,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:35:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:35:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:35:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:35:05,819 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2019-08-05 10:35:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:05,819 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:35:05,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:35:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:35:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:35:05,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:05,820 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1] [2019-08-05 10:35:05,821 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash -11737739, now seen corresponding path program 17 times [2019-08-05 10:35:05,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:05,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:35:05,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:05,897 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 10:35:05,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:05,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:05,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:05,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:06,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:06,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:35:06,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:35:06,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:35:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:06,422 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 20 states. [2019-08-05 10:35:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:06,553 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:35:06,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:35:06,555 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-08-05 10:35:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:06,556 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:35:06,556 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:35:06,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:35:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:35:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:35:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:35:06,560 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2019-08-05 10:35:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:06,561 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:35:06,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:35:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:35:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:35:06,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:06,562 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1] [2019-08-05 10:35:06,562 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:06,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1786329594, now seen corresponding path program 18 times [2019-08-05 10:35:06,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:06,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:35:06,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:06,635 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 10:35:06,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:06,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:06,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:06,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:07,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:07,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:35:07,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:35:07,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:35:07,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:07,007 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 21 states. [2019-08-05 10:35:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:07,085 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:35:07,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:35:07,085 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2019-08-05 10:35:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:07,086 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:35:07,086 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:35:07,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:07,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:35:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:35:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:35:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:35:07,091 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2019-08-05 10:35:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:07,091 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:35:07,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:35:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:35:07,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:35:07,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:07,093 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1] [2019-08-05 10:35:07,093 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1899835435, now seen corresponding path program 19 times [2019-08-05 10:35:07,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:07,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:35:07,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:07,177 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 10:35:07,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:07,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:07,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:07,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:07,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:07,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:35:07,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:35:07,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:35:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:07,546 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 22 states. [2019-08-05 10:35:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:07,691 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:35:07,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:35:07,692 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2019-08-05 10:35:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:07,693 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:35:07,693 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:35:07,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:35:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:35:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:35:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:35:07,697 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2019-08-05 10:35:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:07,698 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:35:07,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:35:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:35:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:35:07,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:07,698 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1] [2019-08-05 10:35:07,698 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:07,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1081884582, now seen corresponding path program 20 times [2019-08-05 10:35:07,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:07,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:35:07,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:07,771 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 10:35:07,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:07,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:07,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:07,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:08,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:08,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:35:08,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:35:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:35:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:08,186 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 23 states. [2019-08-05 10:35:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:08,292 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:35:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:35:08,293 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2019-08-05 10:35:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:08,294 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:35:08,294 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:35:08,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:35:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:35:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:35:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:35:08,298 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2019-08-05 10:35:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:08,299 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:35:08,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:35:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:35:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:35:08,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:08,300 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1] [2019-08-05 10:35:08,300 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash 989295157, now seen corresponding path program 21 times [2019-08-05 10:35:08,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:08,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:35:08,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:08,384 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 10:35:08,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:08,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:08,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:08,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:08,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:08,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:35:08,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:35:08,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:35:08,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:08,892 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 24 states. [2019-08-05 10:35:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:09,001 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:35:09,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:35:09,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-08-05 10:35:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:09,004 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:35:09,004 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:35:09,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:35:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:35:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:35:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:35:09,007 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2019-08-05 10:35:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:09,007 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:35:09,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:35:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:35:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:35:09,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:09,008 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1] [2019-08-05 10:35:09,008 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:09,008 INFO L82 PathProgramCache]: Analyzing trace with hash 26739014, now seen corresponding path program 22 times [2019-08-05 10:35:09,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:09,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:35:09,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:09,083 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 10:35:09,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:09,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:09,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:09,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:09,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:09,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:35:09,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:35:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:35:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:09,944 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 25 states. [2019-08-05 10:35:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:10,034 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:35:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:35:10,035 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2019-08-05 10:35:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:10,036 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:35:10,036 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:35:10,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:35:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:35:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:35:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:35:10,040 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2019-08-05 10:35:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:10,041 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:35:10,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:35:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:35:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:35:10,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:10,042 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1] [2019-08-05 10:35:10,042 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:10,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2013318293, now seen corresponding path program 23 times [2019-08-05 10:35:10,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:10,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:35:10,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:10,119 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 10:35:10,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:10,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:10,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:10,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:10,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:10,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:35:10,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:35:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:35:10,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:10,717 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 26 states. [2019-08-05 10:35:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:10,812 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:35:10,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:35:10,812 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2019-08-05 10:35:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:10,813 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:35:10,813 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:35:10,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:35:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:35:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:35:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:35:10,817 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2019-08-05 10:35:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:10,817 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:35:10,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:35:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:35:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:35:10,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:10,818 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1] [2019-08-05 10:35:10,819 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash -452719898, now seen corresponding path program 24 times [2019-08-05 10:35:10,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:10,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:35:10,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:10,896 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 10:35:10,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:10,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:10,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:10,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:12,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:12,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:35:12,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:35:12,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:35:12,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:12,023 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 27 states. [2019-08-05 10:35:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:12,127 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:35:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:35:12,128 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2019-08-05 10:35:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:12,129 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:35:12,129 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:35:12,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:35:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:35:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:35:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:35:12,132 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2019-08-05 10:35:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:12,132 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:35:12,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:35:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:35:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:35:12,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:12,133 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1] [2019-08-05 10:35:12,134 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:12,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:12,134 INFO L82 PathProgramCache]: Analyzing trace with hash -780869899, now seen corresponding path program 25 times [2019-08-05 10:35:12,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:12,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:35:12,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:12,211 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 10:35:12,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:12,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:12,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:12,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:13,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:13,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:35:13,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:35:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:35:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:13,749 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 28 states. [2019-08-05 10:35:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:13,851 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:35:13,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:35:13,852 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2019-08-05 10:35:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:13,853 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:35:13,853 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:35:13,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:35:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:35:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:35:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:35:13,856 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2019-08-05 10:35:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:13,857 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:35:13,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:35:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:35:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:35:13,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:13,858 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1] [2019-08-05 10:35:13,858 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:13,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1351983994, now seen corresponding path program 26 times [2019-08-05 10:35:13,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:13,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:35:13,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:13,933 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 10:35:13,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:13,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:13,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:13,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:15,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:15,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:35:15,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:35:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:35:15,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:15,023 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 29 states. [2019-08-05 10:35:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:15,192 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:35:15,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:35:15,192 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2019-08-05 10:35:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:15,194 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:35:15,194 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:35:15,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:35:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:35:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:35:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:35:15,198 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2019-08-05 10:35:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:15,198 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:35:15,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:35:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:35:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:35:15,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:15,199 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1] [2019-08-05 10:35:15,199 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:15,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1248438613, now seen corresponding path program 27 times [2019-08-05 10:35:15,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:15,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:35:15,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:15,276 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 10:35:15,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:15,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:15,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:15,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:15,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:15,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:35:15,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:35:15,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:35:15,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:15,863 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 30 states. [2019-08-05 10:35:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:15,950 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:35:15,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:35:15,950 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2019-08-05 10:35:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:15,951 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:35:15,952 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:35:15,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:35:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:35:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:35:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:35:15,955 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2019-08-05 10:35:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:15,955 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:35:15,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:35:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:35:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:35:15,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:15,956 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1] [2019-08-05 10:35:15,956 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2113205798, now seen corresponding path program 28 times [2019-08-05 10:35:15,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:15,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:35:15,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:16,029 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 10:35:16,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:16,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:16,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:16,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:16,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:16,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:35:16,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:35:16,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:35:16,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:16,855 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 31 states. [2019-08-05 10:35:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:17,000 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:35:17,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:35:17,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2019-08-05 10:35:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:17,001 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:35:17,001 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:35:17,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:35:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:35:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:35:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:35:17,005 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2019-08-05 10:35:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:17,006 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:35:17,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:35:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:35:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:35:17,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:17,006 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1] [2019-08-05 10:35:17,007 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1116394571, now seen corresponding path program 29 times [2019-08-05 10:35:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:17,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:35:17,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:17,063 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 10:35:17,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:17,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:17,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:17,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 0 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:17,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:17,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:35:17,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:35:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:35:17,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:17,808 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 32 states. [2019-08-05 10:35:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:17,934 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:35:17,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:35:17,934 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2019-08-05 10:35:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:17,935 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:35:17,936 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:35:17,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:35:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:35:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:35:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:35:17,940 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2019-08-05 10:35:17,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:17,940 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:35:17,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:35:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:35:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:35:17,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:17,941 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1] [2019-08-05 10:35:17,941 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1716377542, now seen corresponding path program 30 times [2019-08-05 10:35:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:17,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:35:17,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:18,019 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 10:35:18,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:18,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:18,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:18,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:18,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:18,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:35:18,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:35:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:35:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:18,652 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 33 states. [2019-08-05 10:35:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:18,756 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:35:18,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:35:18,757 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-08-05 10:35:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:18,758 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:35:18,758 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:35:18,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:35:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:35:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:35:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:35:18,762 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2019-08-05 10:35:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:18,762 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:35:18,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:35:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:35:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:35:18,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:18,763 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1] [2019-08-05 10:35:18,763 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1017996821, now seen corresponding path program 31 times [2019-08-05 10:35:18,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:18,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:35:18,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:18,844 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 10:35:18,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:18,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:18,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:18,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 0 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:19,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:35:19,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:35:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:35:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:19,496 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 34 states. [2019-08-05 10:35:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:19,613 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:35:19,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:35:19,613 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2019-08-05 10:35:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:19,614 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:35:19,614 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:35:19,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:35:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:35:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:35:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:35:19,618 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2019-08-05 10:35:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:19,618 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:35:19,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:35:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:35:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:35:19,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:19,619 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1] [2019-08-05 10:35:19,619 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:19,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:19,620 INFO L82 PathProgramCache]: Analyzing trace with hash 379519334, now seen corresponding path program 32 times [2019-08-05 10:35:19,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:19,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:35:19,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:19,685 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 10:35:19,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:19,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:19,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:19,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:20,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:20,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:35:20,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:35:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:35:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:35:20,352 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 35 states. [2019-08-05 10:35:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:20,466 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:35:20,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:35:20,466 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-08-05 10:35:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:20,467 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:35:20,468 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:35:20,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:35:20,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:35:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:35:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:35:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:35:20,472 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2019-08-05 10:35:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:20,472 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:35:20,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:35:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:35:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:35:20,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:20,473 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1] [2019-08-05 10:35:20,474 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:20,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:20,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1906858101, now seen corresponding path program 33 times [2019-08-05 10:35:20,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:20,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:35:20,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:20,555 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 10:35:20,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:20,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:20,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:20,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:21,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:21,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:35:21,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:35:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:35:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:35:21,946 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 36 states. [2019-08-05 10:35:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:22,072 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:35:22,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:35:22,073 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2019-08-05 10:35:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:22,074 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:35:22,074 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:35:22,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:35:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:35:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:35:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:35:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:35:22,078 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2019-08-05 10:35:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:22,079 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:35:22,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:35:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:35:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:35:22,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:22,080 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1] [2019-08-05 10:35:22,080 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:22,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1972531974, now seen corresponding path program 34 times [2019-08-05 10:35:22,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:22,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:35:22,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:22,155 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 10:35:22,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:22,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:22,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:22,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 0 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:22,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:22,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:35:22,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:35:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:35:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:35:22,895 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 37 states. [2019-08-05 10:35:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:23,020 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:35:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:35:23,026 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2019-08-05 10:35:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:23,027 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:35:23,027 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:35:23,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:35:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:35:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:35:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:35:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:35:23,031 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2019-08-05 10:35:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:23,031 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:35:23,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:35:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:35:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:35:23,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:23,032 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1] [2019-08-05 10:35:23,032 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:23,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:23,033 INFO L82 PathProgramCache]: Analyzing trace with hash -42204459, now seen corresponding path program 35 times [2019-08-05 10:35:23,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:23,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:35:23,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:23,110 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 10:35:23,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:23,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:23,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:23,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:24,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:24,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:35:24,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:35:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:35:24,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:35:24,119 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 38 states. [2019-08-05 10:35:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:24,296 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:35:24,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:35:24,297 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2019-08-05 10:35:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:24,298 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:35:24,298 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:35:24,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:35:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:35:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:35:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:35:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:35:24,302 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2019-08-05 10:35:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:24,302 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:35:24,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:35:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:35:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:35:24,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:24,303 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1] [2019-08-05 10:35:24,303 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1112681638, now seen corresponding path program 36 times [2019-08-05 10:35:24,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:24,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:35:24,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:24,396 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 10:35:24,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:24,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:24,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:24,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:25,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:25,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:35:25,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:35:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:35:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:35:25,415 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 39 states. [2019-08-05 10:35:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:25,536 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:35:25,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:35:25,536 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 112 [2019-08-05 10:35:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:25,537 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:35:25,538 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:35:25,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:35:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:35:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:35:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:35:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:35:25,542 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2019-08-05 10:35:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:25,543 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:35:25,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:35:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:35:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:35:25,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:25,544 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1] [2019-08-05 10:35:25,544 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:25,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash -658610891, now seen corresponding path program 37 times [2019-08-05 10:35:25,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:25,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:35:25,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:25,612 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 10:35:25,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:25,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:25,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:25,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 0 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:26,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:26,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:35:26,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:35:26,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:35:26,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:35:26,439 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 40 states. [2019-08-05 10:35:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:26,566 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:35:26,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:35:26,567 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2019-08-05 10:35:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:26,568 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:35:26,568 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:35:26,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:35:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:35:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:35:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:35:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:35:26,571 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2019-08-05 10:35:26,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:26,572 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:35:26,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:35:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:35:26,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:35:26,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:26,573 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1] [2019-08-05 10:35:26,573 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1266143674, now seen corresponding path program 38 times [2019-08-05 10:35:26,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:26,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:35:26,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:26,653 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 10:35:26,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:26,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:26,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:26,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:27,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:27,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:35:27,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:35:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:35:27,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:35:27,963 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 41 states. [2019-08-05 10:35:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:28,105 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:35:28,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:35:28,106 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2019-08-05 10:35:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:28,107 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:35:28,107 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:35:28,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:35:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:35:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:35:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:35:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:35:28,110 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2019-08-05 10:35:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:28,110 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:35:28,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:35:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:35:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:35:28,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:28,111 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1] [2019-08-05 10:35:28,111 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1283096683, now seen corresponding path program 39 times [2019-08-05 10:35:28,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:28,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:35:28,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:28,198 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 10:35:28,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:28,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:28,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:28,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:29,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:35:29,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:35:29,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:35:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:35:29,187 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 42 states. [2019-08-05 10:35:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,324 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 10:35:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:35:29,325 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2019-08-05 10:35:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,326 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:35:29,326 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:35:29,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:35:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:35:29,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:35:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:35:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:35:29,330 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2019-08-05 10:35:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,330 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:35:29,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:35:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:35:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:35:29,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,331 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1] [2019-08-05 10:35:29,332 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,332 INFO L82 PathProgramCache]: Analyzing trace with hash 475953126, now seen corresponding path program 40 times [2019-08-05 10:35:29,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,415 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 10:35:29,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:29,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:29,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:29,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 0 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:30,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:35:30,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:35:30,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:35:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:35:30,476 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 43 states. [2019-08-05 10:35:30,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,658 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-08-05 10:35:30,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:35:30,664 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2019-08-05 10:35:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,665 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:35:30,665 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:35:30,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:35:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:35:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 10:35:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:35:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 10:35:30,669 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2019-08-05 10:35:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,670 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 10:35:30,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:35:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 10:35:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:35:30,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,671 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1] [2019-08-05 10:35:30,671 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1432834549, now seen corresponding path program 41 times [2019-08-05 10:35:30,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:30,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:35:30,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,772 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 10:35:30,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:30,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:30,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:30,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 0 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:32,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:32,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:35:32,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:35:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:35:32,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:35:32,708 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 44 states. [2019-08-05 10:35:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:32,902 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 10:35:32,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:35:32,902 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2019-08-05 10:35:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:32,904 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:35:32,904 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:35:32,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:35:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:35:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 10:35:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:35:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-08-05 10:35:32,908 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2019-08-05 10:35:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:32,909 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-08-05 10:35:32,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:35:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-08-05 10:35:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:35:32,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:32,910 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1] [2019-08-05 10:35:32,910 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:32,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:32,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2105603706, now seen corresponding path program 42 times [2019-08-05 10:35:32,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:32,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:35:32,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:32,992 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 10:35:32,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:33,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:33,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:33,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 0 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:34,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:34,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:35:34,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:35:34,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:35:34,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:35:34,024 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 45 states. [2019-08-05 10:35:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:34,168 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-08-05 10:35:34,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:35:34,168 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 130 [2019-08-05 10:35:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:34,170 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:35:34,170 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:35:34,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:35:34,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:35:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-05 10:35:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:35:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 10:35:34,174 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2019-08-05 10:35:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:34,174 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 10:35:34,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:35:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 10:35:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:35:34,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:34,175 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1] [2019-08-05 10:35:34,175 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:34,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:34,175 INFO L82 PathProgramCache]: Analyzing trace with hash -42345387, now seen corresponding path program 43 times [2019-08-05 10:35:34,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:34,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:35:34,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:34,278 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 10:35:34,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:34,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:34,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:34,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 0 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:35,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:35,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:35:35,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:35:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:35:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:35:35,774 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 46 states. [2019-08-05 10:35:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:35,946 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 10:35:35,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:35:35,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2019-08-05 10:35:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:35,947 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:35:35,947 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:35:35,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:35:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:35:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 10:35:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:35:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-05 10:35:35,951 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2019-08-05 10:35:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:35,952 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-05 10:35:35,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:35:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-05 10:35:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:35:35,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:35,953 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1] [2019-08-05 10:35:35,953 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:35,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1209262886, now seen corresponding path program 44 times [2019-08-05 10:35:35,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:36,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:35:36,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:36,031 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 10:35:36,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:36,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:36,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:36,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:37,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:37,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:35:37,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:35:37,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:35:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:35:37,445 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 47 states. [2019-08-05 10:35:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:37,726 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-05 10:35:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:35:37,727 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2019-08-05 10:35:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:37,728 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:35:37,728 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:35:37,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:35:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:35:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 10:35:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:35:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:35:37,731 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2019-08-05 10:35:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:37,731 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:35:37,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:35:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:35:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:35:37,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:37,733 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1] [2019-08-05 10:35:37,733 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1034740043, now seen corresponding path program 45 times [2019-08-05 10:35:37,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:37,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:35:37,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:37,828 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 10:35:37,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:37,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:37,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:37,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:39,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:39,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:35:39,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:35:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:35:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:35:39,148 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 48 states. [2019-08-05 10:35:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:39,302 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-05 10:35:39,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:35:39,303 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2019-08-05 10:35:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:39,304 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:35:39,304 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:35:39,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:35:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:35:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-05 10:35:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:35:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-08-05 10:35:39,308 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2019-08-05 10:35:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:39,309 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-08-05 10:35:39,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:35:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-08-05 10:35:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 10:35:39,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:39,310 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1] [2019-08-05 10:35:39,310 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:39,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash -960035642, now seen corresponding path program 46 times [2019-08-05 10:35:39,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:39,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:35:39,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:39,405 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 10:35:39,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:39,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:39,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:39,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:40,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:40,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:35:40,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:35:40,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:35:40,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:35:40,573 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 49 states. [2019-08-05 10:35:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:40,727 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-08-05 10:35:40,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:35:40,727 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 142 [2019-08-05 10:35:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:40,728 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:35:40,728 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:35:40,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:35:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:35:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-08-05 10:35:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:35:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 10:35:40,732 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2019-08-05 10:35:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:40,732 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 10:35:40,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:35:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 10:35:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 10:35:40,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:40,733 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1] [2019-08-05 10:35:40,734 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:40,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:40,734 INFO L82 PathProgramCache]: Analyzing trace with hash -234284779, now seen corresponding path program 47 times [2019-08-05 10:35:40,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:40,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:35:40,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:40,821 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 10:35:40,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:40,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:40,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:40,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 0 proven. 3384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:42,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:42,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:35:42,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:35:42,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:35:42,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:35:42,987 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 50 states. [2019-08-05 10:35:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:43,146 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 10:35:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:35:43,146 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 145 [2019-08-05 10:35:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:43,147 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:35:43,148 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:35:43,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:35:43,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:35:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-05 10:35:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:35:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-08-05 10:35:43,152 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2019-08-05 10:35:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:43,152 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-08-05 10:35:43,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:35:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-08-05 10:35:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:35:43,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:43,153 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1] [2019-08-05 10:35:43,153 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash -255693210, now seen corresponding path program 48 times [2019-08-05 10:35:43,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:43,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:35:43,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:43,260 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 10:35:43,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:43,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:43,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:43,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:44,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:44,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:35:44,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:35:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:35:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:35:44,459 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 51 states. [2019-08-05 10:35:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:44,739 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2019-08-05 10:35:44,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:35:44,739 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 148 [2019-08-05 10:35:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:44,741 INFO L225 Difference]: With dead ends: 152 [2019-08-05 10:35:44,741 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 10:35:44,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:35:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 10:35:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-08-05 10:35:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:35:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 10:35:44,747 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2019-08-05 10:35:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:44,747 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 10:35:44,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:35:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 10:35:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 10:35:44,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:44,748 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1] [2019-08-05 10:35:44,748 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1915865973, now seen corresponding path program 49 times [2019-08-05 10:35:44,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:44,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:35:44,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:44,857 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 10:35:44,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:44,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:44,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:44,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:46,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:46,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:35:46,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:35:46,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:35:46,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:35:46,232 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 52 states. [2019-08-05 10:35:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:46,409 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-05 10:35:46,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:35:46,410 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 151 [2019-08-05 10:35:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:46,411 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:35:46,411 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:35:46,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:35:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:35:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-05 10:35:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 10:35:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-08-05 10:35:46,415 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2019-08-05 10:35:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:46,416 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-08-05 10:35:46,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:35:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-08-05 10:35:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-05 10:35:46,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:46,417 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1] [2019-08-05 10:35:46,417 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:46,418 INFO L82 PathProgramCache]: Analyzing trace with hash -256892922, now seen corresponding path program 50 times [2019-08-05 10:35:46,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:46,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:35:46,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:46,539 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 10:35:46,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:46,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:46,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:46,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 3825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:48,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:48,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:35:48,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:35:48,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:35:48,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:35:48,588 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 53 states. [2019-08-05 10:35:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:48,783 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-08-05 10:35:48,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:35:48,784 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 154 [2019-08-05 10:35:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:48,785 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:35:48,786 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:35:48,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:35:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:35:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-05 10:35:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:35:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 10:35:48,789 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2019-08-05 10:35:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:48,790 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 10:35:48,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:35:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 10:35:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:35:48,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:48,894 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1] [2019-08-05 10:35:48,894 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash 534984149, now seen corresponding path program 51 times [2019-08-05 10:35:48,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:48,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:35:48,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:49,002 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 10:35:49,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:49,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:49,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:49,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 0 proven. 3978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:50,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:50,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:35:50,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:35:50,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:35:50,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:35:50,409 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 54 states. [2019-08-05 10:35:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:50,785 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-05 10:35:50,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:35:50,786 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 157 [2019-08-05 10:35:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:50,787 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:35:50,787 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 10:35:50,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:35:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 10:35:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-08-05 10:35:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:35:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-08-05 10:35:50,791 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2019-08-05 10:35:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:50,791 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-08-05 10:35:50,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:35:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-08-05 10:35:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-05 10:35:50,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:50,792 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1] [2019-08-05 10:35:50,792 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash -910550618, now seen corresponding path program 52 times [2019-08-05 10:35:50,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:50,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:35:50,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:50,870 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 10:35:50,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:50,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:50,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:50,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 0 proven. 4134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:52,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:52,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:35:52,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:35:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:35:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:35:52,241 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 55 states. [2019-08-05 10:35:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:52,486 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-05 10:35:52,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:35:52,487 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 160 [2019-08-05 10:35:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:52,488 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:35:52,488 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:35:52,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:35:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:35:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 10:35:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:35:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 10:35:52,493 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2019-08-05 10:35:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:52,493 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 10:35:52,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:35:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 10:35:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:35:52,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:52,494 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1] [2019-08-05 10:35:52,494 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash 800282677, now seen corresponding path program 53 times [2019-08-05 10:35:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:52,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:35:52,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:52,612 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 10:35:52,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:52,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:52,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:52,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 0 proven. 4293 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:54,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:54,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:35:54,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:35:54,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:35:54,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:35:54,833 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 56 states. [2019-08-05 10:35:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:55,043 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-08-05 10:35:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:35:55,044 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 163 [2019-08-05 10:35:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:55,045 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:35:55,045 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:35:55,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:35:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:35:55,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-08-05 10:35:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-05 10:35:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-08-05 10:35:55,048 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2019-08-05 10:35:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:55,048 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-08-05 10:35:55,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:35:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-08-05 10:35:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:35:55,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:55,049 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1] [2019-08-05 10:35:55,049 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:55,050 INFO L82 PathProgramCache]: Analyzing trace with hash -141927610, now seen corresponding path program 54 times [2019-08-05 10:35:55,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:55,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:35:55,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:55,183 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 10:35:55,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:55,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:55,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:55,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:35:56,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:35:56,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:35:56,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:35:56,774 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 57 states. [2019-08-05 10:35:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:56,974 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-08-05 10:35:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:35:56,974 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 166 [2019-08-05 10:35:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:56,976 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:35:56,976 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:35:56,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:35:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:35:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-08-05 10:35:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 10:35:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 10:35:56,979 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2019-08-05 10:35:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:56,980 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 10:35:56,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:35:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 10:35:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 10:35:56,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:56,981 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1] [2019-08-05 10:35:56,981 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:56,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:56,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1917308267, now seen corresponding path program 55 times [2019-08-05 10:35:56,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:57,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:35:57,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:57,095 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 10:35:57,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:57,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:57,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:57,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 0 proven. 4620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:58,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:58,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:35:58,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:35:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:35:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:35:58,959 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 58 states. [2019-08-05 10:35:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:59,219 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-08-05 10:35:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:35:59,219 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 169 [2019-08-05 10:35:59,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:59,220 INFO L225 Difference]: With dead ends: 173 [2019-08-05 10:35:59,220 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 10:35:59,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:35:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 10:35:59,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-08-05 10:35:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:35:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-08-05 10:35:59,225 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2019-08-05 10:35:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:59,225 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-08-05 10:35:59,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:35:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-08-05 10:35:59,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 10:35:59,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:59,226 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1] [2019-08-05 10:35:59,226 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:59,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:59,227 INFO L82 PathProgramCache]: Analyzing trace with hash 239789286, now seen corresponding path program 56 times [2019-08-05 10:35:59,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:59,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:35:59,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:59,341 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 10:35:59,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:59,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:59,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:59,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 0 proven. 4788 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:01,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:01,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:36:01,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:36:01,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:36:01,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:36:01,077 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 59 states. [2019-08-05 10:36:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:01,286 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-08-05 10:36:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:36:01,287 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 172 [2019-08-05 10:36:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:01,288 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:36:01,288 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:36:01,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:36:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:36:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-05 10:36:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:36:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 10:36:01,291 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2019-08-05 10:36:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:01,292 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 10:36:01,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:36:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 10:36:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:36:01,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:01,293 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1] [2019-08-05 10:36:01,293 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1032307957, now seen corresponding path program 57 times [2019-08-05 10:36:01,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:01,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:36:01,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:01,416 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 10:36:01,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:01,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:01,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:01,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 0 proven. 4959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:03,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:03,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:36:03,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:36:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:36:03,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:36:03,481 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 60 states. [2019-08-05 10:36:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:03,754 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-08-05 10:36:03,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:36:03,754 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 175 [2019-08-05 10:36:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:03,755 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:36:03,756 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:36:03,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:36:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:36:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-08-05 10:36:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-05 10:36:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-08-05 10:36:03,761 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2019-08-05 10:36:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:03,761 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-08-05 10:36:03,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:36:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-08-05 10:36:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:36:03,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:03,762 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1] [2019-08-05 10:36:03,762 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1520809606, now seen corresponding path program 58 times [2019-08-05 10:36:03,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:03,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-05 10:36:03,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:03,889 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 10:36:03,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:03,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:03,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:03,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 0 proven. 5133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:05,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:36:05,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:36:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:36:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:36:05,885 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 61 states. [2019-08-05 10:36:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:06,109 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-08-05 10:36:06,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:36:06,110 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 178 [2019-08-05 10:36:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:06,111 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:36:06,112 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:36:06,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:36:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:36:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-08-05 10:36:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 10:36:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-05 10:36:06,115 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2019-08-05 10:36:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:06,116 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-05 10:36:06,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:36:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-05 10:36:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 10:36:06,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:06,117 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 1, 1] [2019-08-05 10:36:06,117 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:06,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1170731179, now seen corresponding path program 59 times [2019-08-05 10:36:06,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:06,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 10:36:06,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:06,214 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 10:36:06,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:06,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:06,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:06,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 0 proven. 5310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:08,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:08,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:36:08,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:36:08,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:36:08,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:36:08,273 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 62 states. [2019-08-05 10:36:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:08,582 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-08-05 10:36:08,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:36:08,583 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 181 [2019-08-05 10:36:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:08,584 INFO L225 Difference]: With dead ends: 185 [2019-08-05 10:36:08,584 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 10:36:08,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:36:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 10:36:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-08-05 10:36:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:36:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-08-05 10:36:08,589 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2019-08-05 10:36:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:08,589 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-08-05 10:36:08,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:36:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-08-05 10:36:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-05 10:36:08,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:08,591 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 60, 1, 1] [2019-08-05 10:36:08,591 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:08,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:08,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2117808090, now seen corresponding path program 60 times [2019-08-05 10:36:08,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:08,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:36:08,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:08,729 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 10:36:08,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:08,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:08,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:08,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 0 proven. 5490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:10,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:10,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:36:10,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:36:10,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:36:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:36:10,653 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 63 states. [2019-08-05 10:36:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:10,874 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2019-08-05 10:36:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:36:10,875 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 184 [2019-08-05 10:36:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:10,876 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:36:10,876 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 10:36:10,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:36:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 10:36:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-05 10:36:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:36:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-05 10:36:10,880 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2019-08-05 10:36:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:10,880 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-05 10:36:10,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:36:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-05 10:36:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 10:36:10,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:10,882 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 61, 1, 1] [2019-08-05 10:36:10,882 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:10,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1449071029, now seen corresponding path program 61 times [2019-08-05 10:36:10,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:10,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:36:10,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:10,986 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 10:36:10,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:11,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:11,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:11,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 0 proven. 5673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:12,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:12,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:36:12,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:36:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:36:12,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:36:12,838 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 64 states. [2019-08-05 10:36:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:13,161 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-08-05 10:36:13,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:36:13,161 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 187 [2019-08-05 10:36:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:13,162 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:36:13,162 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 10:36:13,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:36:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 10:36:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-08-05 10:36:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-08-05 10:36:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-08-05 10:36:13,165 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2019-08-05 10:36:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:13,165 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-08-05 10:36:13,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:36:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-08-05 10:36:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-08-05 10:36:13,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:13,166 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 62, 1, 1] [2019-08-05 10:36:13,166 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash 559034822, now seen corresponding path program 62 times [2019-08-05 10:36:13,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:13,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 10:36:13,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:13,254 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 10:36:13,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:13,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:13,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:13,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 0 proven. 5859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:15,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:15,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:36:15,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:36:15,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:36:15,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:36:15,158 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 65 states. [2019-08-05 10:36:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:15,393 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-08-05 10:36:15,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:36:15,394 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 190 [2019-08-05 10:36:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:15,395 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:36:15,395 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:36:15,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:36:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:36:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-08-05 10:36:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 10:36:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-05 10:36:15,398 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2019-08-05 10:36:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:15,399 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-05 10:36:15,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:36:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-05 10:36:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 10:36:15,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:15,400 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 63, 1, 1] [2019-08-05 10:36:15,400 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1676489707, now seen corresponding path program 63 times [2019-08-05 10:36:15,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:15,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 10:36:15,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:15,532 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 10:36:15,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:15,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:15,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:15,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 0 proven. 6048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:17,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:17,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:36:17,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:36:17,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:36:17,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:36:17,518 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 66 states. [2019-08-05 10:36:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:17,753 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-08-05 10:36:17,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:36:17,754 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 193 [2019-08-05 10:36:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:17,755 INFO L225 Difference]: With dead ends: 197 [2019-08-05 10:36:17,756 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 10:36:17,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:36:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 10:36:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-08-05 10:36:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-05 10:36:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-08-05 10:36:17,759 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2019-08-05 10:36:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:17,760 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-08-05 10:36:17,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:36:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-08-05 10:36:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:36:17,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:17,761 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 64, 1, 1] [2019-08-05 10:36:17,761 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1870125926, now seen corresponding path program 64 times [2019-08-05 10:36:17,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:17,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:36:17,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:17,909 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 10:36:17,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:17,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:17,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:17,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 0 proven. 6240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:20,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:20,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:36:20,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:36:20,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:36:20,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:36:20,124 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 67 states. [2019-08-05 10:36:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:20,364 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-08-05 10:36:20,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:36:20,364 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 196 [2019-08-05 10:36:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:20,366 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:36:20,366 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:36:20,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:36:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:36:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-05 10:36:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:36:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-05 10:36:20,370 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2019-08-05 10:36:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:20,370 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-05 10:36:20,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:36:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-05 10:36:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 10:36:20,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:20,372 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 65, 1, 1] [2019-08-05 10:36:20,372 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1394000267, now seen corresponding path program 65 times [2019-08-05 10:36:20,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:20,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:36:20,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:20,502 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 10:36:20,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:20,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:20,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:20,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 0 proven. 6435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:22,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:22,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:36:22,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:36:22,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:36:22,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:36:22,711 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 68 states. [2019-08-05 10:36:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:22,955 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-05 10:36:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:36:22,955 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 199 [2019-08-05 10:36:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:22,957 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:36:22,957 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:36:22,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:36:22,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:36:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-08-05 10:36:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-05 10:36:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-08-05 10:36:22,960 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2019-08-05 10:36:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:22,960 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-08-05 10:36:22,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:36:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-08-05 10:36:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-05 10:36:22,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:22,961 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 66, 1, 1] [2019-08-05 10:36:22,961 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:22,962 INFO L82 PathProgramCache]: Analyzing trace with hash -622867194, now seen corresponding path program 66 times [2019-08-05 10:36:22,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:23,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 204 conjunts are in the unsatisfiable core [2019-08-05 10:36:23,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:23,128 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 10:36:23,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:23,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:23,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:23,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 0 proven. 6633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:25,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:25,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:36:25,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:36:25,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:36:25,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:36:25,877 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 69 states. [2019-08-05 10:36:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:26,128 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-08-05 10:36:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:36:26,128 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 202 [2019-08-05 10:36:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:26,129 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:36:26,130 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 10:36:26,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:36:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 10:36:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-08-05 10:36:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 10:36:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-08-05 10:36:26,133 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2019-08-05 10:36:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:26,133 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-08-05 10:36:26,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:36:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-08-05 10:36:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 10:36:26,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:26,134 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 67, 1, 1] [2019-08-05 10:36:26,134 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:26,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1577555755, now seen corresponding path program 67 times [2019-08-05 10:36:26,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:26,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 10:36:26,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:26,271 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 10:36:26,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:26,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:26,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:26,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 0 proven. 6834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:28,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:28,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:36:28,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:36:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:36:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:36:28,711 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 70 states. [2019-08-05 10:36:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:28,986 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-08-05 10:36:28,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:36:28,987 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 205 [2019-08-05 10:36:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:28,988 INFO L225 Difference]: With dead ends: 209 [2019-08-05 10:36:28,988 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 10:36:28,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:36:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 10:36:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-08-05 10:36:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-05 10:36:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-08-05 10:36:28,992 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2019-08-05 10:36:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:28,992 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-08-05 10:36:28,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:36:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-08-05 10:36:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:36:28,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:28,993 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 68, 1, 1] [2019-08-05 10:36:28,994 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:28,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1431042394, now seen corresponding path program 68 times [2019-08-05 10:36:28,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:29,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:36:29,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:29,102 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 10:36:29,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:29,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:29,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:29,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 0 proven. 7038 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:31,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:31,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:36:31,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:36:31,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:36:31,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:36:31,324 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 71 states. [2019-08-05 10:36:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:32,073 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2019-08-05 10:36:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:36:32,073 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 208 [2019-08-05 10:36:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:32,075 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:36:32,075 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 10:36:32,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:36:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 10:36:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-08-05 10:36:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:36:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-08-05 10:36:32,078 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2019-08-05 10:36:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:32,078 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-08-05 10:36:32,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:36:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-08-05 10:36:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 10:36:32,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:32,079 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 69, 1, 1] [2019-08-05 10:36:32,080 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:32,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:32,080 INFO L82 PathProgramCache]: Analyzing trace with hash -338277579, now seen corresponding path program 69 times [2019-08-05 10:36:32,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:32,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:36:32,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:32,212 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 10:36:32,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:32,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:32,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:32,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 0 proven. 7245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:34,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:34,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:36:34,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:36:34,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:36:34,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:36:34,804 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 72 states. [2019-08-05 10:36:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:35,073 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-08-05 10:36:35,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:36:35,073 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 211 [2019-08-05 10:36:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:35,074 INFO L225 Difference]: With dead ends: 215 [2019-08-05 10:36:35,075 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 10:36:35,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:36:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 10:36:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-08-05 10:36:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-08-05 10:36:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-08-05 10:36:35,079 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2019-08-05 10:36:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:35,080 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2019-08-05 10:36:35,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:36:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2019-08-05 10:36:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-08-05 10:36:35,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:35,081 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 70, 1, 1] [2019-08-05 10:36:35,081 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:35,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1633777594, now seen corresponding path program 70 times [2019-08-05 10:36:35,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:35,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-05 10:36:35,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:35,226 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 10:36:35,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:35,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:35,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:35,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 0 proven. 7455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:37,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:37,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:36:37,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:36:37,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:36:37,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:36:37,610 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 73 states. [2019-08-05 10:36:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:37,868 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2019-08-05 10:36:37,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:36:37,869 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 214 [2019-08-05 10:36:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:37,870 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:36:37,871 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 10:36:37,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:36:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 10:36:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-08-05 10:36:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-08-05 10:36:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-08-05 10:36:37,874 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2019-08-05 10:36:37,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:37,874 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2019-08-05 10:36:37,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:36:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2019-08-05 10:36:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 10:36:37,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:37,875 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 71, 1, 1] [2019-08-05 10:36:37,875 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:37,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1298602603, now seen corresponding path program 71 times [2019-08-05 10:36:37,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:37,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-05 10:36:37,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:37,998 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 10:36:37,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:38,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:38,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:38,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 0 proven. 7668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:40,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:40,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:36:40,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:36:40,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:36:40,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:36:40,659 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 74 states. [2019-08-05 10:36:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:40,948 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-08-05 10:36:40,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:36:40,949 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 217 [2019-08-05 10:36:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:40,950 INFO L225 Difference]: With dead ends: 221 [2019-08-05 10:36:40,950 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 10:36:40,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:36:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 10:36:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-08-05 10:36:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-05 10:36:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-08-05 10:36:40,954 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2019-08-05 10:36:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:40,954 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-08-05 10:36:40,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:36:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-08-05 10:36:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-08-05 10:36:40,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:40,955 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 72, 1, 1] [2019-08-05 10:36:40,955 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1899408922, now seen corresponding path program 72 times [2019-08-05 10:36:40,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:41,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:36:41,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:41,079 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 10:36:41,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:41,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:41,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:41,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 0 proven. 7884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:43,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:43,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:36:43,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:36:43,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:36:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:36:43,668 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 75 states. [2019-08-05 10:36:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:44,025 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2019-08-05 10:36:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:36:44,026 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 220 [2019-08-05 10:36:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:44,027 INFO L225 Difference]: With dead ends: 224 [2019-08-05 10:36:44,027 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 10:36:44,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:36:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 10:36:44,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-08-05 10:36:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 10:36:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2019-08-05 10:36:44,031 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2019-08-05 10:36:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:44,031 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2019-08-05 10:36:44,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:36:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2019-08-05 10:36:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-05 10:36:44,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:44,032 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 73, 1, 1] [2019-08-05 10:36:44,032 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:44,033 INFO L82 PathProgramCache]: Analyzing trace with hash 903231477, now seen corresponding path program 73 times [2019-08-05 10:36:44,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:44,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:36:44,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:44,183 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 10:36:44,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:44,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:44,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:44,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8103 backedges. 0 proven. 8103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:46,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:46,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:36:46,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:36:46,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:36:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:36:46,796 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 76 states. [2019-08-05 10:36:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:47,074 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-08-05 10:36:47,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:36:47,075 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 223 [2019-08-05 10:36:47,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:47,076 INFO L225 Difference]: With dead ends: 227 [2019-08-05 10:36:47,077 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 10:36:47,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:36:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 10:36:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-08-05 10:36:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-08-05 10:36:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-08-05 10:36:47,080 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2019-08-05 10:36:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:47,081 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-08-05 10:36:47,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:36:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-08-05 10:36:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-08-05 10:36:47,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:47,082 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 74, 1, 1] [2019-08-05 10:36:47,082 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash 199123846, now seen corresponding path program 74 times [2019-08-05 10:36:47,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:47,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 228 conjunts are in the unsatisfiable core [2019-08-05 10:36:47,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:47,275 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 10:36:47,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:47,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:47,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:47,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 0 proven. 8325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:50,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:50,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:36:50,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:36:50,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:36:50,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:36:50,243 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 77 states. [2019-08-05 10:36:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:50,521 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-08-05 10:36:50,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:36:50,521 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 226 [2019-08-05 10:36:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:50,523 INFO L225 Difference]: With dead ends: 230 [2019-08-05 10:36:50,523 INFO L226 Difference]: Without dead ends: 230 [2019-08-05 10:36:50,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:36:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-08-05 10:36:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-08-05 10:36:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-08-05 10:36:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2019-08-05 10:36:50,527 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2019-08-05 10:36:50,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:50,527 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2019-08-05 10:36:50,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:36:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2019-08-05 10:36:50,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-08-05 10:36:50,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:50,529 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 75, 1, 1] [2019-08-05 10:36:50,529 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:50,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash 748962389, now seen corresponding path program 75 times [2019-08-05 10:36:50,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:50,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 231 conjunts are in the unsatisfiable core [2019-08-05 10:36:50,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:50,648 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 10:36:50,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:50,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:50,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:50,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8550 backedges. 0 proven. 8550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:53,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:53,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:36:53,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:36:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:36:53,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:36:53,374 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 78 states. [2019-08-05 10:36:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:53,655 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-08-05 10:36:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:36:53,656 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 229 [2019-08-05 10:36:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:53,658 INFO L225 Difference]: With dead ends: 233 [2019-08-05 10:36:53,658 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 10:36:53,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:36:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 10:36:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-08-05 10:36:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-05 10:36:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-08-05 10:36:53,661 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2019-08-05 10:36:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:53,662 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-08-05 10:36:53,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:36:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-08-05 10:36:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-05 10:36:53,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:53,663 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 76, 1, 1] [2019-08-05 10:36:53,663 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:53,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:53,664 INFO L82 PathProgramCache]: Analyzing trace with hash -16270042, now seen corresponding path program 76 times [2019-08-05 10:36:53,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:53,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:36:53,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:53,872 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 10:36:53,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:53,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:53,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:53,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:56,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:56,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:36:56,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:36:56,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:36:56,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:36:56,739 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 79 states. [2019-08-05 10:36:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:57,041 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2019-08-05 10:36:57,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:36:57,042 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 232 [2019-08-05 10:36:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:57,043 INFO L225 Difference]: With dead ends: 236 [2019-08-05 10:36:57,044 INFO L226 Difference]: Without dead ends: 236 [2019-08-05 10:36:57,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:36:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-08-05 10:36:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-08-05 10:36:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-08-05 10:36:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-08-05 10:36:57,047 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2019-08-05 10:36:57,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:57,047 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-08-05 10:36:57,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:36:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-08-05 10:36:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-08-05 10:36:57,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:57,048 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 77, 1, 1] [2019-08-05 10:36:57,049 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash 630785205, now seen corresponding path program 77 times [2019-08-05 10:36:57,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:57,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:36:57,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:57,230 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 10:36:57,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:57,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:57,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:57,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9009 backedges. 0 proven. 9009 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:00,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:00,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:37:00,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:37:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:37:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:37:00,293 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 80 states. [2019-08-05 10:37:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:00,582 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-08-05 10:37:00,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:37:00,582 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 235 [2019-08-05 10:37:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:00,584 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:37:00,584 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 10:37:00,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:37:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 10:37:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-08-05 10:37:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-08-05 10:37:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-08-05 10:37:00,588 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2019-08-05 10:37:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:00,588 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2019-08-05 10:37:00,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:37:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2019-08-05 10:37:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-08-05 10:37:00,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:00,589 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 78, 1, 1] [2019-08-05 10:37:00,589 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1240424134, now seen corresponding path program 78 times [2019-08-05 10:37:00,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:00,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 240 conjunts are in the unsatisfiable core [2019-08-05 10:37:00,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:00,700 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 10:37:00,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:00,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:00,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:00,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9243 backedges. 0 proven. 9243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:03,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:03,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:37:03,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:37:03,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:37:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:37:03,606 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 81 states. [2019-08-05 10:37:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:03,904 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2019-08-05 10:37:03,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:37:03,904 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 238 [2019-08-05 10:37:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:03,906 INFO L225 Difference]: With dead ends: 242 [2019-08-05 10:37:03,906 INFO L226 Difference]: Without dead ends: 242 [2019-08-05 10:37:03,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:37:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-05 10:37:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-08-05 10:37:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 10:37:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-08-05 10:37:03,910 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2019-08-05 10:37:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:03,910 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2019-08-05 10:37:03,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:37:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2019-08-05 10:37:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-08-05 10:37:03,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:03,912 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 79, 1, 1] [2019-08-05 10:37:03,912 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:03,912 INFO L82 PathProgramCache]: Analyzing trace with hash -422936811, now seen corresponding path program 79 times [2019-08-05 10:37:03,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:04,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-05 10:37:04,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:04,046 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 10:37:04,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:04,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:04,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:04,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9480 backedges. 0 proven. 9480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:07,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:07,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:37:07,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:37:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:37:07,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:37:07,233 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 82 states. [2019-08-05 10:37:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:07,529 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-08-05 10:37:07,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:37:07,530 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 241 [2019-08-05 10:37:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:07,531 INFO L225 Difference]: With dead ends: 245 [2019-08-05 10:37:07,531 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 10:37:07,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:37:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 10:37:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-08-05 10:37:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-08-05 10:37:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-08-05 10:37:07,536 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2019-08-05 10:37:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:07,536 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-08-05 10:37:07,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:37:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-08-05 10:37:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-08-05 10:37:07,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:07,537 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 80, 1, 1] [2019-08-05 10:37:07,538 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:07,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1723811942, now seen corresponding path program 80 times [2019-08-05 10:37:07,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:07,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:37:07,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:07,710 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 10:37:07,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:07,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:07,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:07,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:11,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:11,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:37:11,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:37:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:37:11,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:37:11,467 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 83 states. [2019-08-05 10:37:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:11,774 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2019-08-05 10:37:11,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:37:11,775 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 244 [2019-08-05 10:37:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:11,777 INFO L225 Difference]: With dead ends: 248 [2019-08-05 10:37:11,777 INFO L226 Difference]: Without dead ends: 248 [2019-08-05 10:37:11,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:37:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-08-05 10:37:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-08-05 10:37:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-08-05 10:37:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2019-08-05 10:37:11,780 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2019-08-05 10:37:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:11,781 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2019-08-05 10:37:11,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:37:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2019-08-05 10:37:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-08-05 10:37:11,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:11,782 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 81, 1, 1] [2019-08-05 10:37:11,782 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash -842092171, now seen corresponding path program 81 times [2019-08-05 10:37:11,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:11,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:37:11,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:11,929 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 10:37:11,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:11,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:11,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:11,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9963 backedges. 0 proven. 9963 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:15,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:15,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:37:15,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:37:15,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:37:15,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:37:15,342 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 84 states. [2019-08-05 10:37:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:15,658 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-08-05 10:37:15,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:37:15,658 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 247 [2019-08-05 10:37:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:15,660 INFO L225 Difference]: With dead ends: 251 [2019-08-05 10:37:15,660 INFO L226 Difference]: Without dead ends: 251 [2019-08-05 10:37:15,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:37:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-08-05 10:37:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2019-08-05 10:37:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-08-05 10:37:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-08-05 10:37:15,663 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2019-08-05 10:37:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:15,664 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-08-05 10:37:15,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:37:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-08-05 10:37:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-08-05 10:37:15,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:15,665 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 82, 1, 1] [2019-08-05 10:37:15,665 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:15,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:15,665 INFO L82 PathProgramCache]: Analyzing trace with hash 136411654, now seen corresponding path program 82 times [2019-08-05 10:37:15,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:15,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 252 conjunts are in the unsatisfiable core [2019-08-05 10:37:15,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:15,846 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 10:37:15,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:15,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:15,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:15,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 0 proven. 10209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:19,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:19,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:37:19,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:37:19,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:37:19,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:37:19,325 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 85 states. [2019-08-05 10:37:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:19,747 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-08-05 10:37:19,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:37:19,747 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 250 [2019-08-05 10:37:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:19,748 INFO L225 Difference]: With dead ends: 254 [2019-08-05 10:37:19,748 INFO L226 Difference]: Without dead ends: 254 [2019-08-05 10:37:19,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:37:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-05 10:37:19,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-08-05 10:37:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-08-05 10:37:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-08-05 10:37:19,753 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2019-08-05 10:37:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:19,753 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-08-05 10:37:19,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:37:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-08-05 10:37:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-08-05 10:37:19,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:19,755 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 83, 1, 1] [2019-08-05 10:37:19,756 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 800824277, now seen corresponding path program 83 times [2019-08-05 10:37:19,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:19,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 255 conjunts are in the unsatisfiable core [2019-08-05 10:37:19,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:19,912 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 10:37:19,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:19,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:19,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:19,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10458 backedges. 0 proven. 10458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:23,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:23,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:37:23,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:37:23,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:37:23,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:37:23,060 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 86 states. [2019-08-05 10:37:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:23,427 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2019-08-05 10:37:23,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:37:23,428 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 253 [2019-08-05 10:37:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:23,429 INFO L225 Difference]: With dead ends: 257 [2019-08-05 10:37:23,429 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 10:37:23,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:37:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 10:37:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2019-08-05 10:37:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-05 10:37:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-08-05 10:37:23,431 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2019-08-05 10:37:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:23,431 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-08-05 10:37:23,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:37:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-08-05 10:37:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-08-05 10:37:23,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:23,432 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 84, 1, 1] [2019-08-05 10:37:23,433 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:23,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1186991194, now seen corresponding path program 84 times [2019-08-05 10:37:23,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:23,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:37:23,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:23,571 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 10:37:23,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:23,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:23,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:23,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 0 proven. 10710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:27,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:27,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:37:27,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:37:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:37:27,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:37:27,041 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 87 states. [2019-08-05 10:37:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:27,404 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-08-05 10:37:27,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:37:27,405 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 256 [2019-08-05 10:37:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:27,406 INFO L225 Difference]: With dead ends: 260 [2019-08-05 10:37:27,406 INFO L226 Difference]: Without dead ends: 260 [2019-08-05 10:37:27,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:37:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-08-05 10:37:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-08-05 10:37:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-08-05 10:37:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2019-08-05 10:37:27,410 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2019-08-05 10:37:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:27,411 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2019-08-05 10:37:27,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:37:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2019-08-05 10:37:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-08-05 10:37:27,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:27,412 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 85, 1, 1] [2019-08-05 10:37:27,413 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1188610507, now seen corresponding path program 85 times [2019-08-05 10:37:27,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:27,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:37:27,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:27,564 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 10:37:27,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:27,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:27,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:27,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10965 backedges. 0 proven. 10965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:31,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:31,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:37:31,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:37:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:37:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:37:31,139 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 88 states. [2019-08-05 10:37:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:31,509 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-08-05 10:37:31,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:37:31,509 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 259 [2019-08-05 10:37:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:31,511 INFO L225 Difference]: With dead ends: 263 [2019-08-05 10:37:31,511 INFO L226 Difference]: Without dead ends: 263 [2019-08-05 10:37:31,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:37:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-08-05 10:37:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2019-08-05 10:37:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-08-05 10:37:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2019-08-05 10:37:31,515 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2019-08-05 10:37:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:31,515 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2019-08-05 10:37:31,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:37:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2019-08-05 10:37:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-08-05 10:37:31,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:31,517 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 86, 1, 1] [2019-08-05 10:37:31,517 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:31,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2110043462, now seen corresponding path program 86 times [2019-08-05 10:37:31,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:31,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 264 conjunts are in the unsatisfiable core [2019-08-05 10:37:31,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:31,670 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 10:37:31,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:31,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:31,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:31,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11223 backedges. 0 proven. 11223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:35,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:35,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:37:35,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:37:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:37:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:37:35,475 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 89 states. [2019-08-05 10:37:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:35,808 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-08-05 10:37:35,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:37:35,809 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 262 [2019-08-05 10:37:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:35,811 INFO L225 Difference]: With dead ends: 266 [2019-08-05 10:37:35,811 INFO L226 Difference]: Without dead ends: 266 [2019-08-05 10:37:35,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:37:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-08-05 10:37:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-08-05 10:37:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-08-05 10:37:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-08-05 10:37:35,816 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2019-08-05 10:37:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:35,816 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-08-05 10:37:35,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:37:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-08-05 10:37:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-08-05 10:37:35,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:35,818 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 87, 1, 1] [2019-08-05 10:37:35,818 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash -836265835, now seen corresponding path program 87 times [2019-08-05 10:37:35,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:35,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-05 10:37:35,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:36,034 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 10:37:36,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:36,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:36,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:36,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 0 proven. 11484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:39,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:39,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:37:39,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:37:39,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:37:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:37:39,562 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 90 states. [2019-08-05 10:37:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:39,962 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2019-08-05 10:37:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:37:39,963 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 265 [2019-08-05 10:37:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:39,964 INFO L225 Difference]: With dead ends: 269 [2019-08-05 10:37:39,964 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 10:37:39,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:37:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 10:37:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-08-05 10:37:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-08-05 10:37:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-08-05 10:37:39,966 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2019-08-05 10:37:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:39,967 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-08-05 10:37:39,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:37:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-08-05 10:37:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-08-05 10:37:39,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:39,968 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 88, 1, 1] [2019-08-05 10:37:39,968 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1910095590, now seen corresponding path program 88 times [2019-08-05 10:37:39,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:40,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-05 10:37:40,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:40,103 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 10:37:40,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:40,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:40,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:40,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11748 backedges. 0 proven. 11748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:43,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:43,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:37:43,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:37:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:37:43,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:37:43,770 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 91 states. [2019-08-05 10:37:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:44,123 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2019-08-05 10:37:44,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:37:44,123 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 268 [2019-08-05 10:37:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:44,125 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:37:44,125 INFO L226 Difference]: Without dead ends: 272 [2019-08-05 10:37:44,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:37:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-08-05 10:37:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-08-05 10:37:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-08-05 10:37:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2019-08-05 10:37:44,128 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2019-08-05 10:37:44,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:44,128 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2019-08-05 10:37:44,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:37:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2019-08-05 10:37:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-08-05 10:37:44,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:44,129 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 89, 1, 1] [2019-08-05 10:37:44,130 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:44,130 INFO L82 PathProgramCache]: Analyzing trace with hash -363681035, now seen corresponding path program 89 times [2019-08-05 10:37:44,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:44,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:37:44,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:44,287 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 10:37:44,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:44,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:44,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:44,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12015 backedges. 0 proven. 12015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:48,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:48,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:37:48,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:37:48,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:37:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:37:48,283 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 92 states. [2019-08-05 10:37:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:48,623 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-08-05 10:37:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:37:48,623 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 271 [2019-08-05 10:37:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:48,625 INFO L225 Difference]: With dead ends: 275 [2019-08-05 10:37:48,625 INFO L226 Difference]: Without dead ends: 275 [2019-08-05 10:37:48,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:37:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-08-05 10:37:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-08-05 10:37:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-08-05 10:37:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2019-08-05 10:37:48,629 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2019-08-05 10:37:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:48,629 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2019-08-05 10:37:48,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:37:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2019-08-05 10:37:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-08-05 10:37:48,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:48,630 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 90, 1, 1] [2019-08-05 10:37:48,630 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1781076102, now seen corresponding path program 90 times [2019-08-05 10:37:48,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:48,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 276 conjunts are in the unsatisfiable core [2019-08-05 10:37:48,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:48,777 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 10:37:48,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:48,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:48,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:48,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:52,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:52,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:37:52,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:37:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:37:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:37:52,780 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 93 states. [2019-08-05 10:37:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:53,127 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2019-08-05 10:37:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:37:53,128 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 274 [2019-08-05 10:37:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:53,129 INFO L225 Difference]: With dead ends: 278 [2019-08-05 10:37:53,129 INFO L226 Difference]: Without dead ends: 278 [2019-08-05 10:37:53,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:37:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-08-05 10:37:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-08-05 10:37:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-08-05 10:37:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2019-08-05 10:37:53,133 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2019-08-05 10:37:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:53,133 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2019-08-05 10:37:53,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:37:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2019-08-05 10:37:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-08-05 10:37:53,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:53,135 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 91, 1, 1] [2019-08-05 10:37:53,135 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:53,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:53,136 INFO L82 PathProgramCache]: Analyzing trace with hash 12481877, now seen corresponding path program 91 times [2019-08-05 10:37:53,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:53,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 279 conjunts are in the unsatisfiable core [2019-08-05 10:37:53,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:53,316 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 10:37:53,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:53,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:53,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:53,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12558 backedges. 0 proven. 12558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:57,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:57,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:37:57,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:37:57,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:37:57,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:37:57,402 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 94 states. [2019-08-05 10:37:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:57,750 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-08-05 10:37:57,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:37:57,751 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 277 [2019-08-05 10:37:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:57,753 INFO L225 Difference]: With dead ends: 281 [2019-08-05 10:37:57,753 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 10:37:57,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:37:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 10:37:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-08-05 10:37:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-08-05 10:37:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-08-05 10:37:57,757 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2019-08-05 10:37:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:57,757 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-08-05 10:37:57,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:37:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-08-05 10:37:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-08-05 10:37:57,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:57,758 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 92, 1, 1] [2019-08-05 10:37:57,758 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1814255066, now seen corresponding path program 92 times [2019-08-05 10:37:57,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:57,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 10:37:57,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:57,909 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 10:37:57,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:57,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:57,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:57,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12834 backedges. 0 proven. 12834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:02,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:02,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:38:02,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:38:02,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:38:02,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:38:02,105 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 95 states. [2019-08-05 10:38:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:02,480 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2019-08-05 10:38:02,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:38:02,481 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 280 [2019-08-05 10:38:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:02,483 INFO L225 Difference]: With dead ends: 284 [2019-08-05 10:38:02,483 INFO L226 Difference]: Without dead ends: 284 [2019-08-05 10:38:02,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:38:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-08-05 10:38:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2019-08-05 10:38:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-08-05 10:38:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2019-08-05 10:38:02,486 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2019-08-05 10:38:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:02,487 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2019-08-05 10:38:02,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:38:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2019-08-05 10:38:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-08-05 10:38:02,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:02,488 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 93, 1, 1] [2019-08-05 10:38:02,488 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash -603916363, now seen corresponding path program 93 times [2019-08-05 10:38:02,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:02,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:38:02,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:02,639 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 10:38:02,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:02,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:02,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:02,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:06,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:06,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:38:06,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:38:06,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:38:06,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:38:06,892 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 96 states. [2019-08-05 10:38:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:07,249 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-08-05 10:38:07,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:38:07,250 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 283 [2019-08-05 10:38:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:07,252 INFO L225 Difference]: With dead ends: 287 [2019-08-05 10:38:07,252 INFO L226 Difference]: Without dead ends: 287 [2019-08-05 10:38:07,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:38:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-08-05 10:38:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-08-05 10:38:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-08-05 10:38:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-08-05 10:38:07,255 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2019-08-05 10:38:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:07,256 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-08-05 10:38:07,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:38:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-08-05 10:38:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-08-05 10:38:07,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:07,257 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 94, 1, 1] [2019-08-05 10:38:07,257 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 345934790, now seen corresponding path program 94 times [2019-08-05 10:38:07,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:07,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 288 conjunts are in the unsatisfiable core [2019-08-05 10:38:07,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:07,424 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 10:38:07,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:07,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:07,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:07,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 13395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:11,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:11,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:38:11,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:38:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:38:11,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:38:11,803 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 97 states. [2019-08-05 10:38:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:12,165 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-08-05 10:38:12,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:38:12,165 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 286 [2019-08-05 10:38:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:12,167 INFO L225 Difference]: With dead ends: 290 [2019-08-05 10:38:12,167 INFO L226 Difference]: Without dead ends: 290 [2019-08-05 10:38:12,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:38:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-08-05 10:38:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2019-08-05 10:38:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-08-05 10:38:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2019-08-05 10:38:12,171 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2019-08-05 10:38:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:12,171 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2019-08-05 10:38:12,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:38:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2019-08-05 10:38:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-08-05 10:38:12,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:12,172 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 95, 1, 1] [2019-08-05 10:38:12,172 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2117087765, now seen corresponding path program 95 times [2019-08-05 10:38:12,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:12,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-05 10:38:12,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:12,348 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 10:38:12,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:12,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:12,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:12,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13680 backedges. 0 proven. 13680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:16,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:16,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:38:16,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:38:16,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:38:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:38:16,847 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 98 states. [2019-08-05 10:38:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:17,227 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2019-08-05 10:38:17,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:38:17,227 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 289 [2019-08-05 10:38:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:17,229 INFO L225 Difference]: With dead ends: 293 [2019-08-05 10:38:17,229 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 10:38:17,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:38:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 10:38:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-08-05 10:38:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-08-05 10:38:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-08-05 10:38:17,233 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2019-08-05 10:38:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:17,233 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-08-05 10:38:17,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:38:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-08-05 10:38:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-08-05 10:38:17,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:17,234 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 96, 1, 1] [2019-08-05 10:38:17,235 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1432832666, now seen corresponding path program 96 times [2019-08-05 10:38:17,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:17,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-05 10:38:17,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:17,483 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 10:38:17,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:17,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:17,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:17,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13968 backedges. 0 proven. 13968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:22,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:22,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:38:22,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:38:22,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:38:22,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:38:22,222 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 99 states. [2019-08-05 10:38:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:22,598 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2019-08-05 10:38:22,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:38:22,598 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 292 [2019-08-05 10:38:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:22,600 INFO L225 Difference]: With dead ends: 296 [2019-08-05 10:38:22,600 INFO L226 Difference]: Without dead ends: 296 [2019-08-05 10:38:22,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:38:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-08-05 10:38:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-08-05 10:38:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-08-05 10:38:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-08-05 10:38:22,604 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2019-08-05 10:38:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:22,604 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-08-05 10:38:22,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:38:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-08-05 10:38:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-08-05 10:38:22,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:22,605 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 97, 1, 1] [2019-08-05 10:38:22,605 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:22,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:22,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2132663179, now seen corresponding path program 97 times [2019-08-05 10:38:22,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:22,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:38:22,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:22,785 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 10:38:22,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:22,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:22,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:22,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 0 proven. 14259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:27,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:27,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:38:27,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:38:27,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:38:27,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:38:27,317 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 100 states. [2019-08-05 10:38:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:27,714 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-08-05 10:38:27,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:38:27,714 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 295 [2019-08-05 10:38:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:27,716 INFO L225 Difference]: With dead ends: 299 [2019-08-05 10:38:27,716 INFO L226 Difference]: Without dead ends: 299 [2019-08-05 10:38:27,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:38:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-08-05 10:38:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2019-08-05 10:38:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-08-05 10:38:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2019-08-05 10:38:27,720 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2019-08-05 10:38:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:27,720 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2019-08-05 10:38:27,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:38:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2019-08-05 10:38:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-08-05 10:38:27,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:27,721 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 98, 1, 1] [2019-08-05 10:38:27,722 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1282746118, now seen corresponding path program 98 times [2019-08-05 10:38:27,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:27,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 300 conjunts are in the unsatisfiable core [2019-08-05 10:38:27,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:27,905 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 10:38:27,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:27,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:27,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:27,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14553 backedges. 0 proven. 14553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:32,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:32,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:38:32,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:38:32,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:38:32,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:38:32,632 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 101 states. [2019-08-05 10:38:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:33,030 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2019-08-05 10:38:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:38:33,031 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 298 [2019-08-05 10:38:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:33,033 INFO L225 Difference]: With dead ends: 302 [2019-08-05 10:38:33,033 INFO L226 Difference]: Without dead ends: 302 [2019-08-05 10:38:33,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:38:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-08-05 10:38:33,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-08-05 10:38:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-08-05 10:38:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-08-05 10:38:33,037 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2019-08-05 10:38:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:33,037 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2019-08-05 10:38:33,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:38:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2019-08-05 10:38:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-08-05 10:38:33,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:33,038 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 99, 1, 1] [2019-08-05 10:38:33,038 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:33,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:33,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1965870805, now seen corresponding path program 99 times [2019-08-05 10:38:33,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:33,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 303 conjunts are in the unsatisfiable core [2019-08-05 10:38:33,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:33,225 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 10:38:33,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:33,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:33,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:33,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14850 backedges. 0 proven. 14850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:37,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:37,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:38:37,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:38:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:38:37,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:38:37,857 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 102 states. [2019-08-05 10:38:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:38,277 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-08-05 10:38:38,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:38:38,278 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 301 [2019-08-05 10:38:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:38,280 INFO L225 Difference]: With dead ends: 305 [2019-08-05 10:38:38,280 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 10:38:38,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:38:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 10:38:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-08-05 10:38:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-08-05 10:38:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-08-05 10:38:38,283 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2019-08-05 10:38:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:38,283 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-08-05 10:38:38,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:38:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-08-05 10:38:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-08-05 10:38:38,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:38,285 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 100, 1, 1] [2019-08-05 10:38:38,285 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:38,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:38,285 INFO L82 PathProgramCache]: Analyzing trace with hash -916594522, now seen corresponding path program 100 times [2019-08-05 10:38:38,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:38,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:38:38,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:44,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:38:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 15050 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:44,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:44,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:38:44,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:38:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:38:44,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:38:44,843 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 104 states. [2019-08-05 10:38:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:45,786 INFO L93 Difference]: Finished difference Result 303 states and 302 transitions. [2019-08-05 10:38:45,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:38:45,787 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 304 [2019-08-05 10:38:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:45,788 INFO L225 Difference]: With dead ends: 303 [2019-08-05 10:38:45,788 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:38:45,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5359, Invalid=5561, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:38:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:38:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:38:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:38:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:38:45,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 304 [2019-08-05 10:38:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:45,789 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:38:45,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:38:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:38:45,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:38:45,793 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:38:45 BoogieIcfgContainer [2019-08-05 10:38:45,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:38:45,795 INFO L168 Benchmark]: Toolchain (without parser) took 228302.28 ms. Allocated memory was 140.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 108.8 MB in the beginning and 941.4 MB in the end (delta: -832.6 MB). Peak memory consumption was 579.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:45,795 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 110.0 MB in the beginning and 109.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:38:45,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.95 ms. Allocated memory is still 140.5 MB. Free memory was 108.6 MB in the beginning and 106.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:45,796 INFO L168 Benchmark]: Boogie Preprocessor took 27.41 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 105.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:45,796 INFO L168 Benchmark]: RCFGBuilder took 392.33 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 94.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:45,797 INFO L168 Benchmark]: TraceAbstraction took 227839.84 ms. Allocated memory was 140.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 94.5 MB in the beginning and 941.4 MB in the end (delta: -846.8 MB). Peak memory consumption was 565.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:38:45,798 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.23 ms. Allocated memory is still 140.5 MB. Free memory was 110.0 MB in the beginning and 109.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.95 ms. Allocated memory is still 140.5 MB. Free memory was 108.6 MB in the beginning and 106.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.41 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 105.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.33 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 94.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227839.84 ms. Allocated memory was 140.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 94.5 MB in the beginning and 941.4 MB in the end (delta: -846.8 MB). Peak memory consumption was 565.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 227.7s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 23.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 3 SDslu, 5284 SDs, 0 SdLazy, 11949 SolverSat, 281 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15454 GetRequests, 10301 SyntacticMatches, 0 SemanticMatches, 5153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 180.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=100, 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.3s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 197.3s InterpolantComputationTime, 15554 NumberOfCodeBlocks, 15554 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 15453 ConstructedInterpolants, 0 QuantifiedInterpolants, 27861456 SizeOfPredicates, 202 NumberOfNonLiveVariables, 36865 ConjunctsInSsa, 15553 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 15050/515100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...