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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:46:20,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:46:20,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:46:20,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:46:20,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:46:20,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:46:20,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:46:20,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:46:20,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:46:20,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:46:20,367 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:46:20,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:46:20,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:46:20,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:46:20,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:46:20,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:46:20,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:46:20,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:46:20,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:46:20,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:46:20,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:46:20,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:46:20,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:46:20,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:46:20,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:46:20,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:46:20,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:46:20,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:46:20,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:46:20,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:46:20,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:46:20,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:46:20,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:46:20,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:46:20,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:46:20,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:46:20,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:46:20,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:46:20,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:46:20,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:46:20,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:46:20,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:46:20,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:46:20,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:46:20,484 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:46:20,484 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:46:20,485 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2019-08-04 21:46:20,486 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2019-08-04 21:46:20,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:46:20,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:46:20,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:46:20,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:46:20,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:46:20,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/1) ... [2019-08-04 21:46:20,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/1) ... [2019-08-04 21:46:20,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:46:20,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:46:20,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:46:20,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:46:20,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/1) ... [2019-08-04 21:46:20,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/1) ... [2019-08-04 21:46:20,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/1) ... [2019-08-04 21:46:20,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/1) ... [2019-08-04 21:46:20,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/1) ... [2019-08-04 21:46:20,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/1) ... [2019-08-04 21:46:20,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/1) ... [2019-08-04 21:46:20,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:46:20,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:46:20,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:46:20,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:46:20,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (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-04 21:46:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:46:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:46:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-08-04 21:46:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-08-04 21:46:21,076 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:46:21,076 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-08-04 21:46:21,077 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:46:21 BoogieIcfgContainer [2019-08-04 21:46:21,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:46:21,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:46:21,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:46:21,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:46:21,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:46:20" (1/2) ... [2019-08-04 21:46:21,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd5911c and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:46:21, skipping insertion in model container [2019-08-04 21:46:21,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:46:21" (2/2) ... [2019-08-04 21:46:21,085 INFO L109 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2019-08-04 21:46:21,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:46:21,104 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-04 21:46:21,120 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-04 21:46:21,147 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:46:21,148 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:46:21,148 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:46:21,148 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:46:21,148 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:46:21,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:46:21,149 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:46:21,149 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:46:21,149 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:46:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-08-04 21:46:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:46:21,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:21,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:46:21,172 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1882889, now seen corresponding path program 1 times [2019-08-04 21:46:21,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:21,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:46:21,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:21,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:21,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2019-08-04 21:46:21,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:21,519 INFO L567 ElimStorePlain]: treesize reduction 8, result has 60.0 percent of original size [2019-08-04 21:46:21,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:21,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-08-04 21:46:21,541 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-04 21:46:21,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:46:21,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-04 21:46:21,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:46:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:46:21,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:46:21,566 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-08-04 21:46:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:21,595 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-04 21:46:21,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:46:21,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-04 21:46:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:21,605 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:46:21,605 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:46:21,607 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-04 21:46:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:46:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:46:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:46:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-04 21:46:21,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-08-04 21:46:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:21,643 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-04 21:46:21,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:46:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-04 21:46:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:46:21,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:21,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:46:21,644 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1882890, now seen corresponding path program 1 times [2019-08-04 21:46:21,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:21,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:46:21,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:21,688 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-04 21:46:21,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:21,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:21,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:21,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:21,760 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-04 21:46:21,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:46:21,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-04 21:46:21,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:46:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:46:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:46:21,765 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-04 21:46:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:21,845 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-04 21:46:21,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:46:21,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-04 21:46:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:21,856 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:46:21,856 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:46:21,857 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-04 21:46:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:46:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-04 21:46:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:46:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-04 21:46:21,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 4 [2019-08-04 21:46:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:21,861 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-04 21:46:21,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:46:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-04 21:46:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:46:21,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:21,862 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-04 21:46:21,862 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:21,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:21,865 INFO L82 PathProgramCache]: Analyzing trace with hash 264416444, now seen corresponding path program 1 times [2019-08-04 21:46:21,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:21,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:46:21,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:21,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:46:21,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:46:21,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:46:21,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:46:21,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:46:21,918 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 3 states. [2019-08-04 21:46:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:21,969 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-04 21:46:21,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:46:21,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-04 21:46:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:21,970 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:46:21,970 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:46:21,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-04 21:46:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:46:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:46:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:46:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:46:21,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:46:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:21,974 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:46:21,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:46:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:46:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:46:21,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:21,975 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-04 21:46:21,975 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash -556967665, now seen corresponding path program 1 times [2019-08-04 21:46:21,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:22,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:46:22,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:22,056 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-04 21:46:22,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:22,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:22,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:22,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:22,200 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-04 21:46:22,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:22,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-04 21:46:22,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:46:22,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:46:22,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:46:22,203 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2019-08-04 21:46:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:22,248 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:46:22,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:46:22,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-04 21:46:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:22,254 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:46:22,254 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:46:22,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-04 21:46:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:46:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-04 21:46:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:46:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:46:22,258 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-08-04 21:46:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:22,258 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:46:22,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:46:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:46:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:46:22,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:22,260 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-08-04 21:46:22,260 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1740280684, now seen corresponding path program 2 times [2019-08-04 21:46:22,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:22,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:46:22,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:22,333 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-04 21:46:22,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:22,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:22,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:22,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:22,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:22,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:46:22,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:46:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:46:22,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:46:22,420 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 5 states. [2019-08-04 21:46:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:22,465 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:46:22,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:46:22,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-08-04 21:46:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:22,467 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:46:22,467 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:46:22,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:46:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:46:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-04 21:46:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:46:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:46:22,471 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-08-04 21:46:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:22,472 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:46:22,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:46:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:46:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:46:22,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:22,473 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-08-04 21:46:22,473 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash -389139047, now seen corresponding path program 3 times [2019-08-04 21:46:22,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:22,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:46:22,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:22,551 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-04 21:46:22,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:22,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:22,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:22,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:22,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:22,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:46:22,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:46:22,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:46:22,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:46:22,726 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-08-04 21:46:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:22,818 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:46:22,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:46:22,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-08-04 21:46:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:22,820 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:46:22,820 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:46:22,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-04 21:46:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:46:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-04 21:46:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:46:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:46:22,825 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-08-04 21:46:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:22,825 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:46:22,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:46:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:46:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:46:22,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:22,826 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-08-04 21:46:22,827 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:22,827 INFO L82 PathProgramCache]: Analyzing trace with hash -971967458, now seen corresponding path program 4 times [2019-08-04 21:46:22,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:22,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:46:22,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:22,888 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-04 21:46:22,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:22,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:22,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:22,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:23,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:23,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:46:23,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:46:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:46:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:23,019 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2019-08-04 21:46:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:23,170 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:46:23,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:46:23,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-08-04 21:46:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:23,172 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:46:23,172 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:46:23,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:46:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:46:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-04 21:46:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:46:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:46:23,177 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-08-04 21:46:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:23,177 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:46:23,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:46:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:46:23,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:46:23,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:23,178 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-08-04 21:46:23,178 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1357453277, now seen corresponding path program 5 times [2019-08-04 21:46:23,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:23,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:46:23,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:23,263 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-04 21:46:23,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:23,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:23,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:23,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:23,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:23,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:46:23,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:46:23,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:46:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:23,642 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 8 states. [2019-08-04 21:46:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:23,757 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:46:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:46:23,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-04 21:46:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:23,761 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:46:23,761 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:46:23,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:46:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:46:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-04 21:46:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:46:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:46:23,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-08-04 21:46:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:23,766 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:46:23,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:46:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:46:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:46:23,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:23,768 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-08-04 21:46:23,768 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -62303832, now seen corresponding path program 6 times [2019-08-04 21:46:23,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:23,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:46:23,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:23,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-04 21:46:23,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:23,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:23,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:23,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:24,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:24,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:46:24,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:46:24,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:46:24,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:24,009 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2019-08-04 21:46:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:24,077 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:46:24,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:46:24,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-08-04 21:46:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:24,079 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:46:24,079 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:46:24,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:46:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:46:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-04 21:46:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:46:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:46:24,084 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-08-04 21:46:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:24,084 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:46:24,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:46:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:46:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:46:24,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:24,085 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-08-04 21:46:24,086 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash 795963565, now seen corresponding path program 7 times [2019-08-04 21:46:24,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:24,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:46:24,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:24,159 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-04 21:46:24,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:24,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:24,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:24,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:24,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:24,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:46:24,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:46:24,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:46:24,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:24,400 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2019-08-04 21:46:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:24,468 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:46:24,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:46:24,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-08-04 21:46:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:24,469 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:46:24,470 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:46:24,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:46:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:46:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-04 21:46:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:46:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:46:24,474 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-08-04 21:46:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:24,475 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:46:24,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:46:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:46:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:46:24,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:24,476 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-08-04 21:46:24,477 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1136166194, now seen corresponding path program 8 times [2019-08-04 21:46:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:24,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:46:24,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:24,583 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-04 21:46:24,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:24,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:24,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:24,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:24,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:24,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:46:24,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:46:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:46:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:46:24,873 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2019-08-04 21:46:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:24,940 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:46:24,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:46:24,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-08-04 21:46:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:24,945 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:46:24,945 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:46:24,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 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-04 21:46:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:46:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-04 21:46:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:46:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:46:24,950 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-08-04 21:46:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:24,950 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:46:24,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:46:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:46:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:46:24,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:24,952 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-08-04 21:46:24,952 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:24,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:24,952 INFO L82 PathProgramCache]: Analyzing trace with hash -39334089, now seen corresponding path program 9 times [2019-08-04 21:46:24,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:24,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:46:24,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:25,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-04 21:46:25,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:25,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:25,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:25,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:25,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:25,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:46:25,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:46:25,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:46:25,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:25,211 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2019-08-04 21:46:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:25,449 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:46:25,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:46:25,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-08-04 21:46:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:25,451 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:46:25,451 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:46:25,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:46:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:46:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-04 21:46:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:46:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:46:25,458 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-08-04 21:46:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:25,458 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:46:25,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:46:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:46:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:46:25,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:25,460 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-08-04 21:46:25,465 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash 992513724, now seen corresponding path program 10 times [2019-08-04 21:46:25,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:25,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:46:25,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:25,597 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-04 21:46:25,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:25,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:25,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:25,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:25,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:25,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:46:25,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:46:25,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:46:25,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:46:25,833 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 13 states. [2019-08-04 21:46:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:25,923 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:46:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:46:25,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-08-04 21:46:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:25,925 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:46:25,925 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:46:25,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 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-04 21:46:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:46:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-04 21:46:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:46:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:46:25,930 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-08-04 21:46:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:25,931 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:46:25,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:46:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:46:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:46:25,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:25,932 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-08-04 21:46:25,932 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:25,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1132725185, now seen corresponding path program 11 times [2019-08-04 21:46:25,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:25,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:46:25,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:26,015 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-04 21:46:26,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:26,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:26,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:26,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:26,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:26,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:46:26,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:46:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:46:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:26,628 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 14 states. [2019-08-04 21:46:26,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:26,705 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:46:26,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:46:26,705 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2019-08-04 21:46:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:26,706 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:46:26,706 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:46:26,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:46:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:46:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-04 21:46:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:46:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:46:26,712 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-08-04 21:46:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:26,712 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:46:26,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:46:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:46:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:46:26,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:26,714 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-08-04 21:46:26,714 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:26,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash 392392262, now seen corresponding path program 12 times [2019-08-04 21:46:26,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:26,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:46:26,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:26,799 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-04 21:46:26,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:26,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:26,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:26,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:27,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:27,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:46:27,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:46:27,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:46:27,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:27,285 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 15 states. [2019-08-04 21:46:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:27,393 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:46:27,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:46:27,393 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-08-04 21:46:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:27,394 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:46:27,394 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:46:27,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:46:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:46:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-04 21:46:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:46:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:46:27,400 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-08-04 21:46:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:27,400 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:46:27,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:46:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:46:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:46:27,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:27,401 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-08-04 21:46:27,402 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1060106677, now seen corresponding path program 13 times [2019-08-04 21:46:27,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:27,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:46:27,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:27,492 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-04 21:46:27,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:27,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:27,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:27,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:27,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:27,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:46:27,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:46:27,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:46:27,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:27,783 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 16 states. [2019-08-04 21:46:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:27,906 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:46:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:46:27,906 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-08-04 21:46:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:27,907 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:46:27,908 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:46:27,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:46:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:46:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-04 21:46:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:46:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:46:27,914 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-08-04 21:46:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:27,914 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:46:27,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:46:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:46:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:46:27,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:27,915 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-08-04 21:46:27,916 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1556929584, now seen corresponding path program 14 times [2019-08-04 21:46:27,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:27,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:46:27,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:28,003 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-04 21:46:28,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:28,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:28,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:28,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:28,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:28,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:46:28,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:46:28,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:46:28,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:46:28,953 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 17 states. [2019-08-04 21:46:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:29,206 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:46:29,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:46:29,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-08-04 21:46:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:29,207 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:46:29,208 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:46:29,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:46:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:46:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-04 21:46:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:46:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:46:29,212 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-08-04 21:46:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:29,212 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:46:29,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:46:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:46:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:46:29,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:29,213 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-08-04 21:46:29,214 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:29,214 INFO L82 PathProgramCache]: Analyzing trace with hash -883560747, now seen corresponding path program 15 times [2019-08-04 21:46:29,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:29,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:46:29,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:29,321 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-04 21:46:29,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:29,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:29,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:29,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:30,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:30,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:46:30,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:46:30,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:46:30,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:46:30,394 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 18 states. [2019-08-04 21:46:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:30,518 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:46:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:46:30,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2019-08-04 21:46:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:30,520 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:46:30,520 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:46:30,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:46:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:46:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-04 21:46:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:46:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:46:30,525 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-08-04 21:46:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:30,525 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:46:30,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:46:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:46:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:46:30,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:30,526 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-08-04 21:46:30,527 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:30,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1063366490, now seen corresponding path program 16 times [2019-08-04 21:46:30,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:30,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:46:30,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:30,593 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-04 21:46:30,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:30,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:30,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:30,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:31,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:31,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:46:31,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:46:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:46:31,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:46:31,074 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 19 states. [2019-08-04 21:46:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:31,189 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:46:31,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:46:31,190 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-08-04 21:46:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:31,192 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:46:31,192 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:46:31,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:46:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:46:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-04 21:46:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:46:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:46:31,197 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-08-04 21:46:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:31,197 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:46:31,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:46:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:46:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:46:31,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:31,198 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-08-04 21:46:31,199 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1323279711, now seen corresponding path program 17 times [2019-08-04 21:46:31,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:31,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:46:31,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:31,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-04 21:46:31,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:31,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:31,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:31,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:31,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:31,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:46:31,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:46:31,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:46:31,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:46:31,737 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 20 states. [2019-08-04 21:46:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:31,878 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:46:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:46:31,879 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-08-04 21:46:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:31,880 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:46:31,880 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:46:31,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:46:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:46:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-04 21:46:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:46:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:46:31,884 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-08-04 21:46:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:31,884 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:46:31,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:46:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:46:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:46:31,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:31,885 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-08-04 21:46:31,886 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash -491187996, now seen corresponding path program 18 times [2019-08-04 21:46:31,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:31,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:46:31,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:31,969 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-04 21:46:31,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:32,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:32,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:32,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:32,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:32,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:46:32,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:46:32,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:46:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:46:32,329 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 21 states. [2019-08-04 21:46:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:32,442 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:46:32,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:46:32,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-08-04 21:46:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:32,443 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:46:32,444 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:46:32,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:46:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:46:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-04 21:46:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:46:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:46:32,447 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-08-04 21:46:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:32,447 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:46:32,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:46:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:46:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:46:32,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:32,448 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-08-04 21:46:32,448 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash -852020759, now seen corresponding path program 19 times [2019-08-04 21:46:32,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:32,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:46:32,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:32,544 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-04 21:46:32,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:32,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:32,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:32,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:33,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:33,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:46:33,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:46:33,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:46:33,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:46:33,071 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 22 states. [2019-08-04 21:46:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:33,195 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-04 21:46:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:46:33,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 80 [2019-08-04 21:46:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:33,199 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:46:33,199 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:46:33,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:46:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:46:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-04 21:46:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:46:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-04 21:46:33,201 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-08-04 21:46:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:33,202 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-04 21:46:33,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:46:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-04 21:46:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:46:33,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:33,203 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-08-04 21:46:33,203 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:33,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash 436422766, now seen corresponding path program 20 times [2019-08-04 21:46:33,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:33,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:46:33,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:33,298 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-04 21:46:33,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:33,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:33,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:33,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:33,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:33,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:46:33,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:46:33,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:46:33,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:46:33,670 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 23 states. [2019-08-04 21:46:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:33,837 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-04 21:46:33,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:46:33,843 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2019-08-04 21:46:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:33,844 INFO L225 Difference]: With dead ends: 90 [2019-08-04 21:46:33,844 INFO L226 Difference]: Without dead ends: 90 [2019-08-04 21:46:33,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:46:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-04 21:46:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-04 21:46:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:46:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-04 21:46:33,847 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-08-04 21:46:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:33,848 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-04 21:46:33,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:46:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-04 21:46:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:46:33,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:33,849 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-08-04 21:46:33,849 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1579586675, now seen corresponding path program 21 times [2019-08-04 21:46:33,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:33,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:46:33,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:34,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-04 21:46:34,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:34,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:34,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:34,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:34,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:34,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:46:34,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:46:34,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:46:34,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:46:34,417 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 24 states. [2019-08-04 21:46:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:34,566 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-04 21:46:34,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:46:34,566 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2019-08-04 21:46:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:34,567 INFO L225 Difference]: With dead ends: 94 [2019-08-04 21:46:34,567 INFO L226 Difference]: Without dead ends: 94 [2019-08-04 21:46:34,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:46:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-04 21:46:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-04 21:46:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:46:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-04 21:46:34,573 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-08-04 21:46:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:34,573 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-04 21:46:34,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:46:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-04 21:46:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:46:34,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:34,575 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-08-04 21:46:34,575 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash 134895096, now seen corresponding path program 22 times [2019-08-04 21:46:34,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:34,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:46:34,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:34,644 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-04 21:46:34,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:34,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:34,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:34,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:36,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:36,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:46:36,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:46:36,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:46:36,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:46:36,245 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 25 states. [2019-08-04 21:46:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:36,409 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-04 21:46:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:46:36,409 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2019-08-04 21:46:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:36,410 INFO L225 Difference]: With dead ends: 98 [2019-08-04 21:46:36,411 INFO L226 Difference]: Without dead ends: 98 [2019-08-04 21:46:36,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:46:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-04 21:46:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-04 21:46:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-04 21:46:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-04 21:46:36,414 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-08-04 21:46:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:36,414 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-04 21:46:36,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:46:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-04 21:46:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:46:36,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:36,415 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-08-04 21:46:36,416 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1351103235, now seen corresponding path program 23 times [2019-08-04 21:46:36,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:36,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:46:36,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:36,505 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-04 21:46:36,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:36,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:36,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:36,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:36,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:36,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:46:36,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:46:36,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:46:36,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:46:36,923 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 26 states. [2019-08-04 21:46:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:37,087 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-04 21:46:37,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:46:37,087 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 96 [2019-08-04 21:46:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:37,089 INFO L225 Difference]: With dead ends: 102 [2019-08-04 21:46:37,089 INFO L226 Difference]: Without dead ends: 102 [2019-08-04 21:46:37,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:46:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-04 21:46:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-04 21:46:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-04 21:46:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-04 21:46:37,093 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-08-04 21:46:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:37,093 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-04 21:46:37,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:46:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-04 21:46:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-04 21:46:37,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:37,094 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-08-04 21:46:37,094 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1704475010, now seen corresponding path program 24 times [2019-08-04 21:46:37,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:37,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:46:37,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:37,184 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-04 21:46:37,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:37,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:37,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:37,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:38,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:38,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:46:38,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:46:38,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:46:38,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:46:38,223 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 27 states. [2019-08-04 21:46:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:38,354 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-04 21:46:38,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:46:38,362 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2019-08-04 21:46:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:38,363 INFO L225 Difference]: With dead ends: 106 [2019-08-04 21:46:38,364 INFO L226 Difference]: Without dead ends: 106 [2019-08-04 21:46:38,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:46:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-04 21:46:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-04 21:46:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-04 21:46:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-04 21:46:38,367 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-08-04 21:46:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:38,367 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-04 21:46:38,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:46:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-04 21:46:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-04 21:46:38,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:38,368 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-08-04 21:46:38,368 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash 83155847, now seen corresponding path program 25 times [2019-08-04 21:46:38,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:38,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:46:38,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:38,451 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-04 21:46:38,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:38,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:38,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:38,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:39,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:46:39,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:46:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:46:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:46:39,115 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 28 states. [2019-08-04 21:46:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:39,278 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-04 21:46:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:46:39,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2019-08-04 21:46:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:39,280 INFO L225 Difference]: With dead ends: 110 [2019-08-04 21:46:39,280 INFO L226 Difference]: Without dead ends: 110 [2019-08-04 21:46:39,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:46:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-04 21:46:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-04 21:46:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-04 21:46:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-04 21:46:39,284 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-08-04 21:46:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:39,284 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-04 21:46:39,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:46:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-04 21:46:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-04 21:46:39,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:39,285 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-08-04 21:46:39,285 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2122910964, now seen corresponding path program 26 times [2019-08-04 21:46:39,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:39,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:46:39,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:39,378 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-04 21:46:39,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:39,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:39,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:39,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:40,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:40,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:46:40,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:46:40,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:46:40,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:46:40,343 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 29 states. [2019-08-04 21:46:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:40,527 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-04 21:46:40,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:46:40,527 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2019-08-04 21:46:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:40,528 INFO L225 Difference]: With dead ends: 114 [2019-08-04 21:46:40,529 INFO L226 Difference]: Without dead ends: 114 [2019-08-04 21:46:40,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:46:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-04 21:46:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-04 21:46:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-04 21:46:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-04 21:46:40,534 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-08-04 21:46:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:40,534 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-04 21:46:40,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:46:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-04 21:46:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-04 21:46:40,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:40,535 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-08-04 21:46:40,535 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:40,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash 946323473, now seen corresponding path program 27 times [2019-08-04 21:46:40,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:40,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:46:40,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:40,637 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-04 21:46:40,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:40,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:40,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:40,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:41,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:41,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:46:41,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:46:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:46:41,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:46:41,770 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 30 states. [2019-08-04 21:46:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:41,962 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-04 21:46:41,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:46:41,963 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2019-08-04 21:46:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:41,964 INFO L225 Difference]: With dead ends: 118 [2019-08-04 21:46:41,964 INFO L226 Difference]: Without dead ends: 118 [2019-08-04 21:46:41,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:46:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-04 21:46:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-04 21:46:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-04 21:46:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-04 21:46:41,968 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-08-04 21:46:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:41,968 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-04 21:46:41,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:46:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-04 21:46:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-04 21:46:41,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:41,969 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-08-04 21:46:41,969 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:41,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1081115286, now seen corresponding path program 28 times [2019-08-04 21:46:41,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:42,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:46:42,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:42,074 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-04 21:46:42,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:42,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:42,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:42,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:43,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:43,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:46:43,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:46:43,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:46:43,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:46:43,262 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 31 states. [2019-08-04 21:46:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:43,504 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-04 21:46:43,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:46:43,505 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2019-08-04 21:46:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:43,506 INFO L225 Difference]: With dead ends: 122 [2019-08-04 21:46:43,506 INFO L226 Difference]: Without dead ends: 122 [2019-08-04 21:46:43,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:46:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-04 21:46:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-08-04 21:46:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-04 21:46:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-04 21:46:43,510 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-08-04 21:46:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:43,510 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-04 21:46:43,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:46:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-04 21:46:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-04 21:46:43,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:43,512 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-08-04 21:46:43,512 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:43,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1181058405, now seen corresponding path program 29 times [2019-08-04 21:46:43,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:43,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:46:43,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:43,615 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-04 21:46:43,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:43,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:43,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:43,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:44,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:44,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:46:44,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:46:44,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:46:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:46:44,774 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 32 states. [2019-08-04 21:46:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:44,930 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-04 21:46:44,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:46:44,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 120 [2019-08-04 21:46:44,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:44,932 INFO L225 Difference]: With dead ends: 126 [2019-08-04 21:46:44,932 INFO L226 Difference]: Without dead ends: 126 [2019-08-04 21:46:44,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:46:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-04 21:46:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-08-04 21:46:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-04 21:46:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-04 21:46:44,937 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-08-04 21:46:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:44,937 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-04 21:46:44,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:46:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-04 21:46:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-04 21:46:44,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:44,938 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-08-04 21:46:44,938 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:44,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:44,939 INFO L82 PathProgramCache]: Analyzing trace with hash 491710496, now seen corresponding path program 30 times [2019-08-04 21:46:44,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:44,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:46:44,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:45,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-04 21:46:45,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:45,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:45,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:45,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:46,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:46,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:46:46,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:46:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:46:46,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:46:46,730 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 33 states. [2019-08-04 21:46:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:46,914 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-04 21:46:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:46:46,921 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2019-08-04 21:46:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:46,922 INFO L225 Difference]: With dead ends: 130 [2019-08-04 21:46:46,923 INFO L226 Difference]: Without dead ends: 130 [2019-08-04 21:46:46,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:46:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-04 21:46:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-08-04 21:46:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-04 21:46:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-04 21:46:46,926 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-08-04 21:46:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:46,926 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-04 21:46:46,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:46:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-04 21:46:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-04 21:46:46,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:46,927 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-08-04 21:46:46,928 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:46,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1906898139, now seen corresponding path program 31 times [2019-08-04 21:46:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:47,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:46:47,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:47,053 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-04 21:46:47,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:47,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:47,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:47,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:48,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:48,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:46:48,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:46:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:46:48,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:46:48,301 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 34 states. [2019-08-04 21:46:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:48,475 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-08-04 21:46:48,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:46:48,475 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 128 [2019-08-04 21:46:48,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:48,477 INFO L225 Difference]: With dead ends: 134 [2019-08-04 21:46:48,477 INFO L226 Difference]: Without dead ends: 134 [2019-08-04 21:46:48,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:46:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-04 21:46:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-08-04 21:46:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-04 21:46:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-04 21:46:48,482 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-08-04 21:46:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:48,482 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-04 21:46:48,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:46:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-04 21:46:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-04 21:46:48,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:48,483 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-08-04 21:46:48,483 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:48,484 INFO L82 PathProgramCache]: Analyzing trace with hash 685515690, now seen corresponding path program 32 times [2019-08-04 21:46:48,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:48,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:46:48,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:48,597 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-04 21:46:48,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:48,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:48,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:48,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:49,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:49,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:46:49,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:46:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:46:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:46:49,650 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 35 states. [2019-08-04 21:46:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:49,885 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-08-04 21:46:49,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:46:49,886 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 132 [2019-08-04 21:46:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:49,887 INFO L225 Difference]: With dead ends: 138 [2019-08-04 21:46:49,887 INFO L226 Difference]: Without dead ends: 138 [2019-08-04 21:46:49,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:46:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-04 21:46:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-08-04 21:46:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-04 21:46:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-04 21:46:49,891 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-08-04 21:46:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:49,892 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-04 21:46:49,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:46:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-04 21:46:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-04 21:46:49,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:49,892 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-08-04 21:46:49,893 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:49,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:49,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1382511023, now seen corresponding path program 33 times [2019-08-04 21:46:49,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:49,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:46:49,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:49,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-04 21:46:49,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:50,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:50,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:50,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:50,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:50,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:46:50,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:46:50,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:46:50,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:46:50,711 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 36 states. [2019-08-04 21:46:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:50,898 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-08-04 21:46:50,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:46:50,899 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 136 [2019-08-04 21:46:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:50,900 INFO L225 Difference]: With dead ends: 142 [2019-08-04 21:46:50,900 INFO L226 Difference]: Without dead ends: 142 [2019-08-04 21:46:50,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:46:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-04 21:46:50,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-08-04 21:46:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-04 21:46:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-04 21:46:50,904 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-08-04 21:46:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:50,904 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-04 21:46:50,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:46:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-04 21:46:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-04 21:46:50,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:50,905 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-08-04 21:46:50,905 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:50,906 INFO L82 PathProgramCache]: Analyzing trace with hash 165819700, now seen corresponding path program 34 times [2019-08-04 21:46:50,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:50,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:46:50,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:51,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-04 21:46:51,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:51,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:51,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:51,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:51,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:51,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:46:51,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:46:51,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:46:51,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:46:51,827 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 37 states. [2019-08-04 21:46:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:52,024 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-08-04 21:46:52,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:46:52,024 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2019-08-04 21:46:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:52,026 INFO L225 Difference]: With dead ends: 146 [2019-08-04 21:46:52,026 INFO L226 Difference]: Without dead ends: 146 [2019-08-04 21:46:52,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:46:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-04 21:46:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-08-04 21:46:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-04 21:46:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-08-04 21:46:52,030 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-08-04 21:46:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:52,031 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-08-04 21:46:52,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:46:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-08-04 21:46:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-04 21:46:52,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:52,032 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-08-04 21:46:52,032 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:52,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash 932556345, now seen corresponding path program 35 times [2019-08-04 21:46:52,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:52,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-04 21:46:52,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:52,149 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-04 21:46:52,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:52,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:52,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:52,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:54,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:54,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:46:54,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:46:54,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:46:54,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:46:54,011 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 38 states. [2019-08-04 21:46:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:54,528 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-08-04 21:46:54,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:46:54,529 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 144 [2019-08-04 21:46:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:54,530 INFO L225 Difference]: With dead ends: 150 [2019-08-04 21:46:54,531 INFO L226 Difference]: Without dead ends: 150 [2019-08-04 21:46:54,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:46:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-04 21:46:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-08-04 21:46:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-04 21:46:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-08-04 21:46:54,536 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-08-04 21:46:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:54,536 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-08-04 21:46:54,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:46:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-08-04 21:46:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-04 21:46:54,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:54,537 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-08-04 21:46:54,538 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash -47506242, now seen corresponding path program 36 times [2019-08-04 21:46:54,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:54,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:46:54,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:54,660 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-04 21:46:54,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:54,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:54,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:54,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:55,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:55,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:46:55,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:46:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:46:55,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:46:55,816 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 39 states. [2019-08-04 21:46:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:56,037 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2019-08-04 21:46:56,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:46:56,038 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2019-08-04 21:46:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:56,040 INFO L225 Difference]: With dead ends: 154 [2019-08-04 21:46:56,040 INFO L226 Difference]: Without dead ends: 154 [2019-08-04 21:46:56,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:46:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-04 21:46:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-08-04 21:46:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-04 21:46:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-08-04 21:46:56,045 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-08-04 21:46:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:56,045 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-08-04 21:46:56,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:46:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-08-04 21:46:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-04 21:46:56,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:56,047 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-08-04 21:46:56,047 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash 95142083, now seen corresponding path program 37 times [2019-08-04 21:46:56,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:56,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-04 21:46:56,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:56,195 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-04 21:46:56,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:56,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:56,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:56,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:57,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:57,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:46:57,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:46:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:46:57,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:46:57,095 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 40 states. [2019-08-04 21:46:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:57,293 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-08-04 21:46:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:46:57,294 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-08-04 21:46:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:57,295 INFO L225 Difference]: With dead ends: 158 [2019-08-04 21:46:57,295 INFO L226 Difference]: Without dead ends: 158 [2019-08-04 21:46:57,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 113 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-04 21:46:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-04 21:46:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-08-04 21:46:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-04 21:46:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-08-04 21:46:57,299 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-08-04 21:46:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:57,300 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-08-04 21:46:57,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:46:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-08-04 21:46:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-04 21:46:57,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:57,301 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-08-04 21:46:57,301 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:57,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash -712975800, now seen corresponding path program 38 times [2019-08-04 21:46:57,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:57,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-04 21:46:57,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:57,429 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-04 21:46:57,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:57,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:57,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:57,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:58,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:58,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:46:58,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:46:58,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:46:58,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:46:58,622 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 41 states. [2019-08-04 21:46:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:58,837 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-08-04 21:46:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:46:58,838 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 156 [2019-08-04 21:46:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:58,839 INFO L225 Difference]: With dead ends: 162 [2019-08-04 21:46:58,839 INFO L226 Difference]: Without dead ends: 162 [2019-08-04 21:46:58,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:46:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-04 21:46:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-08-04 21:46:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-04 21:46:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-08-04 21:46:58,843 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-08-04 21:46:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:58,844 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-08-04 21:46:58,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:46:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-08-04 21:46:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-04 21:46:58,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:58,845 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-08-04 21:46:58,845 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:46:58,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:58,845 INFO L82 PathProgramCache]: Analyzing trace with hash 443787597, now seen corresponding path program 39 times [2019-08-04 21:46:58,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:58,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-04 21:46:58,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:58,962 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-04 21:46:58,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:59,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:59,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:59,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:00,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:00,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:47:00,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:47:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:47:00,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:47:00,090 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 42 states. [2019-08-04 21:47:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:00,390 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-08-04 21:47:00,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:47:00,391 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-08-04 21:47:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:00,392 INFO L225 Difference]: With dead ends: 166 [2019-08-04 21:47:00,392 INFO L226 Difference]: Without dead ends: 166 [2019-08-04 21:47:00,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:47:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-04 21:47:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-08-04 21:47:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-04 21:47:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-08-04 21:47:00,396 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-08-04 21:47:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:00,396 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-08-04 21:47:00,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:47:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-08-04 21:47:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-04 21:47:00,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:00,398 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-08-04 21:47:00,398 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:00,398 INFO L82 PathProgramCache]: Analyzing trace with hash -72520238, now seen corresponding path program 40 times [2019-08-04 21:47:00,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:00,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-04 21:47:00,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:00,520 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-04 21:47:00,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:00,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:00,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:00,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:02,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:02,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:47:02,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:47:02,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:47:02,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:47:02,050 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 43 states. [2019-08-04 21:47:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:02,280 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-08-04 21:47:02,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:47:02,281 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-08-04 21:47:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:02,282 INFO L225 Difference]: With dead ends: 170 [2019-08-04 21:47:02,282 INFO L226 Difference]: Without dead ends: 170 [2019-08-04 21:47:02,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:47:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-04 21:47:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-08-04 21:47:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-04 21:47:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-08-04 21:47:02,287 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-08-04 21:47:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:02,288 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-08-04 21:47:02,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:47:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-08-04 21:47:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-04 21:47:02,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:02,289 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-08-04 21:47:02,289 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1773627351, now seen corresponding path program 41 times [2019-08-04 21:47:02,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:02,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-04 21:47:02,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:02,409 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-04 21:47:02,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:02,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:02,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:02,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:03,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:03,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:47:03,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:47:03,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:47:03,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:47:03,698 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 44 states. [2019-08-04 21:47:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:03,911 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-08-04 21:47:03,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:47:03,912 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 168 [2019-08-04 21:47:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:03,913 INFO L225 Difference]: With dead ends: 174 [2019-08-04 21:47:03,913 INFO L226 Difference]: Without dead ends: 174 [2019-08-04 21:47:03,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:47:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-04 21:47:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-08-04 21:47:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-04 21:47:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-08-04 21:47:03,917 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-08-04 21:47:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:03,918 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-08-04 21:47:03,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:47:03,918 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-08-04 21:47:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-04 21:47:03,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:03,919 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-08-04 21:47:03,919 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:03,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:03,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1853544284, now seen corresponding path program 42 times [2019-08-04 21:47:03,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:04,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-04 21:47:04,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:04,043 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-04 21:47:04,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:04,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:04,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:04,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:05,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:05,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:47:05,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:47:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:47:05,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:47:05,156 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 45 states. [2019-08-04 21:47:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:05,387 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2019-08-04 21:47:05,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:47:05,387 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2019-08-04 21:47:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:05,388 INFO L225 Difference]: With dead ends: 178 [2019-08-04 21:47:05,389 INFO L226 Difference]: Without dead ends: 178 [2019-08-04 21:47:05,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 128 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-04 21:47:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-04 21:47:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-08-04 21:47:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-04 21:47:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-08-04 21:47:05,395 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-08-04 21:47:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:05,395 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-08-04 21:47:05,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:47:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-08-04 21:47:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-04 21:47:05,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:05,396 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-08-04 21:47:05,396 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2101410913, now seen corresponding path program 43 times [2019-08-04 21:47:05,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:05,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-04 21:47:05,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:05,530 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-04 21:47:05,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:05,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:05,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:05,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:06,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:06,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:47:06,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:47:06,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:47:06,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:47:06,659 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 46 states. [2019-08-04 21:47:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:06,968 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-08-04 21:47:06,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:47:06,969 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-08-04 21:47:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:06,970 INFO L225 Difference]: With dead ends: 182 [2019-08-04 21:47:06,970 INFO L226 Difference]: Without dead ends: 182 [2019-08-04 21:47:06,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:47:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-04 21:47:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-08-04 21:47:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-04 21:47:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-08-04 21:47:06,973 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-08-04 21:47:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:06,974 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-08-04 21:47:06,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:47:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-08-04 21:47:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-04 21:47:06,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:06,975 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-08-04 21:47:06,975 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:06,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:06,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1028450586, now seen corresponding path program 44 times [2019-08-04 21:47:06,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:07,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-04 21:47:07,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:07,117 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-04 21:47:07,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:07,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:07,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:07,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:08,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:08,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:47:08,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:47:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:47:08,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:47:08,689 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 47 states. [2019-08-04 21:47:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:09,117 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-08-04 21:47:09,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:47:09,118 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 180 [2019-08-04 21:47:09,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:09,119 INFO L225 Difference]: With dead ends: 186 [2019-08-04 21:47:09,119 INFO L226 Difference]: Without dead ends: 186 [2019-08-04 21:47:09,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:47:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-04 21:47:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-08-04 21:47:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-04 21:47:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-08-04 21:47:09,123 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-08-04 21:47:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:09,124 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-08-04 21:47:09,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:47:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-08-04 21:47:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-04 21:47:09,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:09,125 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-08-04 21:47:09,125 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:09,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1960470251, now seen corresponding path program 45 times [2019-08-04 21:47:09,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:09,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-04 21:47:09,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:09,268 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-04 21:47:09,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:09,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:09,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:09,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:10,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:10,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:47:10,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:47:10,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:47:10,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:47:10,977 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 48 states. [2019-08-04 21:47:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:11,227 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-08-04 21:47:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:47:11,227 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 184 [2019-08-04 21:47:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:11,229 INFO L225 Difference]: With dead ends: 190 [2019-08-04 21:47:11,229 INFO L226 Difference]: Without dead ends: 190 [2019-08-04 21:47:11,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:47:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-04 21:47:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-08-04 21:47:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-04 21:47:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-08-04 21:47:11,233 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-08-04 21:47:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:11,233 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-08-04 21:47:11,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:47:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-08-04 21:47:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-04 21:47:11,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:11,234 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-08-04 21:47:11,234 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 589311088, now seen corresponding path program 46 times [2019-08-04 21:47:11,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:11,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-04 21:47:11,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:11,371 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-04 21:47:11,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:11,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:11,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:11,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:12,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:47:12,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:47:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:47:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:47:12,848 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 49 states. [2019-08-04 21:47:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:13,117 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-08-04 21:47:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:47:13,118 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 188 [2019-08-04 21:47:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:13,119 INFO L225 Difference]: With dead ends: 194 [2019-08-04 21:47:13,119 INFO L226 Difference]: Without dead ends: 194 [2019-08-04 21:47:13,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:47:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-04 21:47:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-08-04 21:47:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-04 21:47:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-08-04 21:47:13,123 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-08-04 21:47:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:13,123 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-08-04 21:47:13,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:47:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-08-04 21:47:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-04 21:47:13,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:13,124 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-08-04 21:47:13,125 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash 105752437, now seen corresponding path program 47 times [2019-08-04 21:47:13,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:13,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-04 21:47:13,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:13,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-04 21:47:13,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:13,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:13,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:13,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:15,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:15,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:47:15,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:47:15,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:47:15,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:47:15,074 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 50 states. [2019-08-04 21:47:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:15,434 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-08-04 21:47:15,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:47:15,435 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 192 [2019-08-04 21:47:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:15,436 INFO L225 Difference]: With dead ends: 198 [2019-08-04 21:47:15,436 INFO L226 Difference]: Without dead ends: 198 [2019-08-04 21:47:15,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:47:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-04 21:47:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-08-04 21:47:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-04 21:47:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-08-04 21:47:15,440 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-08-04 21:47:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:15,440 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-08-04 21:47:15,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:47:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-08-04 21:47:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-04 21:47:15,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:15,441 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-08-04 21:47:15,442 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:15,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:15,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1351358458, now seen corresponding path program 48 times [2019-08-04 21:47:15,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:15,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-04 21:47:15,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:15,567 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-04 21:47:15,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:15,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:15,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:15,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:16,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:16,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:47:16,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:47:16,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:47:16,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:47:16,903 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 51 states. [2019-08-04 21:47:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:17,156 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2019-08-04 21:47:17,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:47:17,157 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2019-08-04 21:47:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:17,158 INFO L225 Difference]: With dead ends: 202 [2019-08-04 21:47:17,158 INFO L226 Difference]: Without dead ends: 202 [2019-08-04 21:47:17,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:47:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-04 21:47:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-08-04 21:47:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-04 21:47:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-08-04 21:47:17,162 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-08-04 21:47:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:17,162 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-08-04 21:47:17,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:47:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-08-04 21:47:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-04 21:47:17,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:17,163 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-08-04 21:47:17,164 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2103754239, now seen corresponding path program 49 times [2019-08-04 21:47:17,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:17,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-04 21:47:17,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:17,299 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-04 21:47:17,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:17,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:17,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:17,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:18,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:18,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:47:18,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:47:18,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:47:18,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:47:18,816 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 52 states. [2019-08-04 21:47:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:19,169 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-08-04 21:47:19,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:47:19,170 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 200 [2019-08-04 21:47:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:19,171 INFO L225 Difference]: With dead ends: 206 [2019-08-04 21:47:19,172 INFO L226 Difference]: Without dead ends: 206 [2019-08-04 21:47:19,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:47:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-04 21:47:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-08-04 21:47:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-04 21:47:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-08-04 21:47:19,175 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-08-04 21:47:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:19,176 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-08-04 21:47:19,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:47:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-08-04 21:47:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-04 21:47:19,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:19,177 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-08-04 21:47:19,177 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:19,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1581196924, now seen corresponding path program 50 times [2019-08-04 21:47:19,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:19,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-04 21:47:19,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:19,320 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-04 21:47:19,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:19,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:19,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:19,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:21,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:21,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:47:21,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:47:21,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:47:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:47:21,440 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 53 states. [2019-08-04 21:47:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:21,721 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-08-04 21:47:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:47:21,721 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2019-08-04 21:47:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:21,723 INFO L225 Difference]: With dead ends: 210 [2019-08-04 21:47:21,724 INFO L226 Difference]: Without dead ends: 210 [2019-08-04 21:47:21,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 152 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-04 21:47:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-04 21:47:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-08-04 21:47:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-04 21:47:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-08-04 21:47:21,728 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-08-04 21:47:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:21,728 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-08-04 21:47:21,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:47:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-08-04 21:47:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-04 21:47:21,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:21,730 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-08-04 21:47:21,730 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:21,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1142314359, now seen corresponding path program 51 times [2019-08-04 21:47:21,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:21,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-04 21:47:21,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:21,904 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-04 21:47:21,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:21,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:21,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:21,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:23,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:23,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:47:23,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:47:23,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:47:23,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:47:23,422 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 54 states. [2019-08-04 21:47:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:23,776 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2019-08-04 21:47:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:47:23,777 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 208 [2019-08-04 21:47:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:23,778 INFO L225 Difference]: With dead ends: 214 [2019-08-04 21:47:23,778 INFO L226 Difference]: Without dead ends: 214 [2019-08-04 21:47:23,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 155 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-04 21:47:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-04 21:47:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-08-04 21:47:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-08-04 21:47:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-08-04 21:47:23,781 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-08-04 21:47:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:23,782 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-08-04 21:47:23,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:47:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-08-04 21:47:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-08-04 21:47:23,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:23,783 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-08-04 21:47:23,783 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash 59273486, now seen corresponding path program 52 times [2019-08-04 21:47:23,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:23,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-04 21:47:23,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:23,939 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-04 21:47:23,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:23,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:23,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:23,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:25,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:25,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:47:25,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:47:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:47:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:47:25,546 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 55 states. [2019-08-04 21:47:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:25,904 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2019-08-04 21:47:25,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:47:25,906 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2019-08-04 21:47:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:25,907 INFO L225 Difference]: With dead ends: 218 [2019-08-04 21:47:25,907 INFO L226 Difference]: Without dead ends: 218 [2019-08-04 21:47:25,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:47:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-04 21:47:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-08-04 21:47:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-08-04 21:47:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-08-04 21:47:25,911 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-08-04 21:47:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:25,911 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-08-04 21:47:25,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:47:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-08-04 21:47:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-08-04 21:47:25,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:25,913 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-08-04 21:47:25,913 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash 967208211, now seen corresponding path program 53 times [2019-08-04 21:47:25,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:26,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-04 21:47:26,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:26,084 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-04 21:47:26,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:26,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:26,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:26,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:27,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:27,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:47:27,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:47:27,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:47:27,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:47:27,664 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 56 states. [2019-08-04 21:47:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:28,020 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-08-04 21:47:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:47:28,020 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 216 [2019-08-04 21:47:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:28,021 INFO L225 Difference]: With dead ends: 222 [2019-08-04 21:47:28,022 INFO L226 Difference]: Without dead ends: 222 [2019-08-04 21:47:28,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:47:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-08-04 21:47:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-08-04 21:47:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-04 21:47:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-08-04 21:47:28,025 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-08-04 21:47:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:28,025 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-08-04 21:47:28,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:47:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-08-04 21:47:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-08-04 21:47:28,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:28,026 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-08-04 21:47:28,027 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:28,027 INFO L82 PathProgramCache]: Analyzing trace with hash -122888552, now seen corresponding path program 54 times [2019-08-04 21:47:28,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:28,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-04 21:47:28,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:28,140 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-04 21:47:28,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:28,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:28,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:28,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:30,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:30,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:47:30,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:47:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:47:30,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:47:30,014 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 57 states. [2019-08-04 21:47:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:30,313 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-08-04 21:47:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:47:30,319 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 220 [2019-08-04 21:47:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:30,320 INFO L225 Difference]: With dead ends: 226 [2019-08-04 21:47:30,320 INFO L226 Difference]: Without dead ends: 226 [2019-08-04 21:47:30,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:47:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-08-04 21:47:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-08-04 21:47:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-08-04 21:47:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-08-04 21:47:30,323 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-08-04 21:47:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:30,324 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-08-04 21:47:30,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:47:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-08-04 21:47:30,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-08-04 21:47:30,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:30,325 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-08-04 21:47:30,325 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:30,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash 73729437, now seen corresponding path program 55 times [2019-08-04 21:47:30,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:30,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-04 21:47:30,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:30,476 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-04 21:47:30,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:30,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:30,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:30,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:32,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:32,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:47:32,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:47:32,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:47:32,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:47:32,104 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 58 states. [2019-08-04 21:47:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:32,523 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-08-04 21:47:32,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:47:32,524 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 224 [2019-08-04 21:47:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:32,525 INFO L225 Difference]: With dead ends: 230 [2019-08-04 21:47:32,525 INFO L226 Difference]: Without dead ends: 230 [2019-08-04 21:47:32,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:47:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-08-04 21:47:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-08-04 21:47:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-08-04 21:47:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-08-04 21:47:32,529 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-08-04 21:47:32,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:32,529 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-08-04 21:47:32,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:47:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-08-04 21:47:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-08-04 21:47:32,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:32,531 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-08-04 21:47:32,531 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:32,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1711791582, now seen corresponding path program 56 times [2019-08-04 21:47:32,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:32,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-04 21:47:32,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:32,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-04 21:47:32,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:32,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:32,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:32,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:34,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:34,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:47:34,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:47:34,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:47:34,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:47:34,637 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 59 states. [2019-08-04 21:47:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:34,931 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-08-04 21:47:34,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:47:34,932 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 228 [2019-08-04 21:47:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:34,934 INFO L225 Difference]: With dead ends: 234 [2019-08-04 21:47:34,934 INFO L226 Difference]: Without dead ends: 234 [2019-08-04 21:47:34,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:47:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-04 21:47:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-08-04 21:47:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-04 21:47:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-08-04 21:47:34,937 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-08-04 21:47:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:34,938 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-08-04 21:47:34,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:47:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-08-04 21:47:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-04 21:47:34,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:34,939 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-08-04 21:47:34,939 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1074826201, now seen corresponding path program 57 times [2019-08-04 21:47:34,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:35,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-04 21:47:35,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:35,132 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-04 21:47:35,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:35,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:35,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:35,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:37,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:37,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:47:37,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:47:37,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:47:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:47:37,225 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 60 states. [2019-08-04 21:47:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:37,542 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2019-08-04 21:47:37,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:47:37,543 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 232 [2019-08-04 21:47:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:37,544 INFO L225 Difference]: With dead ends: 238 [2019-08-04 21:47:37,544 INFO L226 Difference]: Without dead ends: 238 [2019-08-04 21:47:37,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 173 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-04 21:47:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-04 21:47:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-08-04 21:47:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-08-04 21:47:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-08-04 21:47:37,548 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-08-04 21:47:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:37,548 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-08-04 21:47:37,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:47:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-08-04 21:47:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-08-04 21:47:37,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:37,549 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-08-04 21:47:37,550 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:37,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1774961748, now seen corresponding path program 58 times [2019-08-04 21:47:37,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:37,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-04 21:47:37,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:37,701 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-04 21:47:37,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:37,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:37,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:37,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:39,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:39,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:47:39,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:47:39,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:47:39,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:47:39,729 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 61 states. [2019-08-04 21:47:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:40,065 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2019-08-04 21:47:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:47:40,065 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 236 [2019-08-04 21:47:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:40,067 INFO L225 Difference]: With dead ends: 242 [2019-08-04 21:47:40,067 INFO L226 Difference]: Without dead ends: 242 [2019-08-04 21:47:40,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 176 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-04 21:47:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-04 21:47:40,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-08-04 21:47:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-08-04 21:47:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-08-04 21:47:40,070 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-08-04 21:47:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:40,071 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-08-04 21:47:40,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:47:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-08-04 21:47:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-08-04 21:47:40,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:40,072 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-08-04 21:47:40,072 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:40,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:40,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1508919119, now seen corresponding path program 59 times [2019-08-04 21:47:40,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:40,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-04 21:47:40,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:40,263 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-04 21:47:40,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:40,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:40,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:40,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:42,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:42,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:47:42,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:47:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:47:42,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:47:42,161 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 62 states. [2019-08-04 21:47:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:42,483 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-08-04 21:47:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:47:42,484 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 240 [2019-08-04 21:47:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:42,485 INFO L225 Difference]: With dead ends: 246 [2019-08-04 21:47:42,486 INFO L226 Difference]: Without dead ends: 246 [2019-08-04 21:47:42,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:47:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-08-04 21:47:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-08-04 21:47:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-08-04 21:47:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-08-04 21:47:42,490 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-08-04 21:47:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:42,490 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-08-04 21:47:42,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:47:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-08-04 21:47:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-08-04 21:47:42,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:42,492 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-08-04 21:47:42,492 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash 841689910, now seen corresponding path program 60 times [2019-08-04 21:47:42,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:42,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-04 21:47:42,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:42,663 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-04 21:47:42,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:42,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:42,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:42,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:44,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:44,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:47:44,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:47:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:47:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:47:44,892 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 63 states. [2019-08-04 21:47:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:45,220 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-08-04 21:47:45,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:47:45,220 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 244 [2019-08-04 21:47:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:45,222 INFO L225 Difference]: With dead ends: 250 [2019-08-04 21:47:45,222 INFO L226 Difference]: Without dead ends: 250 [2019-08-04 21:47:45,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:47:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-08-04 21:47:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-08-04 21:47:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-08-04 21:47:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-08-04 21:47:45,225 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-08-04 21:47:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:45,226 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-08-04 21:47:45,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:47:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-08-04 21:47:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-08-04 21:47:45,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:45,227 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-08-04 21:47:45,228 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2037394629, now seen corresponding path program 61 times [2019-08-04 21:47:45,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:45,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-04 21:47:45,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:45,410 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-04 21:47:45,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:45,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:45,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:45,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:47,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:47,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:47:47,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:47:47,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:47:47,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:47:47,412 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 64 states. [2019-08-04 21:47:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:47,740 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-08-04 21:47:47,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:47:47,741 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 248 [2019-08-04 21:47:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:47,742 INFO L225 Difference]: With dead ends: 254 [2019-08-04 21:47:47,742 INFO L226 Difference]: Without dead ends: 254 [2019-08-04 21:47:47,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:47:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-04 21:47:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-08-04 21:47:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-04 21:47:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-08-04 21:47:47,747 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-08-04 21:47:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:47,747 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-08-04 21:47:47,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:47:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-08-04 21:47:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-08-04 21:47:47,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:47,749 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-08-04 21:47:47,749 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1218900160, now seen corresponding path program 62 times [2019-08-04 21:47:47,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:47,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-04 21:47:47,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:47,910 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-04 21:47:47,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:47,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:47,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:47,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:50,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:50,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:47:50,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:47:50,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:47:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:47:50,252 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 65 states. [2019-08-04 21:47:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:50,591 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-08-04 21:47:50,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:47:50,592 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-08-04 21:47:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:50,593 INFO L225 Difference]: With dead ends: 258 [2019-08-04 21:47:50,593 INFO L226 Difference]: Without dead ends: 258 [2019-08-04 21:47:50,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:47:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-08-04 21:47:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-08-04 21:47:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-04 21:47:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-08-04 21:47:50,597 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-08-04 21:47:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:50,597 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-08-04 21:47:50,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:47:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-08-04 21:47:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-08-04 21:47:50,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:50,598 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-08-04 21:47:50,599 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:50,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:50,599 INFO L82 PathProgramCache]: Analyzing trace with hash -952515643, now seen corresponding path program 63 times [2019-08-04 21:47:50,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:50,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-04 21:47:50,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:50,766 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-04 21:47:50,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:50,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:50,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:50,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:52,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:52,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:47:52,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:47:52,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:47:52,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:47:52,903 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 66 states. [2019-08-04 21:47:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:53,247 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2019-08-04 21:47:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:47:53,248 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2019-08-04 21:47:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:53,249 INFO L225 Difference]: With dead ends: 262 [2019-08-04 21:47:53,249 INFO L226 Difference]: Without dead ends: 262 [2019-08-04 21:47:53,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:47:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-08-04 21:47:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-08-04 21:47:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-08-04 21:47:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-08-04 21:47:53,253 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-08-04 21:47:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:53,254 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-08-04 21:47:53,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:47:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-08-04 21:47:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-08-04 21:47:53,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:53,255 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-08-04 21:47:53,256 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:53,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1248955466, now seen corresponding path program 64 times [2019-08-04 21:47:53,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:53,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-04 21:47:53,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:53,400 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-04 21:47:53,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:53,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:53,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:53,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:55,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:55,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:47:55,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:47:55,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:47:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:47:55,910 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 67 states. [2019-08-04 21:47:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:56,256 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-08-04 21:47:56,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:47:56,256 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 260 [2019-08-04 21:47:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:56,258 INFO L225 Difference]: With dead ends: 266 [2019-08-04 21:47:56,258 INFO L226 Difference]: Without dead ends: 266 [2019-08-04 21:47:56,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:47:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-08-04 21:47:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-08-04 21:47:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-08-04 21:47:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-08-04 21:47:56,262 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-08-04 21:47:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:56,262 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-08-04 21:47:56,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:47:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-08-04 21:47:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-08-04 21:47:56,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:56,264 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-08-04 21:47:56,264 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:56,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:56,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1675070031, now seen corresponding path program 65 times [2019-08-04 21:47:56,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:56,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 204 conjunts are in the unsatisfiable core [2019-08-04 21:47:56,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:56,430 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-04 21:47:56,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:56,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:56,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:56,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:58,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:58,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:47:58,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:47:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:47:58,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:47:58,630 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 68 states. [2019-08-04 21:47:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:58,972 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-08-04 21:47:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:47:58,973 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 264 [2019-08-04 21:47:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:58,974 INFO L225 Difference]: With dead ends: 270 [2019-08-04 21:47:58,974 INFO L226 Difference]: Without dead ends: 270 [2019-08-04 21:47:58,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 197 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-04 21:47:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-04 21:47:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-08-04 21:47:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-08-04 21:47:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-08-04 21:47:58,978 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-08-04 21:47:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:58,978 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-08-04 21:47:58,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:47:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-08-04 21:47:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-08-04 21:47:58,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:58,980 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-08-04 21:47:58,980 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:47:58,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1045757396, now seen corresponding path program 66 times [2019-08-04 21:47:58,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:59,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-04 21:47:59,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:59,145 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-04 21:47:59,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:59,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:59,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:59,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:01,976 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-04 21:48:01,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:01,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:48:01,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:48:01,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:48:01,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:48:01,977 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 69 states. [2019-08-04 21:48:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:02,339 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2019-08-04 21:48:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:48:02,340 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 268 [2019-08-04 21:48:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:02,341 INFO L225 Difference]: With dead ends: 274 [2019-08-04 21:48:02,341 INFO L226 Difference]: Without dead ends: 274 [2019-08-04 21:48:02,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:48:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-08-04 21:48:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-08-04 21:48:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-04 21:48:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-08-04 21:48:02,345 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-08-04 21:48:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:02,345 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-08-04 21:48:02,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:48:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-08-04 21:48:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-08-04 21:48:02,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:02,346 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-08-04 21:48:02,346 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:02,347 INFO L82 PathProgramCache]: Analyzing trace with hash -298637607, now seen corresponding path program 67 times [2019-08-04 21:48:02,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:02,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-04 21:48:02,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:02,515 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-04 21:48:02,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:02,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:02,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:02,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:05,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:05,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:48:05,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:48:05,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:48:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:48:05,100 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 70 states. [2019-08-04 21:48:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:05,460 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2019-08-04 21:48:05,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:48:05,461 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 272 [2019-08-04 21:48:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:05,462 INFO L225 Difference]: With dead ends: 278 [2019-08-04 21:48:05,463 INFO L226 Difference]: Without dead ends: 278 [2019-08-04 21:48:05,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:48:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-08-04 21:48:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-08-04 21:48:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-08-04 21:48:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-08-04 21:48:05,466 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-08-04 21:48:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:05,467 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-08-04 21:48:05,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:48:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-08-04 21:48:05,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-08-04 21:48:05,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:05,469 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-08-04 21:48:05,469 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:05,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:05,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1055177378, now seen corresponding path program 68 times [2019-08-04 21:48:05,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:05,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-04 21:48:05,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:05,642 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-04 21:48:05,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:05,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:05,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:05,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:08,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:08,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:48:08,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:48:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:48:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:48:08,053 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 71 states. [2019-08-04 21:48:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:08,414 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-08-04 21:48:08,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:48:08,415 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 276 [2019-08-04 21:48:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:08,416 INFO L225 Difference]: With dead ends: 282 [2019-08-04 21:48:08,416 INFO L226 Difference]: Without dead ends: 282 [2019-08-04 21:48:08,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:48:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-08-04 21:48:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-08-04 21:48:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-08-04 21:48:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-08-04 21:48:08,420 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-08-04 21:48:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:08,420 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-08-04 21:48:08,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:48:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-08-04 21:48:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-08-04 21:48:08,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:08,422 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-08-04 21:48:08,422 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:08,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1911121565, now seen corresponding path program 69 times [2019-08-04 21:48:08,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:08,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-04 21:48:08,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:08,658 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-04 21:48:08,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:08,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:08,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:08,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:11,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:11,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:48:11,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:48:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:48:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:48:11,446 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 72 states. [2019-08-04 21:48:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:11,806 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2019-08-04 21:48:11,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:48:11,806 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 280 [2019-08-04 21:48:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:11,808 INFO L225 Difference]: With dead ends: 286 [2019-08-04 21:48:11,808 INFO L226 Difference]: Without dead ends: 286 [2019-08-04 21:48:11,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:48:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-08-04 21:48:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-08-04 21:48:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-08-04 21:48:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-08-04 21:48:11,812 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-08-04 21:48:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:11,812 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-08-04 21:48:11,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:48:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-08-04 21:48:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-08-04 21:48:11,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:11,813 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-08-04 21:48:11,813 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash 93217512, now seen corresponding path program 70 times [2019-08-04 21:48:11,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:11,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-04 21:48:11,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:11,969 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-04 21:48:11,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:11,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:11,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:11,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:14,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:14,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:48:14,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:48:14,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:48:14,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:48:14,506 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 73 states. [2019-08-04 21:48:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:14,949 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-08-04 21:48:14,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:48:14,950 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 284 [2019-08-04 21:48:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:14,951 INFO L225 Difference]: With dead ends: 290 [2019-08-04 21:48:14,951 INFO L226 Difference]: Without dead ends: 290 [2019-08-04 21:48:14,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:48:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-08-04 21:48:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-08-04 21:48:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-08-04 21:48:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-08-04 21:48:14,955 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-08-04 21:48:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:14,955 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-08-04 21:48:14,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:48:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-08-04 21:48:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-08-04 21:48:14,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:14,957 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-08-04 21:48:14,957 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash 21750253, now seen corresponding path program 71 times [2019-08-04 21:48:14,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:15,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-04 21:48:15,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:15,127 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-04 21:48:15,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:15,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:15,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:15,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:17,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:17,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:48:17,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:48:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:48:17,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:48:17,753 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 74 states. [2019-08-04 21:48:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:18,194 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-08-04 21:48:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:48:18,195 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 288 [2019-08-04 21:48:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:18,196 INFO L225 Difference]: With dead ends: 294 [2019-08-04 21:48:18,197 INFO L226 Difference]: Without dead ends: 294 [2019-08-04 21:48:18,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:48:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-04 21:48:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-08-04 21:48:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-08-04 21:48:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-08-04 21:48:18,200 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-08-04 21:48:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:18,201 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-08-04 21:48:18,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:48:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-08-04 21:48:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-08-04 21:48:18,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:18,203 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-08-04 21:48:18,203 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:18,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:18,203 INFO L82 PathProgramCache]: Analyzing trace with hash -730311054, now seen corresponding path program 72 times [2019-08-04 21:48:18,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:18,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-04 21:48:18,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:18,421 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-04 21:48:18,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:18,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:18,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:18,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:21,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:21,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:48:21,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:48:21,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:48:21,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:48:21,278 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 75 states. [2019-08-04 21:48:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:21,675 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2019-08-04 21:48:21,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:48:21,676 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 292 [2019-08-04 21:48:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:21,677 INFO L225 Difference]: With dead ends: 298 [2019-08-04 21:48:21,677 INFO L226 Difference]: Without dead ends: 298 [2019-08-04 21:48:21,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:48:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-08-04 21:48:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-08-04 21:48:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-08-04 21:48:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-08-04 21:48:21,681 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-08-04 21:48:21,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:21,681 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-08-04 21:48:21,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:48:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-08-04 21:48:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-08-04 21:48:21,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:21,682 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-08-04 21:48:21,682 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:21,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:21,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1684209545, now seen corresponding path program 73 times [2019-08-04 21:48:21,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:21,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 228 conjunts are in the unsatisfiable core [2019-08-04 21:48:21,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:21,930 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-04 21:48:21,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:21,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:21,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:21,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:24,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:24,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:48:24,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:48:24,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:48:24,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:48:24,611 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 76 states. [2019-08-04 21:48:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:25,025 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2019-08-04 21:48:25,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:48:25,025 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 296 [2019-08-04 21:48:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:25,027 INFO L225 Difference]: With dead ends: 302 [2019-08-04 21:48:25,027 INFO L226 Difference]: Without dead ends: 302 [2019-08-04 21:48:25,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 221 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-04 21:48:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-08-04 21:48:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-08-04 21:48:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-08-04 21:48:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-08-04 21:48:25,030 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-08-04 21:48:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:25,031 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-08-04 21:48:25,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:48:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-08-04 21:48:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-08-04 21:48:25,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:25,032 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-08-04 21:48:25,032 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:25,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:25,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1935466500, now seen corresponding path program 74 times [2019-08-04 21:48:25,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:25,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 231 conjunts are in the unsatisfiable core [2019-08-04 21:48:25,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:25,257 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-04 21:48:25,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:25,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:25,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:25,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:28,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:28,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:48:28,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:48:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:48:28,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:48:28,002 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 77 states. [2019-08-04 21:48:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:28,409 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-08-04 21:48:28,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:48:28,409 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 300 [2019-08-04 21:48:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:28,411 INFO L225 Difference]: With dead ends: 306 [2019-08-04 21:48:28,411 INFO L226 Difference]: Without dead ends: 306 [2019-08-04 21:48:28,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:48:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-08-04 21:48:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-08-04 21:48:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-08-04 21:48:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-08-04 21:48:28,415 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-08-04 21:48:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:28,415 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-08-04 21:48:28,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:48:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-08-04 21:48:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-08-04 21:48:28,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:28,417 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-08-04 21:48:28,417 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:28,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1188295937, now seen corresponding path program 75 times [2019-08-04 21:48:28,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:28,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-04 21:48:28,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:28,640 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-04 21:48:28,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:28,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:28,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:28,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:31,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:31,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:48:31,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:48:31,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:48:31,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:48:31,854 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 78 states. [2019-08-04 21:48:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:32,276 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-08-04 21:48:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:48:32,276 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 304 [2019-08-04 21:48:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:32,278 INFO L225 Difference]: With dead ends: 310 [2019-08-04 21:48:32,278 INFO L226 Difference]: Without dead ends: 310 [2019-08-04 21:48:32,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:48:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-08-04 21:48:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-08-04 21:48:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-08-04 21:48:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-08-04 21:48:32,282 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-08-04 21:48:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:32,282 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-08-04 21:48:32,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:48:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-08-04 21:48:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-08-04 21:48:32,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:32,283 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-08-04 21:48:32,283 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:32,284 INFO L82 PathProgramCache]: Analyzing trace with hash 584630150, now seen corresponding path program 76 times [2019-08-04 21:48:32,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:32,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-04 21:48:32,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:32,469 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-04 21:48:32,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:32,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:32,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:32,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:35,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:35,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:48:35,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:48:35,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:48:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:48:35,443 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 79 states. [2019-08-04 21:48:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:35,903 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2019-08-04 21:48:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:48:35,904 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 308 [2019-08-04 21:48:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:35,906 INFO L225 Difference]: With dead ends: 314 [2019-08-04 21:48:35,906 INFO L226 Difference]: Without dead ends: 314 [2019-08-04 21:48:35,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:48:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-04 21:48:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-08-04 21:48:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-08-04 21:48:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-08-04 21:48:35,910 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-08-04 21:48:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:35,911 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-08-04 21:48:35,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:48:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-08-04 21:48:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-08-04 21:48:35,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:35,913 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-08-04 21:48:35,913 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:35,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2101690485, now seen corresponding path program 77 times [2019-08-04 21:48:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:36,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 240 conjunts are in the unsatisfiable core [2019-08-04 21:48:36,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:36,127 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-04 21:48:36,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:36,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:36,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:36,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:39,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:39,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:48:39,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:48:39,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:48:39,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:48:39,174 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 80 states. [2019-08-04 21:48:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:39,590 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2019-08-04 21:48:39,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:48:39,590 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 312 [2019-08-04 21:48:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:39,592 INFO L225 Difference]: With dead ends: 318 [2019-08-04 21:48:39,592 INFO L226 Difference]: Without dead ends: 318 [2019-08-04 21:48:39,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:48:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-08-04 21:48:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-08-04 21:48:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-08-04 21:48:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-08-04 21:48:39,596 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-08-04 21:48:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:39,597 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-08-04 21:48:39,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:48:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-08-04 21:48:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-08-04 21:48:39,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:39,598 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-08-04 21:48:39,598 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash 568538384, now seen corresponding path program 78 times [2019-08-04 21:48:39,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:39,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-04 21:48:39,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:39,802 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-04 21:48:39,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:39,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:39,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:39,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:43,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:43,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:48:43,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:48:43,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:48:43,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:48:43,221 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 81 states. [2019-08-04 21:48:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:43,641 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2019-08-04 21:48:43,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:48:43,642 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 316 [2019-08-04 21:48:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:43,643 INFO L225 Difference]: With dead ends: 322 [2019-08-04 21:48:43,644 INFO L226 Difference]: Without dead ends: 322 [2019-08-04 21:48:43,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:48:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-08-04 21:48:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-08-04 21:48:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-08-04 21:48:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-08-04 21:48:43,647 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-08-04 21:48:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:43,647 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-08-04 21:48:43,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:48:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-08-04 21:48:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-08-04 21:48:43,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:43,649 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-08-04 21:48:43,649 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:43,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1696292885, now seen corresponding path program 79 times [2019-08-04 21:48:43,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:43,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-04 21:48:43,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:43,852 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-04 21:48:43,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:43,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:43,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:43,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:47,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:47,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:48:47,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:48:47,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:48:47,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:48:47,345 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 82 states. [2019-08-04 21:48:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:47,795 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2019-08-04 21:48:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:48:47,796 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 320 [2019-08-04 21:48:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:47,798 INFO L225 Difference]: With dead ends: 326 [2019-08-04 21:48:47,798 INFO L226 Difference]: Without dead ends: 326 [2019-08-04 21:48:47,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:48:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-08-04 21:48:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-08-04 21:48:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-08-04 21:48:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-08-04 21:48:47,802 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-08-04 21:48:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:47,802 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-08-04 21:48:47,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:48:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-08-04 21:48:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-08-04 21:48:47,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:47,803 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-08-04 21:48:47,803 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1433632614, now seen corresponding path program 80 times [2019-08-04 21:48:47,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:48,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-04 21:48:48,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:48,058 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-04 21:48:48,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:48,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:48,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:48,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:51,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:51,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:48:51,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:48:51,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:48:51,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:48:51,804 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 83 states. [2019-08-04 21:48:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:52,239 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-08-04 21:48:52,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:48:52,240 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 324 [2019-08-04 21:48:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:52,242 INFO L225 Difference]: With dead ends: 330 [2019-08-04 21:48:52,242 INFO L226 Difference]: Without dead ends: 330 [2019-08-04 21:48:52,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 242 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-04 21:48:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-08-04 21:48:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-08-04 21:48:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-08-04 21:48:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-08-04 21:48:52,246 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-08-04 21:48:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:52,246 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-08-04 21:48:52,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:48:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-08-04 21:48:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-08-04 21:48:52,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:52,248 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-08-04 21:48:52,248 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1715480929, now seen corresponding path program 81 times [2019-08-04 21:48:52,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:52,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 252 conjunts are in the unsatisfiable core [2019-08-04 21:48:52,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:52,475 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-04 21:48:52,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:52,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:52,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:52,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:55,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:55,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:48:55,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:48:55,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:48:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:48:55,786 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 84 states. [2019-08-04 21:48:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:56,276 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2019-08-04 21:48:56,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:48:56,276 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 328 [2019-08-04 21:48:56,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:56,278 INFO L225 Difference]: With dead ends: 334 [2019-08-04 21:48:56,278 INFO L226 Difference]: Without dead ends: 334 [2019-08-04 21:48:56,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:48:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-08-04 21:48:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-08-04 21:48:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-08-04 21:48:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-08-04 21:48:56,283 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-08-04 21:48:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:56,283 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-08-04 21:48:56,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:48:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-08-04 21:48:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-08-04 21:48:56,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:56,284 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-08-04 21:48:56,284 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:48:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1939776036, now seen corresponding path program 82 times [2019-08-04 21:48:56,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:56,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 255 conjunts are in the unsatisfiable core [2019-08-04 21:48:56,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:56,508 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-04 21:48:56,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:56,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:56,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:56,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:59,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:59,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:48:59,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:48:59,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:48:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:48:59,903 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 85 states. [2019-08-04 21:49:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:00,349 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2019-08-04 21:49:00,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:49:00,350 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 332 [2019-08-04 21:49:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:00,352 INFO L225 Difference]: With dead ends: 338 [2019-08-04 21:49:00,352 INFO L226 Difference]: Without dead ends: 338 [2019-08-04 21:49:00,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:49:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-08-04 21:49:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-08-04 21:49:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-08-04 21:49:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-08-04 21:49:00,356 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-08-04 21:49:00,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:00,356 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-08-04 21:49:00,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:49:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-08-04 21:49:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-08-04 21:49:00,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:00,358 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-08-04 21:49:00,358 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1651647273, now seen corresponding path program 83 times [2019-08-04 21:49:00,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:00,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-04 21:49:00,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:00,576 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-04 21:49:00,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:00,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:00,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:00,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:04,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:04,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:49:04,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:49:04,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:49:04,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:49:04,150 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 86 states. [2019-08-04 21:49:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:04,606 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2019-08-04 21:49:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:49:04,607 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 336 [2019-08-04 21:49:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:04,609 INFO L225 Difference]: With dead ends: 342 [2019-08-04 21:49:04,609 INFO L226 Difference]: Without dead ends: 342 [2019-08-04 21:49:04,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:49:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-08-04 21:49:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-08-04 21:49:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-08-04 21:49:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-08-04 21:49:04,613 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-08-04 21:49:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:04,613 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-08-04 21:49:04,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:49:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-08-04 21:49:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-08-04 21:49:04,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:04,615 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-08-04 21:49:04,615 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:04,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash -907830866, now seen corresponding path program 84 times [2019-08-04 21:49:04,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:04,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-04 21:49:04,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:04,829 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-04 21:49:04,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:04,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:04,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:04,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:08,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:08,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:49:08,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:49:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:49:08,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:49:08,352 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 87 states. [2019-08-04 21:49:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:08,806 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2019-08-04 21:49:08,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:49:08,807 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 340 [2019-08-04 21:49:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:08,809 INFO L225 Difference]: With dead ends: 346 [2019-08-04 21:49:08,809 INFO L226 Difference]: Without dead ends: 346 [2019-08-04 21:49:08,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:49:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-08-04 21:49:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-08-04 21:49:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-08-04 21:49:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-08-04 21:49:08,812 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-08-04 21:49:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:08,813 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-08-04 21:49:08,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:49:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-08-04 21:49:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-08-04 21:49:08,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:08,814 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-08-04 21:49:08,814 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:08,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1761851981, now seen corresponding path program 85 times [2019-08-04 21:49:08,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:09,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 264 conjunts are in the unsatisfiable core [2019-08-04 21:49:09,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:09,050 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-04 21:49:09,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:09,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:09,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:09,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:12,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:12,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:49:12,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:49:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:49:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:49:12,701 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 88 states. [2019-08-04 21:49:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:13,180 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-08-04 21:49:13,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:49:13,180 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 344 [2019-08-04 21:49:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:13,182 INFO L225 Difference]: With dead ends: 350 [2019-08-04 21:49:13,183 INFO L226 Difference]: Without dead ends: 350 [2019-08-04 21:49:13,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 257 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-04 21:49:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-08-04 21:49:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-08-04 21:49:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-08-04 21:49:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-08-04 21:49:13,186 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-08-04 21:49:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:13,186 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-08-04 21:49:13,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:49:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-08-04 21:49:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-08-04 21:49:13,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:13,188 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-08-04 21:49:13,188 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1876596936, now seen corresponding path program 86 times [2019-08-04 21:49:13,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:13,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-04 21:49:13,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:13,439 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-04 21:49:13,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:13,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:13,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:13,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:17,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:17,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:49:17,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-04 21:49:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-04 21:49:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:49:17,094 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 89 states. [2019-08-04 21:49:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:17,568 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2019-08-04 21:49:17,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-04 21:49:17,569 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 348 [2019-08-04 21:49:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:17,571 INFO L225 Difference]: With dead ends: 354 [2019-08-04 21:49:17,571 INFO L226 Difference]: Without dead ends: 354 [2019-08-04 21:49:17,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:49:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-08-04 21:49:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-08-04 21:49:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-08-04 21:49:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-08-04 21:49:17,574 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-08-04 21:49:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:17,574 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-08-04 21:49:17,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-04 21:49:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-08-04 21:49:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-08-04 21:49:17,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:17,576 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-08-04 21:49:17,576 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:17,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1524089283, now seen corresponding path program 87 times [2019-08-04 21:49:17,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:17,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-04 21:49:17,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:17,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-04 21:49:17,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:17,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:17,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:17,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:21,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:21,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-04 21:49:21,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-04 21:49:21,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-04 21:49:21,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:49:21,650 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 90 states. [2019-08-04 21:49:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:22,153 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2019-08-04 21:49:22,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:49:22,154 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 352 [2019-08-04 21:49:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:22,156 INFO L225 Difference]: With dead ends: 358 [2019-08-04 21:49:22,156 INFO L226 Difference]: Without dead ends: 358 [2019-08-04 21:49:22,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:49:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-08-04 21:49:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-08-04 21:49:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-08-04 21:49:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-08-04 21:49:22,159 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-08-04 21:49:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:22,160 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-08-04 21:49:22,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-04 21:49:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-08-04 21:49:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-08-04 21:49:22,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:22,161 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-08-04 21:49:22,161 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1059982018, now seen corresponding path program 88 times [2019-08-04 21:49:22,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:22,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-04 21:49:22,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:22,513 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-04 21:49:22,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:22,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:22,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:22,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:26,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:26,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-04 21:49:26,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-04 21:49:26,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-04 21:49:26,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:49:26,348 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 91 states. [2019-08-04 21:49:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:26,890 INFO L93 Difference]: Finished difference Result 362 states and 362 transitions. [2019-08-04 21:49:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-04 21:49:26,890 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 356 [2019-08-04 21:49:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:26,892 INFO L225 Difference]: With dead ends: 362 [2019-08-04 21:49:26,892 INFO L226 Difference]: Without dead ends: 362 [2019-08-04 21:49:26,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:49:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-08-04 21:49:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-08-04 21:49:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-08-04 21:49:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-08-04 21:49:26,896 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-08-04 21:49:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:26,897 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-08-04 21:49:26,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-04 21:49:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-08-04 21:49:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-08-04 21:49:26,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:26,898 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-08-04 21:49:26,898 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1866462009, now seen corresponding path program 89 times [2019-08-04 21:49:26,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:27,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 276 conjunts are in the unsatisfiable core [2019-08-04 21:49:27,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:27,168 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-04 21:49:27,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:27,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:27,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:27,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:31,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:31,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-04 21:49:31,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-04 21:49:31,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-04 21:49:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:49:31,072 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 92 states. [2019-08-04 21:49:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:31,563 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2019-08-04 21:49:31,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:49:31,563 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 360 [2019-08-04 21:49:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:31,565 INFO L225 Difference]: With dead ends: 366 [2019-08-04 21:49:31,566 INFO L226 Difference]: Without dead ends: 366 [2019-08-04 21:49:31,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:49:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-08-04 21:49:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-08-04 21:49:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-08-04 21:49:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-08-04 21:49:31,569 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-08-04 21:49:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:31,570 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-08-04 21:49:31,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-04 21:49:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-08-04 21:49:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-08-04 21:49:31,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:31,571 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-08-04 21:49:31,571 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash -439909300, now seen corresponding path program 90 times [2019-08-04 21:49:31,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:31,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 279 conjunts are in the unsatisfiable core [2019-08-04 21:49:31,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:31,829 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-04 21:49:31,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:31,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:31,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:31,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:35,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:35,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-04 21:49:35,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-04 21:49:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-04 21:49:35,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:49:35,857 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 93 states. [2019-08-04 21:49:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:36,341 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-08-04 21:49:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-04 21:49:36,342 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 364 [2019-08-04 21:49:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:36,344 INFO L225 Difference]: With dead ends: 370 [2019-08-04 21:49:36,344 INFO L226 Difference]: Without dead ends: 370 [2019-08-04 21:49:36,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 272 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-04 21:49:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-08-04 21:49:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-08-04 21:49:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-08-04 21:49:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-08-04 21:49:36,348 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-08-04 21:49:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:36,348 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-08-04 21:49:36,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-04 21:49:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-08-04 21:49:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-08-04 21:49:36,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:36,350 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-08-04 21:49:36,350 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:36,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:36,350 INFO L82 PathProgramCache]: Analyzing trace with hash -208817839, now seen corresponding path program 91 times [2019-08-04 21:49:36,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:36,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-04 21:49:36,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:36,643 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-04 21:49:36,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:36,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:36,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:36,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:40,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:40,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-04 21:49:40,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-04 21:49:40,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-04 21:49:40,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:49:40,726 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 94 states. [2019-08-04 21:49:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:41,235 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2019-08-04 21:49:41,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:49:41,236 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 368 [2019-08-04 21:49:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:41,238 INFO L225 Difference]: With dead ends: 374 [2019-08-04 21:49:41,238 INFO L226 Difference]: Without dead ends: 374 [2019-08-04 21:49:41,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:49:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-08-04 21:49:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-08-04 21:49:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-08-04 21:49:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-08-04 21:49:41,242 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-08-04 21:49:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:41,242 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-08-04 21:49:41,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-04 21:49:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-08-04 21:49:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-08-04 21:49:41,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:41,244 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-08-04 21:49:41,244 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash 683398102, now seen corresponding path program 92 times [2019-08-04 21:49:41,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:41,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-04 21:49:41,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:41,632 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-04 21:49:41,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:41,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:41,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:41,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:45,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:45,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-04 21:49:45,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-04 21:49:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-04 21:49:45,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:49:45,971 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 95 states. [2019-08-04 21:49:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:46,469 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2019-08-04 21:49:46,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-04 21:49:46,470 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 372 [2019-08-04 21:49:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:46,472 INFO L225 Difference]: With dead ends: 378 [2019-08-04 21:49:46,472 INFO L226 Difference]: Without dead ends: 378 [2019-08-04 21:49:46,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 278 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-04 21:49:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-08-04 21:49:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-08-04 21:49:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-08-04 21:49:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-08-04 21:49:46,476 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-08-04 21:49:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:46,477 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-08-04 21:49:46,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-04 21:49:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-08-04 21:49:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-08-04 21:49:46,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:46,478 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-08-04 21:49:46,478 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:46,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash -44356645, now seen corresponding path program 93 times [2019-08-04 21:49:46,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:46,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 288 conjunts are in the unsatisfiable core [2019-08-04 21:49:46,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:46,761 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-04 21:49:46,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:46,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:46,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:46,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:51,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:51,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-04 21:49:51,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-04 21:49:51,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-04 21:49:51,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:49:51,053 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 96 states. [2019-08-04 21:49:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:51,607 INFO L93 Difference]: Finished difference Result 382 states and 382 transitions. [2019-08-04 21:49:51,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-04 21:49:51,608 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 376 [2019-08-04 21:49:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:51,610 INFO L225 Difference]: With dead ends: 382 [2019-08-04 21:49:51,610 INFO L226 Difference]: Without dead ends: 382 [2019-08-04 21:49:51,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:49:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-08-04 21:49:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-08-04 21:49:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-08-04 21:49:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-08-04 21:49:51,614 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-08-04 21:49:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:51,614 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-08-04 21:49:51,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-04 21:49:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-08-04 21:49:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-08-04 21:49:51,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:51,616 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-08-04 21:49:51,616 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:51,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:51,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1121253728, now seen corresponding path program 94 times [2019-08-04 21:49:51,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:51,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-04 21:49:51,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:51,923 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-04 21:49:51,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:51,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:51,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:51,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:49:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:49:56,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:49:56,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-04 21:49:56,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-04 21:49:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-04 21:49:56,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:49:56,253 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 97 states. [2019-08-04 21:49:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:49:56,794 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2019-08-04 21:49:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-04 21:49:56,795 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 380 [2019-08-04 21:49:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:49:56,797 INFO L225 Difference]: With dead ends: 386 [2019-08-04 21:49:56,797 INFO L226 Difference]: Without dead ends: 386 [2019-08-04 21:49:56,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:49:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-08-04 21:49:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-08-04 21:49:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-08-04 21:49:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-08-04 21:49:56,801 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-08-04 21:49:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:49:56,801 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-08-04 21:49:56,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-04 21:49:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-08-04 21:49:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-08-04 21:49:56,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:49:56,803 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-08-04 21:49:56,803 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:49:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:49:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1945271397, now seen corresponding path program 95 times [2019-08-04 21:49:56,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:49:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:49:57,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-04 21:49:57,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:49:57,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-04 21:49:57,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:49:57,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:49:57,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:49:57,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:50:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:01,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:01,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-04 21:50:01,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-04 21:50:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-04 21:50:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:50:01,548 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 98 states. [2019-08-04 21:50:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:02,071 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-08-04 21:50:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-04 21:50:02,071 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 384 [2019-08-04 21:50:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:02,073 INFO L225 Difference]: With dead ends: 390 [2019-08-04 21:50:02,073 INFO L226 Difference]: Without dead ends: 390 [2019-08-04 21:50:02,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:50:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-08-04 21:50:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-08-04 21:50:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-08-04 21:50:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-08-04 21:50:02,077 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-08-04 21:50:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:02,077 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-08-04 21:50:02,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-04 21:50:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-08-04 21:50:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-08-04 21:50:02,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:02,078 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-08-04 21:50:02,079 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:50:02,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash 81589482, now seen corresponding path program 96 times [2019-08-04 21:50:02,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:02,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-04 21:50:02,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:02,406 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-04 21:50:02,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:50:02,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:50:02,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:50:02,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:50:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:06,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:06,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-04 21:50:06,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-04 21:50:06,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-04 21:50:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:50:06,970 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 99 states. [2019-08-04 21:50:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:07,568 INFO L93 Difference]: Finished difference Result 394 states and 394 transitions. [2019-08-04 21:50:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-04 21:50:07,568 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 388 [2019-08-04 21:50:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:07,570 INFO L225 Difference]: With dead ends: 394 [2019-08-04 21:50:07,570 INFO L226 Difference]: Without dead ends: 394 [2019-08-04 21:50:07,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:50:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-08-04 21:50:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-08-04 21:50:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-08-04 21:50:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-08-04 21:50:07,573 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-08-04 21:50:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:07,574 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-08-04 21:50:07,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-04 21:50:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-08-04 21:50:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-08-04 21:50:07,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:07,575 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-08-04 21:50:07,576 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:50:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:07,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1289903377, now seen corresponding path program 97 times [2019-08-04 21:50:07,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:07,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 300 conjunts are in the unsatisfiable core [2019-08-04 21:50:07,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:07,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-04 21:50:07,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:50:07,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:50:07,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:50:07,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:50:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:12,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:12,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-04 21:50:12,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-04 21:50:12,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-04 21:50:12,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:50:12,503 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 100 states. [2019-08-04 21:50:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:13,114 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2019-08-04 21:50:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-04 21:50:13,115 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 392 [2019-08-04 21:50:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:13,117 INFO L225 Difference]: With dead ends: 398 [2019-08-04 21:50:13,117 INFO L226 Difference]: Without dead ends: 398 [2019-08-04 21:50:13,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:50:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-04 21:50:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-08-04 21:50:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-08-04 21:50:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-08-04 21:50:13,121 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-08-04 21:50:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:13,122 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-08-04 21:50:13,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-04 21:50:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-08-04 21:50:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-08-04 21:50:13,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:13,124 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-08-04 21:50:13,124 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:50:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash -711080332, now seen corresponding path program 98 times [2019-08-04 21:50:13,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:13,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 303 conjunts are in the unsatisfiable core [2019-08-04 21:50:13,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:13,477 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-04 21:50:13,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:50:13,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:50:13,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:50:13,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:50:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:50:18,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:50:18,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-04 21:50:18,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-04 21:50:18,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-04 21:50:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:50:18,184 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 101 states. [2019-08-04 21:50:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:50:18,767 INFO L93 Difference]: Finished difference Result 402 states and 402 transitions. [2019-08-04 21:50:18,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-04 21:50:18,767 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 396 [2019-08-04 21:50:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:50:18,769 INFO L225 Difference]: With dead ends: 402 [2019-08-04 21:50:18,770 INFO L226 Difference]: Without dead ends: 402 [2019-08-04 21:50:18,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:50:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-08-04 21:50:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-08-04 21:50:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-08-04 21:50:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-08-04 21:50:18,774 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-08-04 21:50:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:50:18,775 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-08-04 21:50:18,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-04 21:50:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-08-04 21:50:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-08-04 21:50:18,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:50:18,777 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-08-04 21:50:18,777 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-04 21:50:18,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:50:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1398366343, now seen corresponding path program 99 times [2019-08-04 21:50:18,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:50:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:50:19,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 306 conjunts are in the unsatisfiable core [2019-08-04 21:50:19,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:50:19,121 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-04 21:50:19,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:50:19,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:50:19,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:50:19,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 Received shutdown request... [2019-08-04 21:50:21,636 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:50:21,636 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:50:21,640 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:50:21,641 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:50:21 BoogieIcfgContainer [2019-08-04 21:50:21,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:50:21,642 INFO L168 Benchmark]: Toolchain (without parser) took 241095.11 ms. Allocated memory was 135.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 112.4 MB in the beginning and 983.1 MB in the end (delta: -870.8 MB). Peak memory consumption was 649.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:50:21,642 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory is still 113.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:50:21,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.72 ms. Allocated memory is still 135.3 MB. Free memory was 112.4 MB in the beginning and 110.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:50:21,643 INFO L168 Benchmark]: Boogie Preprocessor took 29.81 ms. Allocated memory is still 135.3 MB. Free memory was 110.2 MB in the beginning and 108.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:50:21,643 INFO L168 Benchmark]: RCFGBuilder took 439.24 ms. Allocated memory is still 135.3 MB. Free memory was 108.9 MB in the beginning and 95.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:50:21,644 INFO L168 Benchmark]: TraceAbstraction took 240562.00 ms. Allocated memory was 135.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 95.1 MB in the beginning and 983.1 MB in the end (delta: -888.0 MB). Peak memory consumption was 631.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:50:21,646 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory is still 113.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.72 ms. Allocated memory is still 135.3 MB. Free memory was 112.4 MB in the beginning and 110.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.81 ms. Allocated memory is still 135.3 MB. Free memory was 110.2 MB in the beginning and 108.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 439.24 ms. Allocated memory is still 135.3 MB. Free memory was 108.9 MB in the beginning and 95.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240562.00 ms. Allocated memory was 135.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 95.1 MB in the beginning and 983.1 MB in the end (delta: -888.0 MB). Peak memory consumption was 631.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 401 with TraceHistMax 100,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 401 with TraceHistMax 100,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. TIMEOUT Result, 240.4s OverallTime, 102 OverallIterations, 100 TraceHistogramMax, 30.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 311 SDtfs, 4956 SDslu, 4952 SDs, 0 SdLazy, 15853 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19710 GetRequests, 14758 SyntacticMatches, 0 SemanticMatches, 4952 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 174.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=401occurred in iteration=101, 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, 99 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 8.4s SatisfiabilityAnalysisTime, 197.3s InterpolantComputationTime, 19811 NumberOfCodeBlocks, 19811 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 19710 ConstructedInterpolants, 0 QuantifiedInterpolants, 46927041 SizeOfPredicates, 398 NumberOfNonLiveVariables, 60542 ConjunctsInSsa, 15453 ConjunctsInUnsatCore, 101 InterpolantComputations, 3 PerfectInterpolantSequences, 2/641951 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown